23.24/10.19 YES 23.24/10.19 23.24/10.20 Ultimate: Cannot open display: 23.24/10.20 This is Ultimate 0.1.24-8dc7c08-m 23.24/10.20 [2019-03-28 12:34:45,919 INFO L170 SettingsManager]: Resetting all preferences to default values... 23.24/10.20 [2019-03-28 12:34:45,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 23.24/10.20 [2019-03-28 12:34:45,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 23.24/10.20 [2019-03-28 12:34:45,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 23.24/10.20 [2019-03-28 12:34:45,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 23.24/10.20 [2019-03-28 12:34:45,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 23.24/10.20 [2019-03-28 12:34:45,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 23.24/10.20 [2019-03-28 12:34:45,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 23.24/10.20 [2019-03-28 12:34:45,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 23.24/10.20 [2019-03-28 12:34:45,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 23.24/10.20 [2019-03-28 12:34:45,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 23.24/10.20 [2019-03-28 12:34:45,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 23.24/10.20 [2019-03-28 12:34:45,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 23.24/10.20 [2019-03-28 12:34:45,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 23.24/10.20 [2019-03-28 12:34:45,946 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 23.24/10.20 [2019-03-28 12:34:45,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 23.24/10.20 [2019-03-28 12:34:45,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 23.24/10.20 [2019-03-28 12:34:45,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 23.24/10.20 [2019-03-28 12:34:45,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 23.24/10.20 [2019-03-28 12:34:45,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 23.24/10.20 [2019-03-28 12:34:45,956 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 23.24/10.20 [2019-03-28 12:34:45,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 23.24/10.20 [2019-03-28 12:34:45,957 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 23.24/10.20 [2019-03-28 12:34:45,958 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 23.24/10.20 [2019-03-28 12:34:45,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 23.24/10.20 [2019-03-28 12:34:45,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 23.24/10.20 [2019-03-28 12:34:45,961 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 23.24/10.20 [2019-03-28 12:34:45,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 23.24/10.20 [2019-03-28 12:34:45,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 23.24/10.20 [2019-03-28 12:34:45,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 23.24/10.20 [2019-03-28 12:34:45,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 23.24/10.20 [2019-03-28 12:34:45,964 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 23.24/10.20 [2019-03-28 12:34:45,979 INFO L110 SettingsManager]: Loading preferences was successful 23.24/10.20 [2019-03-28 12:34:45,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 23.24/10.20 [2019-03-28 12:34:45,981 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 23.24/10.20 [2019-03-28 12:34:45,981 INFO L133 SettingsManager]: * Rewrite not-equals=true 23.24/10.20 [2019-03-28 12:34:45,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 23.24/10.20 [2019-03-28 12:34:45,981 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 23.24/10.20 [2019-03-28 12:34:45,981 INFO L133 SettingsManager]: * Use SBE=true 23.24/10.20 [2019-03-28 12:34:45,982 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 23.24/10.20 [2019-03-28 12:34:45,982 INFO L133 SettingsManager]: * Use old map elimination=false 23.24/10.20 [2019-03-28 12:34:45,982 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 23.24/10.20 [2019-03-28 12:34:45,982 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 23.24/10.20 [2019-03-28 12:34:45,982 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 23.24/10.20 [2019-03-28 12:34:45,983 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 23.24/10.20 [2019-03-28 12:34:45,983 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 23.24/10.20 [2019-03-28 12:34:45,983 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 23.24/10.20 [2019-03-28 12:34:45,983 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 23.24/10.20 [2019-03-28 12:34:45,983 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 23.24/10.20 [2019-03-28 12:34:45,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE 23.24/10.20 [2019-03-28 12:34:45,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 23.24/10.20 [2019-03-28 12:34:45,984 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 23.24/10.20 [2019-03-28 12:34:45,984 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 23.24/10.20 [2019-03-28 12:34:45,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 23.24/10.20 [2019-03-28 12:34:45,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 23.24/10.20 [2019-03-28 12:34:45,985 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 23.24/10.20 [2019-03-28 12:34:45,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 23.24/10.20 [2019-03-28 12:34:45,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 23.24/10.20 [2019-03-28 12:34:45,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 23.24/10.20 [2019-03-28 12:34:45,986 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 23.24/10.20 [2019-03-28 12:34:45,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 23.24/10.20 [2019-03-28 12:34:46,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 23.24/10.20 [2019-03-28 12:34:46,025 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 23.24/10.20 [2019-03-28 12:34:46,028 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 23.24/10.20 [2019-03-28 12:34:46,030 INFO L271 PluginConnector]: Initializing CDTParser... 23.24/10.20 [2019-03-28 12:34:46,030 INFO L276 PluginConnector]: CDTParser initialized 23.24/10.20 [2019-03-28 12:34:46,031 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 23.24/10.20 [2019-03-28 12:34:46,087 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8f18e41bc3c54cf897bf980619ba1b8d/FLAGa223cd8eb 23.24/10.20 [2019-03-28 12:34:46,442 INFO L307 CDTParser]: Found 1 translation units. 23.24/10.20 [2019-03-28 12:34:46,443 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 23.24/10.20 [2019-03-28 12:34:46,443 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 23.24/10.20 [2019-03-28 12:34:46,449 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8f18e41bc3c54cf897bf980619ba1b8d/FLAGa223cd8eb 23.24/10.20 [2019-03-28 12:34:46,859 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8f18e41bc3c54cf897bf980619ba1b8d 23.24/10.20 [2019-03-28 12:34:46,871 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 23.24/10.20 [2019-03-28 12:34:46,872 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 23.24/10.20 [2019-03-28 12:34:46,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 23.24/10.20 [2019-03-28 12:34:46,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 23.24/10.20 [2019-03-28 12:34:46,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 23.24/10.20 [2019-03-28 12:34:46,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:46" (1/1) ... 23.24/10.20 [2019-03-28 12:34:46,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9289e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:46, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:46,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:46" (1/1) ... 23.24/10.20 [2019-03-28 12:34:46,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 23.24/10.20 [2019-03-28 12:34:46,907 INFO L176 MainTranslator]: Built tables and reachable declarations 23.24/10.20 [2019-03-28 12:34:47,071 INFO L206 PostProcessor]: Analyzing one entry point: main 23.24/10.20 [2019-03-28 12:34:47,083 INFO L191 MainTranslator]: Completed pre-run 23.24/10.20 [2019-03-28 12:34:47,152 INFO L206 PostProcessor]: Analyzing one entry point: main 23.24/10.20 [2019-03-28 12:34:47,168 INFO L195 MainTranslator]: Completed translation 23.24/10.20 [2019-03-28 12:34:47,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47 WrapperNode 23.24/10.20 [2019-03-28 12:34:47,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 23.24/10.20 [2019-03-28 12:34:47,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 23.24/10.20 [2019-03-28 12:34:47,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 23.24/10.20 [2019-03-28 12:34:47,170 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 23.24/10.20 [2019-03-28 12:34:47,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 23.24/10.20 [2019-03-28 12:34:47,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 23.24/10.20 [2019-03-28 12:34:47,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 23.24/10.20 [2019-03-28 12:34:47,212 INFO L276 PluginConnector]: Boogie Preprocessor initialized 23.24/10.20 [2019-03-28 12:34:47,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 23.24/10.20 [2019-03-28 12:34:47,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 23.24/10.20 [2019-03-28 12:34:47,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... 23.24/10.20 [2019-03-28 12:34:47,236 INFO L276 PluginConnector]: RCFGBuilder initialized 23.24/10.20 [2019-03-28 12:34:47,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 23.24/10.20 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 23.24/10.20 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 23.24/10.20 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 23.24/10.20 [2019-03-28 12:34:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 23.24/10.20 [2019-03-28 12:34:47,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 23.24/10.20 [2019-03-28 12:34:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 23.24/10.20 [2019-03-28 12:34:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 23.24/10.20 [2019-03-28 12:34:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 23.24/10.20 [2019-03-28 12:34:47,524 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 23.24/10.20 [2019-03-28 12:34:47,524 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 23.24/10.20 [2019-03-28 12:34:47,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47 BoogieIcfgContainer 23.24/10.20 [2019-03-28 12:34:47,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 23.24/10.20 [2019-03-28 12:34:47,527 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 23.24/10.20 [2019-03-28 12:34:47,527 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 23.24/10.20 [2019-03-28 12:34:47,529 INFO L276 PluginConnector]: BlockEncodingV2 initialized 23.24/10.20 [2019-03-28 12:34:47,530 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47" (1/1) ... 23.24/10.20 [2019-03-28 12:34:47,547 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 23 edges 23.24/10.20 [2019-03-28 12:34:47,549 INFO L258 BlockEncoder]: Using Remove infeasible edges 23.24/10.20 [2019-03-28 12:34:47,550 INFO L263 BlockEncoder]: Using Maximize final states 23.24/10.20 [2019-03-28 12:34:47,550 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 23.24/10.20 [2019-03-28 12:34:47,551 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 23.24/10.20 [2019-03-28 12:34:47,552 INFO L296 BlockEncoder]: Using Remove sink states 23.24/10.20 [2019-03-28 12:34:47,553 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 23.24/10.20 [2019-03-28 12:34:47,553 INFO L179 BlockEncoder]: Using Rewrite not-equals 23.24/10.20 [2019-03-28 12:34:47,573 INFO L185 BlockEncoder]: Using Use SBE 23.24/10.20 [2019-03-28 12:34:47,596 INFO L200 BlockEncoder]: SBE split 6 edges 23.24/10.20 [2019-03-28 12:34:47,601 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 23.24/10.20 [2019-03-28 12:34:47,603 INFO L71 MaximizeFinalStates]: 0 new accepting states 23.24/10.20 [2019-03-28 12:34:47,638 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 23.24/10.20 [2019-03-28 12:34:47,641 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 23.24/10.20 [2019-03-28 12:34:47,643 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 23.24/10.20 [2019-03-28 12:34:47,643 INFO L71 MaximizeFinalStates]: 0 new accepting states 23.24/10.20 [2019-03-28 12:34:47,643 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 23.24/10.20 [2019-03-28 12:34:47,644 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 23.24/10.20 [2019-03-28 12:34:47,644 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges 23.24/10.20 [2019-03-28 12:34:47,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:47 BasicIcfg 23.24/10.20 [2019-03-28 12:34:47,645 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 23.24/10.20 [2019-03-28 12:34:47,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 23.24/10.20 [2019-03-28 12:34:47,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... 23.24/10.20 [2019-03-28 12:34:47,650 INFO L276 PluginConnector]: TraceAbstraction initialized 23.24/10.20 [2019-03-28 12:34:47,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:34:46" (1/4) ... 23.24/10.20 [2019-03-28 12:34:47,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d684c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:47, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:47,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (2/4) ... 23.24/10.20 [2019-03-28 12:34:47,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d684c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:47, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:47,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47" (3/4) ... 23.24/10.20 [2019-03-28 12:34:47,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d684c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:47, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:47,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:47" (4/4) ... 23.24/10.20 [2019-03-28 12:34:47,654 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 23.24/10.20 [2019-03-28 12:34:47,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 23.24/10.20 [2019-03-28 12:34:47,673 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. 23.24/10.20 [2019-03-28 12:34:47,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. 23.24/10.20 [2019-03-28 12:34:47,724 INFO L133 ementStrategyFactory]: Using default assertion order modulation 23.24/10.20 [2019-03-28 12:34:47,725 INFO L382 AbstractCegarLoop]: Interprodecural is true 23.24/10.20 [2019-03-28 12:34:47,725 INFO L383 AbstractCegarLoop]: Hoare is true 23.24/10.20 [2019-03-28 12:34:47,725 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 23.24/10.20 [2019-03-28 12:34:47,726 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 23.24/10.20 [2019-03-28 12:34:47,726 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 23.24/10.20 [2019-03-28 12:34:47,726 INFO L387 AbstractCegarLoop]: Difference is false 23.24/10.20 [2019-03-28 12:34:47,726 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 23.24/10.20 [2019-03-28 12:34:47,726 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 23.24/10.20 [2019-03-28 12:34:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. 23.24/10.20 [2019-03-28 12:34:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 23.24/10.20 [2019-03-28 12:34:47,748 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:47,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:47,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:47,756 INFO L82 PathProgramCache]: Analyzing trace with hash 427553221, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:47,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:47,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:47,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:47,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:47,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 23.24/10.20 [2019-03-28 12:34:47,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 23.24/10.20 [2019-03-28 12:34:47,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 23.24/10.20 [2019-03-28 12:34:47,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 23.24/10.20 [2019-03-28 12:34:47,955 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. 23.24/10.20 [2019-03-28 12:34:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:48,047 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. 23.24/10.20 [2019-03-28 12:34:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 23.24/10.20 [2019-03-28 12:34:48,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:48,061 INFO L225 Difference]: With dead ends: 25 23.24/10.20 [2019-03-28 12:34:48,061 INFO L226 Difference]: Without dead ends: 18 23.24/10.20 [2019-03-28 12:34:48,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 23.24/10.20 [2019-03-28 12:34:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 23.24/10.20 [2019-03-28 12:34:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. 23.24/10.20 [2019-03-28 12:34:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 23.24/10.20 [2019-03-28 12:34:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. 23.24/10.20 [2019-03-28 12:34:48,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:48,101 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 19 transitions. 23.24/10.20 [2019-03-28 12:34:48,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 23.24/10.20 [2019-03-28 12:34:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 19 transitions. 23.24/10.20 [2019-03-28 12:34:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 23.24/10.20 [2019-03-28 12:34:48,102 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:48,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:48,102 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash 427554182, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:48,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:48,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:48,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:48,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 23.24/10.20 [2019-03-28 12:34:48,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 23.24/10.20 [2019-03-28 12:34:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 23.24/10.20 [2019-03-28 12:34:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 23.24/10.20 [2019-03-28 12:34:48,176 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. Second operand 5 states. 23.24/10.20 [2019-03-28 12:34:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:48,258 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. 23.24/10.20 [2019-03-28 12:34:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 23.24/10.20 [2019-03-28 12:34:48,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:48,259 INFO L225 Difference]: With dead ends: 12 23.24/10.20 [2019-03-28 12:34:48,260 INFO L226 Difference]: Without dead ends: 11 23.24/10.20 [2019-03-28 12:34:48,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 23.24/10.20 [2019-03-28 12:34:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 23.24/10.20 [2019-03-28 12:34:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 23.24/10.20 [2019-03-28 12:34:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 23.24/10.20 [2019-03-28 12:34:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 23.24/10.20 [2019-03-28 12:34:48,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:48,264 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. 23.24/10.20 [2019-03-28 12:34:48,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 23.24/10.20 [2019-03-28 12:34:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. 23.24/10.20 [2019-03-28 12:34:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 23.24/10.20 [2019-03-28 12:34:48,265 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:48,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:48,265 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash 427554184, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:48,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:48,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:48,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 23.24/10.20 [2019-03-28 12:34:48,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 23.24/10.20 [2019-03-28 12:34:48,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 23.24/10.20 [2019-03-28 12:34:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 23.24/10.20 [2019-03-28 12:34:48,316 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 5 states. 23.24/10.20 [2019-03-28 12:34:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:48,384 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. 23.24/10.20 [2019-03-28 12:34:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 23.24/10.20 [2019-03-28 12:34:48,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:48,387 INFO L225 Difference]: With dead ends: 16 23.24/10.20 [2019-03-28 12:34:48,387 INFO L226 Difference]: Without dead ends: 15 23.24/10.20 [2019-03-28 12:34:48,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 23.24/10.20 [2019-03-28 12:34:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 23.24/10.20 [2019-03-28 12:34:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. 23.24/10.20 [2019-03-28 12:34:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 23.24/10.20 [2019-03-28 12:34:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. 23.24/10.20 [2019-03-28 12:34:48,393 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:48,393 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. 23.24/10.20 [2019-03-28 12:34:48,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 23.24/10.20 [2019-03-28 12:34:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. 23.24/10.20 [2019-03-28 12:34:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 23.24/10.20 [2019-03-28 12:34:48,394 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:48,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:48,394 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 427554185, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:48,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:48,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:48,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 23.24/10.20 [2019-03-28 12:34:48,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 23.24/10.20 [2019-03-28 12:34:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 23.24/10.20 [2019-03-28 12:34:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 23.24/10.20 [2019-03-28 12:34:48,460 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 6 states. 23.24/10.20 [2019-03-28 12:34:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:48,576 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. 23.24/10.20 [2019-03-28 12:34:48,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 23.24/10.20 [2019-03-28 12:34:48,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:48,578 INFO L225 Difference]: With dead ends: 15 23.24/10.20 [2019-03-28 12:34:48,578 INFO L226 Difference]: Without dead ends: 14 23.24/10.20 [2019-03-28 12:34:48,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 23.24/10.20 [2019-03-28 12:34:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 23.24/10.20 [2019-03-28 12:34:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. 23.24/10.20 [2019-03-28 12:34:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 23.24/10.20 [2019-03-28 12:34:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. 23.24/10.20 [2019-03-28 12:34:48,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 23.24/10.20 [2019-03-28 12:34:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:48,582 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. 23.24/10.20 [2019-03-28 12:34:48,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 23.24/10.20 [2019-03-28 12:34:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. 23.24/10.20 [2019-03-28 12:34:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 23.24/10.20 [2019-03-28 12:34:48,583 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:48,583 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:48,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2012563625, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:48,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:48,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 23.24/10.20 [2019-03-28 12:34:48,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 23.24/10.20 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 23.24/10.20 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 23.24/10.20 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 23.24/10.20 [2019-03-28 12:34:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:48,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core 23.24/10.20 [2019-03-28 12:34:48,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.24/10.20 [2019-03-28 12:34:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:48,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:48,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 23.24/10.20 [2019-03-28 12:34:48,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 23.24/10.20 [2019-03-28 12:34:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 23.24/10.20 [2019-03-28 12:34:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 23.24/10.20 [2019-03-28 12:34:48,755 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 8 states. 23.24/10.20 [2019-03-28 12:34:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:48,923 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. 23.24/10.20 [2019-03-28 12:34:48,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 23.24/10.20 [2019-03-28 12:34:48,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 23.24/10.20 [2019-03-28 12:34:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:48,925 INFO L225 Difference]: With dead ends: 15 23.24/10.20 [2019-03-28 12:34:48,925 INFO L226 Difference]: Without dead ends: 14 23.24/10.20 [2019-03-28 12:34:48,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 23.24/10.20 [2019-03-28 12:34:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 23.24/10.20 [2019-03-28 12:34:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. 23.24/10.20 [2019-03-28 12:34:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 23.24/10.20 [2019-03-28 12:34:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. 23.24/10.20 [2019-03-28 12:34:48,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 12 23.24/10.20 [2019-03-28 12:34:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:48,929 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. 23.24/10.20 [2019-03-28 12:34:48,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 23.24/10.20 [2019-03-28 12:34:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. 23.24/10.20 [2019-03-28 12:34:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 23.24/10.20 [2019-03-28 12:34:48,930 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:48,930 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:48,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2012563626, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:48,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:48,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:49,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 23.24/10.20 [2019-03-28 12:34:49,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 23.24/10.20 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 23.24/10.20 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 23.24/10.20 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 23.24/10.20 [2019-03-28 12:34:49,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:49,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 28 conjunts are in the unsatisfiable core 23.24/10.20 [2019-03-28 12:34:49,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.24/10.20 [2019-03-28 12:34:49,131 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 23.24/10.20 [2019-03-28 12:34:49,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 23.24/10.20 [2019-03-28 12:34:49,139 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.24/10.20 [2019-03-28 12:34:49,140 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 23.24/10.20 [2019-03-28 12:34:49,140 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 23.24/10.20 [2019-03-28 12:34:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:49,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:49,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 23.24/10.20 [2019-03-28 12:34:49,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 23.24/10.20 [2019-03-28 12:34:49,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 23.24/10.20 [2019-03-28 12:34:49,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 23.24/10.20 [2019-03-28 12:34:49,276 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 15 states. 23.24/10.20 [2019-03-28 12:34:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:49,515 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. 23.24/10.20 [2019-03-28 12:34:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 23.24/10.20 [2019-03-28 12:34:49,516 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 23.24/10.20 [2019-03-28 12:34:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:49,517 INFO L225 Difference]: With dead ends: 21 23.24/10.20 [2019-03-28 12:34:49,517 INFO L226 Difference]: Without dead ends: 20 23.24/10.20 [2019-03-28 12:34:49,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 23.24/10.20 [2019-03-28 12:34:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 23.24/10.20 [2019-03-28 12:34:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. 23.24/10.20 [2019-03-28 12:34:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 23.24/10.20 [2019-03-28 12:34:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. 23.24/10.20 [2019-03-28 12:34:49,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 12 23.24/10.20 [2019-03-28 12:34:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:49,522 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. 23.24/10.20 [2019-03-28 12:34:49,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 23.24/10.20 [2019-03-28 12:34:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. 23.24/10.20 [2019-03-28 12:34:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 23.24/10.20 [2019-03-28 12:34:49,523 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:49,523 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:49,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2012564587, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:49,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:49,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:49,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:49,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:49,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 23.24/10.20 [2019-03-28 12:34:49,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 23.24/10.20 [2019-03-28 12:34:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 23.24/10.20 [2019-03-28 12:34:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 23.24/10.20 [2019-03-28 12:34:49,553 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 4 states. 23.24/10.20 [2019-03-28 12:34:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:49,582 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. 23.24/10.20 [2019-03-28 12:34:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 23.24/10.20 [2019-03-28 12:34:49,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 23.24/10.20 [2019-03-28 12:34:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:49,583 INFO L225 Difference]: With dead ends: 24 23.24/10.20 [2019-03-28 12:34:49,583 INFO L226 Difference]: Without dead ends: 18 23.24/10.20 [2019-03-28 12:34:49,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 23.24/10.20 [2019-03-28 12:34:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 23.24/10.20 [2019-03-28 12:34:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 23.24/10.20 [2019-03-28 12:34:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 23.24/10.20 [2019-03-28 12:34:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:49,587 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 23.24/10.20 [2019-03-28 12:34:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:49,587 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:49,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 23.24/10.20 [2019-03-28 12:34:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 23.24/10.20 [2019-03-28 12:34:49,588 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:49,588 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:49,588 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 396870185, now seen corresponding path program 2 times 23.24/10.20 [2019-03-28 12:34:49,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:49,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:49,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:49,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:49,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:49,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 23.24/10.20 [2019-03-28 12:34:49,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 23.24/10.20 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 23.24/10.20 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 23.24/10.20 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 23.24/10.20 [2019-03-28 12:34:49,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 23.24/10.20 [2019-03-28 12:34:49,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 23.24/10.20 [2019-03-28 12:34:49,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:49,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 35 conjunts are in the unsatisfiable core 23.24/10.20 [2019-03-28 12:34:49,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.24/10.20 [2019-03-28 12:34:49,746 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 23.24/10.20 [2019-03-28 12:34:49,746 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 23.24/10.20 [2019-03-28 12:34:49,752 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.24/10.20 [2019-03-28 12:34:49,753 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 23.24/10.20 [2019-03-28 12:34:49,753 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 23.24/10.20 [2019-03-28 12:34:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:49,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:49,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 23.24/10.20 [2019-03-28 12:34:49,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 23.24/10.20 [2019-03-28 12:34:49,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 23.24/10.20 [2019-03-28 12:34:49,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 23.24/10.20 [2019-03-28 12:34:49,920 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 18 states. 23.24/10.20 [2019-03-28 12:34:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:50,407 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. 23.24/10.20 [2019-03-28 12:34:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 23.24/10.20 [2019-03-28 12:34:50,407 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 23.24/10.20 [2019-03-28 12:34:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:50,408 INFO L225 Difference]: With dead ends: 28 23.24/10.20 [2019-03-28 12:34:50,408 INFO L226 Difference]: Without dead ends: 27 23.24/10.20 [2019-03-28 12:34:50,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 23.24/10.20 [2019-03-28 12:34:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 23.24/10.20 [2019-03-28 12:34:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. 23.24/10.20 [2019-03-28 12:34:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 23.24/10.20 [2019-03-28 12:34:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:50,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 17 23.24/10.20 [2019-03-28 12:34:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:50,413 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:50,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 23.24/10.20 [2019-03-28 12:34:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 23.24/10.20 [2019-03-28 12:34:50,414 INFO L394 BasicCegarLoop]: Found error trace 23.24/10.20 [2019-03-28 12:34:50,414 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:50,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 23.24/10.20 [2019-03-28 12:34:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:50,415 INFO L82 PathProgramCache]: Analyzing trace with hash 396871146, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:50,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:50,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:50,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 23.24/10.20 [2019-03-28 12:34:50,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 23.24/10.20 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 23.24/10.20 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 23.24/10.20 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 23.24/10.20 [2019-03-28 12:34:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:50,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core 23.24/10.20 [2019-03-28 12:34:50,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.24/10.20 [2019-03-28 12:34:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 23.24/10.20 [2019-03-28 12:34:50,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 23.24/10.20 [2019-03-28 12:34:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 23.24/10.20 [2019-03-28 12:34:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 23.24/10.20 [2019-03-28 12:34:50,522 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 5 states. 23.24/10.20 [2019-03-28 12:34:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:50,556 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. 23.24/10.20 [2019-03-28 12:34:50,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 23.24/10.20 [2019-03-28 12:34:50,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 23.24/10.20 [2019-03-28 12:34:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.24/10.20 [2019-03-28 12:34:50,558 INFO L225 Difference]: With dead ends: 23 23.24/10.20 [2019-03-28 12:34:50,558 INFO L226 Difference]: Without dead ends: 0 23.24/10.20 [2019-03-28 12:34:50,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 23.24/10.20 [2019-03-28 12:34:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 23.24/10.20 [2019-03-28 12:34:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 23.24/10.20 [2019-03-28 12:34:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 23.24/10.20 [2019-03-28 12:34:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:50,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 23.24/10.20 [2019-03-28 12:34:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. 23.24/10.20 [2019-03-28 12:34:50,560 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:50,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 23.24/10.20 [2019-03-28 12:34:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:50,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 23.24/10.20 [2019-03-28 12:34:50,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:50,701 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 23.24/10.20 [2019-03-28 12:34:50,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,704 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 19 32) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point L12-1(lines 12 13) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 14) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 15) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,705 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,706 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_cmemchr_~n (select |#length| ULTIMATE.start_cmemchr_~s.base))) (.cse1 (= 1 (select |#valid| ULTIMATE.start_cmemchr_~s.base))) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cmemchr_~p~0.base))) (.cse3 (select |#length| ULTIMATE.start_cmemchr_~p~0.base)) (.cse4 (<= 1 ULTIMATE.start_main_~n~0)) (.cse5 (= 0 ULTIMATE.start_cmemchr_~s.offset)) (.cse6 (<= 1 ULTIMATE.start_cmemchr_~n))) (or (and (= ULTIMATE.start_cmemchr_~p~0.offset 0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_cmemchr_~n .cse3) .cse4 .cse5 .cse6) (and (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_cmemchr_~p~0.offset ULTIMATE.start_cmemchr_~n) .cse3) (<= 1 ULTIMATE.start_cmemchr_~p~0.offset) .cse4 .cse5) .cse6))) 23.24/10.20 [2019-03-28 12:34:50,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 23.24/10.20 [2019-03-28 12:34:50,706 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 23.24/10.20 [2019-03-28 12:34:50,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:50,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:50 BasicIcfg 23.24/10.20 [2019-03-28 12:34:50,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 23.24/10.20 [2019-03-28 12:34:50,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 23.24/10.20 [2019-03-28 12:34:50,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 23.24/10.20 [2019-03-28 12:34:50,731 INFO L276 PluginConnector]: BuchiAutomizer initialized 23.24/10.20 [2019-03-28 12:34:50,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.24/10.20 [2019-03-28 12:34:50,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:34:46" (1/5) ... 23.24/10.20 [2019-03-28 12:34:50,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4429a70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:50, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:50,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.24/10.20 [2019-03-28 12:34:50,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (2/5) ... 23.24/10.20 [2019-03-28 12:34:50,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4429a70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:50, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:50,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.24/10.20 [2019-03-28 12:34:50,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47" (3/5) ... 23.24/10.20 [2019-03-28 12:34:50,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4429a70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:50, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:50,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.24/10.20 [2019-03-28 12:34:50,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:47" (4/5) ... 23.24/10.20 [2019-03-28 12:34:50,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4429a70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:50, skipping insertion in model container 23.24/10.20 [2019-03-28 12:34:50,734 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.24/10.20 [2019-03-28 12:34:50,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:50" (5/5) ... 23.24/10.20 [2019-03-28 12:34:50,735 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 23.24/10.20 [2019-03-28 12:34:50,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation 23.24/10.20 [2019-03-28 12:34:50,756 INFO L374 BuchiCegarLoop]: Interprodecural is true 23.24/10.20 [2019-03-28 12:34:50,756 INFO L375 BuchiCegarLoop]: Hoare is true 23.24/10.20 [2019-03-28 12:34:50,756 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 23.24/10.20 [2019-03-28 12:34:50,756 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 23.24/10.20 [2019-03-28 12:34:50,756 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 23.24/10.20 [2019-03-28 12:34:50,756 INFO L379 BuchiCegarLoop]: Difference is false 23.24/10.20 [2019-03-28 12:34:50,756 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 23.24/10.20 [2019-03-28 12:34:50,757 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 23.24/10.20 [2019-03-28 12:34:50,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 23.24/10.20 [2019-03-28 12:34:50,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 23.24/10.20 [2019-03-28 12:34:50,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 23.24/10.20 [2019-03-28 12:34:50,764 INFO L119 BuchiIsEmpty]: Starting construction of run 23.24/10.20 [2019-03-28 12:34:50,769 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:50,769 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:50,769 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 23.24/10.20 [2019-03-28 12:34:50,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 23.24/10.20 [2019-03-28 12:34:50,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 23.24/10.20 [2019-03-28 12:34:50,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 23.24/10.20 [2019-03-28 12:34:50,770 INFO L119 BuchiIsEmpty]: Starting construction of run 23.24/10.20 [2019-03-28 12:34:50,770 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:50,771 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:50,776 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [93] ULTIMATE.startENTRY-->L23: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length~0] 8#L23true [73] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 4#L23-2true [61] L23-2-->L26-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 12#L26-1true [82] L26-1-->L8: Formula: (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_cmemchr_~s.base_1 |v_ULTIMATE.start_cmemchr_#in~s.base_1|) (= |v_ULTIMATE.start_cmemchr_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemchr_~n_4 |v_ULTIMATE.start_cmemchr_#in~n_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= |v_ULTIMATE.start_cmemchr_#in~s.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~n~0_7)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4|) 0) (= |v_ULTIMATE.start_cmemchr_#in~s.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= |v_ULTIMATE.start_cmemchr_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_cmemchr_~s.offset_1 |v_ULTIMATE.start_cmemchr_#in~s.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= v_ULTIMATE.start_cmemchr_~c_1 |v_ULTIMATE.start_cmemchr_#in~c_1|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_1, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_4, ULTIMATE.start_cmemchr_#in~s.offset=|v_ULTIMATE.start_cmemchr_#in~s.offset_1|, ULTIMATE.start_cmemchr_#res.base=|v_ULTIMATE.start_cmemchr_#res.base_3|, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, ULTIMATE.start_cmemchr_#in~n=|v_ULTIMATE.start_cmemchr_#in~n_1|, #length=|v_#length_1|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_1|, ULTIMATE.start_cmemchr_#res.offset=|v_ULTIMATE.start_cmemchr_#res.offset_3|, ULTIMATE.start_cmemchr_#in~c=|v_ULTIMATE.start_cmemchr_#in~c_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_cmemchr_#in~s.base=|v_ULTIMATE.start_cmemchr_#in~s.base_1|, ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_1|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_1|, ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_1, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~s.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemchr_#in~c, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_cmemchr_#in~s.base, ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_~n, ULTIMATE.start_cmemchr_#in~s.offset, ULTIMATE.start_cmemchr_#t~post1.base, ULTIMATE.start_cmemchr_~c, ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_#res.base, ULTIMATE.start_cmemchr_~s.offset, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_cmemchr_#in~n, #length, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#res.offset] 10#L8true [84] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_2 v_ULTIMATE.start_cmemchr_~s.base_3) (> v_ULTIMATE.start_cmemchr_~n_6 0) (= v_ULTIMATE.start_cmemchr_~p~0.offset_2 v_ULTIMATE.start_cmemchr_~s.offset_3)) InVars {ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_2, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset] 9#L11-4true 23.24/10.20 [2019-03-28 12:34:50,776 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-4true [51] L11-4-->L12: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_3 |v_ULTIMATE.start_cmemchr_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| v_ULTIMATE.start_cmemchr_~p~0.offset_4) (= v_ULTIMATE.start_cmemchr_~p~0.offset_3 (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemchr_#t~post1.base_2| v_ULTIMATE.start_cmemchr_~p~0.base_4)) InVars {ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_4, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_4} OutVars{ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_3, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_3, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_2|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~post1.base] 7#L12true [66] L12-->L12-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) |v_ULTIMATE.start_cmemchr_#t~mem2_2|) (<= 0 |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_3| 1) (select |v_#length_3| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) 1)) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, #length=|v_#length_3|, #valid=|v_#valid_7|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_2|, #length=|v_#length_3|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~mem2] 6#L12-1true [89] L12-1-->L11-1: Formula: (< (mod |v_ULTIMATE.start_cmemchr_#t~mem2_6| 256) (mod v_ULTIMATE.start_cmemchr_~c_4 256)) InVars {ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_6|} OutVars{ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_6|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_5|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#t~post1.base] 3#L11-1true [60] L11-1-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemchr_~n_2 (- 1)))) (and (= |v_ULTIMATE.start_cmemchr_#t~pre0_1| .cse0) (= v_ULTIMATE.start_cmemchr_~n_1 .cse0))) InVars {ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_2} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_1|, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_1} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_cmemchr_~n] 14#L11-2true [91] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemchr_#t~pre0_5|) InVars {ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_5|} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_4|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0] 9#L11-4true 23.24/10.20 [2019-03-28 12:34:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash 116752594, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:50,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:50,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash 77782408, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:50,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:50,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -540919977, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:50,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:50,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:50,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:50,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 23.24/10.20 [2019-03-28 12:34:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 23.24/10.20 [2019-03-28 12:34:50,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 23.24/10.20 [2019-03-28 12:34:50,899 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 5 states. 23.24/10.20 [2019-03-28 12:34:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:51,009 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. 23.24/10.20 [2019-03-28 12:34:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 23.24/10.20 [2019-03-28 12:34:51,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 44 transitions. 23.24/10.20 [2019-03-28 12:34:51,014 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 23.24/10.20 [2019-03-28 12:34:51,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 32 transitions. 23.24/10.20 [2019-03-28 12:34:51,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 23.24/10.20 [2019-03-28 12:34:51,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 23.24/10.20 [2019-03-28 12:34:51,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. 23.24/10.20 [2019-03-28 12:34:51,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 23.24/10.20 [2019-03-28 12:34:51,017 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. 23.24/10.20 [2019-03-28 12:34:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. 23.24/10.20 [2019-03-28 12:34:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. 23.24/10.20 [2019-03-28 12:34:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 23.24/10.20 [2019-03-28 12:34:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. 23.24/10.20 [2019-03-28 12:34:51,021 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 23.24/10.20 [2019-03-28 12:34:51,021 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 23.24/10.20 [2019-03-28 12:34:51,021 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 23.24/10.20 [2019-03-28 12:34:51,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. 23.24/10.20 [2019-03-28 12:34:51,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 23.24/10.20 [2019-03-28 12:34:51,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 23.24/10.20 [2019-03-28 12:34:51,022 INFO L119 BuchiIsEmpty]: Starting construction of run 23.24/10.20 [2019-03-28 12:34:51,022 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:51,022 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:51,023 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY [93] ULTIMATE.startENTRY-->L23: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length~0] 65#L23 [73] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 61#L23-2 [74] L23-2-->L26-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 62#L26-1 [82] L26-1-->L8: Formula: (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_cmemchr_~s.base_1 |v_ULTIMATE.start_cmemchr_#in~s.base_1|) (= |v_ULTIMATE.start_cmemchr_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemchr_~n_4 |v_ULTIMATE.start_cmemchr_#in~n_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= |v_ULTIMATE.start_cmemchr_#in~s.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~n~0_7)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4|) 0) (= |v_ULTIMATE.start_cmemchr_#in~s.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= |v_ULTIMATE.start_cmemchr_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_cmemchr_~s.offset_1 |v_ULTIMATE.start_cmemchr_#in~s.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= v_ULTIMATE.start_cmemchr_~c_1 |v_ULTIMATE.start_cmemchr_#in~c_1|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_1, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_4, ULTIMATE.start_cmemchr_#in~s.offset=|v_ULTIMATE.start_cmemchr_#in~s.offset_1|, ULTIMATE.start_cmemchr_#res.base=|v_ULTIMATE.start_cmemchr_#res.base_3|, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, ULTIMATE.start_cmemchr_#in~n=|v_ULTIMATE.start_cmemchr_#in~n_1|, #length=|v_#length_1|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_1|, ULTIMATE.start_cmemchr_#res.offset=|v_ULTIMATE.start_cmemchr_#res.offset_3|, ULTIMATE.start_cmemchr_#in~c=|v_ULTIMATE.start_cmemchr_#in~c_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_cmemchr_#in~s.base=|v_ULTIMATE.start_cmemchr_#in~s.base_1|, ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_1|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_1|, ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_1, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~s.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemchr_#in~c, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_cmemchr_#in~s.base, ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_~n, ULTIMATE.start_cmemchr_#in~s.offset, ULTIMATE.start_cmemchr_#t~post1.base, ULTIMATE.start_cmemchr_~c, ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_#res.base, ULTIMATE.start_cmemchr_~s.offset, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_cmemchr_#in~n, #length, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#res.offset] 70#L8 [83] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_2 v_ULTIMATE.start_cmemchr_~s.base_3) (< v_ULTIMATE.start_cmemchr_~n_6 0) (= v_ULTIMATE.start_cmemchr_~p~0.offset_2 v_ULTIMATE.start_cmemchr_~s.offset_3)) InVars {ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_2, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset] 68#L11-4 23.24/10.20 [2019-03-28 12:34:51,023 INFO L796 eck$LassoCheckResult]: Loop: 68#L11-4 [51] L11-4-->L12: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_3 |v_ULTIMATE.start_cmemchr_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| v_ULTIMATE.start_cmemchr_~p~0.offset_4) (= v_ULTIMATE.start_cmemchr_~p~0.offset_3 (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemchr_#t~post1.base_2| v_ULTIMATE.start_cmemchr_~p~0.base_4)) InVars {ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_4, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_4} OutVars{ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_3, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_3, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_2|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~post1.base] 67#L12 [66] L12-->L12-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) |v_ULTIMATE.start_cmemchr_#t~mem2_2|) (<= 0 |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_3| 1) (select |v_#length_3| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) 1)) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, #length=|v_#length_3|, #valid=|v_#valid_7|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_2|, #length=|v_#length_3|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~mem2] 66#L12-1 [89] L12-1-->L11-1: Formula: (< (mod |v_ULTIMATE.start_cmemchr_#t~mem2_6| 256) (mod v_ULTIMATE.start_cmemchr_~c_4 256)) InVars {ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_6|} OutVars{ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_6|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_5|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#t~post1.base] 59#L11-1 [60] L11-1-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemchr_~n_2 (- 1)))) (and (= |v_ULTIMATE.start_cmemchr_#t~pre0_1| .cse0) (= v_ULTIMATE.start_cmemchr_~n_1 .cse0))) InVars {ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_2} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_1|, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_1} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_cmemchr_~n] 60#L11-2 [92] L11-2-->L11-4: Formula: (> 0 |v_ULTIMATE.start_cmemchr_#t~pre0_5|) InVars {ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_5|} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_4|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0] 68#L11-4 23.24/10.20 [2019-03-28 12:34:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:51,024 INFO L82 PathProgramCache]: Analyzing trace with hash 116765086, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:51,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:51,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:51,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.24/10.20 [2019-03-28 12:34:51,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 23.24/10.20 [2019-03-28 12:34:51,052 INFO L799 eck$LassoCheckResult]: stem already infeasible 23.24/10.20 [2019-03-28 12:34:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash 77782409, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:51,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:51,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 23.24/10.20 [2019-03-28 12:34:51,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 23.24/10.20 [2019-03-28 12:34:51,105 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. 23.24/10.20 [2019-03-28 12:34:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.24/10.20 [2019-03-28 12:34:51,141 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. 23.24/10.20 [2019-03-28 12:34:51,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 23.24/10.20 [2019-03-28 12:34:51,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. 23.24/10.20 [2019-03-28 12:34:51,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 23.24/10.20 [2019-03-28 12:34:51,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. 23.24/10.20 [2019-03-28 12:34:51,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 23.24/10.20 [2019-03-28 12:34:51,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 23.24/10.20 [2019-03-28 12:34:51,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. 23.24/10.20 [2019-03-28 12:34:51,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 23.24/10.20 [2019-03-28 12:34:51,144 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. 23.24/10.20 [2019-03-28 12:34:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. 23.24/10.20 [2019-03-28 12:34:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. 23.24/10.20 [2019-03-28 12:34:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 23.24/10.20 [2019-03-28 12:34:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:51,146 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:51,146 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:51,146 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 23.24/10.20 [2019-03-28 12:34:51,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:51,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 23.24/10.20 [2019-03-28 12:34:51,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 23.24/10.20 [2019-03-28 12:34:51,147 INFO L119 BuchiIsEmpty]: Starting construction of run 23.24/10.20 [2019-03-28 12:34:51,148 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:51,148 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 23.24/10.20 [2019-03-28 12:34:51,148 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY [93] ULTIMATE.startENTRY-->L23: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length~0] 116#L23 [73] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 112#L23-2 [74] L23-2-->L26-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 113#L26-1 [82] L26-1-->L8: Formula: (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_cmemchr_~s.base_1 |v_ULTIMATE.start_cmemchr_#in~s.base_1|) (= |v_ULTIMATE.start_cmemchr_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemchr_~n_4 |v_ULTIMATE.start_cmemchr_#in~n_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= |v_ULTIMATE.start_cmemchr_#in~s.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~n~0_7)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4|) 0) (= |v_ULTIMATE.start_cmemchr_#in~s.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= |v_ULTIMATE.start_cmemchr_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_cmemchr_~s.offset_1 |v_ULTIMATE.start_cmemchr_#in~s.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= v_ULTIMATE.start_cmemchr_~c_1 |v_ULTIMATE.start_cmemchr_#in~c_1|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_1, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_4, ULTIMATE.start_cmemchr_#in~s.offset=|v_ULTIMATE.start_cmemchr_#in~s.offset_1|, ULTIMATE.start_cmemchr_#res.base=|v_ULTIMATE.start_cmemchr_#res.base_3|, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, ULTIMATE.start_cmemchr_#in~n=|v_ULTIMATE.start_cmemchr_#in~n_1|, #length=|v_#length_1|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_1|, ULTIMATE.start_cmemchr_#res.offset=|v_ULTIMATE.start_cmemchr_#res.offset_3|, ULTIMATE.start_cmemchr_#in~c=|v_ULTIMATE.start_cmemchr_#in~c_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_cmemchr_#in~s.base=|v_ULTIMATE.start_cmemchr_#in~s.base_1|, ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_1|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_1|, ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_1, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~s.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemchr_#in~c, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_cmemchr_#in~s.base, ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_~n, ULTIMATE.start_cmemchr_#in~s.offset, ULTIMATE.start_cmemchr_#t~post1.base, ULTIMATE.start_cmemchr_~c, ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_#res.base, ULTIMATE.start_cmemchr_~s.offset, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_cmemchr_#in~n, #length, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#res.offset] 120#L8 [84] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_2 v_ULTIMATE.start_cmemchr_~s.base_3) (> v_ULTIMATE.start_cmemchr_~n_6 0) (= v_ULTIMATE.start_cmemchr_~p~0.offset_2 v_ULTIMATE.start_cmemchr_~s.offset_3)) InVars {ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_2, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset] 119#L11-4 23.24/10.20 [2019-03-28 12:34:51,149 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-4 [51] L11-4-->L12: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_3 |v_ULTIMATE.start_cmemchr_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| v_ULTIMATE.start_cmemchr_~p~0.offset_4) (= v_ULTIMATE.start_cmemchr_~p~0.offset_3 (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemchr_#t~post1.base_2| v_ULTIMATE.start_cmemchr_~p~0.base_4)) InVars {ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_4, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_4} OutVars{ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_3, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_3, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_2|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~post1.base] 118#L12 [66] L12-->L12-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) |v_ULTIMATE.start_cmemchr_#t~mem2_2|) (<= 0 |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_3| 1) (select |v_#length_3| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) 1)) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, #length=|v_#length_3|, #valid=|v_#valid_7|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_2|, #length=|v_#length_3|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~mem2] 117#L12-1 [89] L12-1-->L11-1: Formula: (< (mod |v_ULTIMATE.start_cmemchr_#t~mem2_6| 256) (mod v_ULTIMATE.start_cmemchr_~c_4 256)) InVars {ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_6|} OutVars{ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_6|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_5|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#t~post1.base] 110#L11-1 [60] L11-1-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemchr_~n_2 (- 1)))) (and (= |v_ULTIMATE.start_cmemchr_#t~pre0_1| .cse0) (= v_ULTIMATE.start_cmemchr_~n_1 .cse0))) InVars {ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_2} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_1|, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_1} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_cmemchr_~n] 111#L11-2 [91] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemchr_#t~pre0_5|) InVars {ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_5|} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_4|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0] 119#L11-4 23.24/10.20 [2019-03-28 12:34:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 116765087, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:51,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:51,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:51,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 77782408, now seen corresponding path program 2 times 23.24/10.20 [2019-03-28 12:34:51,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:51,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:51,170 INFO L82 PathProgramCache]: Analyzing trace with hash 640777898, now seen corresponding path program 1 times 23.24/10.20 [2019-03-28 12:34:51,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.24/10.20 [2019-03-28 12:34:51,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.24/10.20 [2019-03-28 12:34:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.24/10.20 [2019-03-28 12:34:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.24/10.20 [2019-03-28 12:34:51,362 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 23.24/10.20 [2019-03-28 12:34:51,425 INFO L216 LassoAnalysis]: Preferences: 23.24/10.20 [2019-03-28 12:34:51,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 23.24/10.20 [2019-03-28 12:34:51,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 23.24/10.20 [2019-03-28 12:34:51,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 23.24/10.20 [2019-03-28 12:34:51,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false 23.24/10.20 [2019-03-28 12:34:51,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 23.24/10.20 [2019-03-28 12:34:51,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 23.24/10.20 [2019-03-28 12:34:51,427 INFO L130 ssoRankerPreferences]: Path of dumped script: 23.24/10.20 [2019-03-28 12:34:51,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 23.24/10.20 [2019-03-28 12:34:51,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 23.24/10.20 [2019-03-28 12:34:51,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 23.24/10.20 [2019-03-28 12:34:51,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.24/10.20 [2019-03-28 12:34:51,922 INFO L300 LassoAnalysis]: Preprocessing complete. 23.24/10.20 [2019-03-28 12:34:51,928 INFO L497 LassoAnalysis]: Using template 'affine'. 23.24/10.20 [2019-03-28 12:34:51,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.24/10.20 Termination analysis: LINEAR_WITH_GUESSES 23.24/10.20 Number of strict supporting invariants: 0 23.24/10.20 Number of non-strict supporting invariants: 1 23.24/10.20 Consider only non-deceasing supporting invariants: true 23.24/10.20 Simplify termination arguments: true 23.24/10.20 Simplify supporting invariants: trueOverapproximate stem: false 23.24/10.20 [2019-03-28 12:34:51,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.24/10.20 [2019-03-28 12:34:51,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.24/10.20 [2019-03-28 12:34:51,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.24/10.20 [2019-03-28 12:34:51,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.24/10.20 [2019-03-28 12:34:51,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.24/10.20 [2019-03-28 12:34:51,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.24/10.20 [2019-03-28 12:34:51,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.24/10.20 [2019-03-28 12:34:51,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.24/10.20 [2019-03-28 12:34:51,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.24/10.20 Termination analysis: LINEAR_WITH_GUESSES 23.24/10.20 Number of strict supporting invariants: 0 23.24/10.20 Number of non-strict supporting invariants: 1 23.24/10.20 Consider only non-deceasing supporting invariants: true 23.24/10.20 Simplify termination arguments: true 23.24/10.20 Simplify supporting invariants: trueOverapproximate stem: false 23.24/10.20 [2019-03-28 12:34:51,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.24/10.20 [2019-03-28 12:34:51,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.24/10.20 [2019-03-28 12:34:51,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.24/10.20 [2019-03-28 12:34:51,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.24/10.20 [2019-03-28 12:34:51,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.24/10.20 [2019-03-28 12:34:51,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.24/10.20 [2019-03-28 12:34:51,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.24/10.20 [2019-03-28 12:34:51,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.24/10.20 [2019-03-28 12:34:51,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.24/10.20 Termination analysis: LINEAR_WITH_GUESSES 23.24/10.20 Number of strict supporting invariants: 0 23.24/10.20 Number of non-strict supporting invariants: 1 23.24/10.20 Consider only non-deceasing supporting invariants: true 23.24/10.20 Simplify termination arguments: true 23.24/10.20 Simplify supporting invariants: trueOverapproximate stem: false 23.24/10.20 [2019-03-28 12:34:51,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.24/10.20 [2019-03-28 12:34:51,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.24/10.20 [2019-03-28 12:34:51,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.24/10.20 [2019-03-28 12:34:51,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.24/10.20 [2019-03-28 12:34:51,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.24/10.20 [2019-03-28 12:34:51,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.24/10.20 [2019-03-28 12:34:51,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.24/10.20 [2019-03-28 12:34:51,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.24/10.20 Termination analysis: LINEAR_WITH_GUESSES 23.24/10.20 Number of strict supporting invariants: 0 23.24/10.20 Number of non-strict supporting invariants: 1 23.24/10.20 Consider only non-deceasing supporting invariants: true 23.24/10.20 Simplify termination arguments: true 23.24/10.20 Simplify supporting invariants: trueOverapproximate stem: false 23.24/10.20 [2019-03-28 12:34:51,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.24/10.20 [2019-03-28 12:34:51,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.24/10.20 [2019-03-28 12:34:51,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.24/10.20 [2019-03-28 12:34:51,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.24/10.20 [2019-03-28 12:34:51,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.24/10.20 [2019-03-28 12:34:51,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.24/10.20 [2019-03-28 12:34:51,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.24/10.20 [2019-03-28 12:34:51,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.24/10.20 Termination analysis: LINEAR_WITH_GUESSES 23.24/10.20 Number of strict supporting invariants: 0 23.24/10.20 Number of non-strict supporting invariants: 1 23.24/10.20 Consider only non-deceasing supporting invariants: true 23.24/10.20 Simplify termination arguments: true 23.24/10.20 Simplify supporting invariants: trueOverapproximate stem: false 23.24/10.20 [2019-03-28 12:34:51,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.24/10.20 [2019-03-28 12:34:51,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.24/10.20 [2019-03-28 12:34:51,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.24/10.20 [2019-03-28 12:34:51,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.24/10.20 [2019-03-28 12:34:51,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.24/10.20 [2019-03-28 12:34:51,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.24/10.20 [2019-03-28 12:34:51,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.24/10.20 [2019-03-28 12:34:51,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.24/10.20 Termination analysis: LINEAR_WITH_GUESSES 23.24/10.20 Number of strict supporting invariants: 0 23.24/10.20 Number of non-strict supporting invariants: 1 23.24/10.20 Consider only non-deceasing supporting invariants: true 23.24/10.20 Simplify termination arguments: true 23.24/10.20 Simplify supporting invariants: trueOverapproximate stem: false 23.24/10.20 [2019-03-28 12:34:51,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.24/10.20 [2019-03-28 12:34:51,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.24/10.20 [2019-03-28 12:34:51,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.24/10.20 [2019-03-28 12:34:51,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.24/10.20 [2019-03-28 12:34:51,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.24/10.20 [2019-03-28 12:34:51,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.24/10.20 [2019-03-28 12:34:52,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 23.24/10.20 [2019-03-28 12:34:52,048 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 23.24/10.20 [2019-03-28 12:34:52,048 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. 23.24/10.20 [2019-03-28 12:34:52,051 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 23.24/10.20 [2019-03-28 12:34:52,052 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 23.24/10.20 [2019-03-28 12:34:52,053 INFO L518 LassoAnalysis]: Proved termination. 23.24/10.20 [2019-03-28 12:34:52,053 INFO L520 LassoAnalysis]: Termination argument consisting of: 23.24/10.20 Ranking function f(ULTIMATE.start_cmemchr_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cmemchr_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 23.24/10.20 Supporting invariants [] 23.24/10.20 [2019-03-28 12:34:52,063 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed 23.24/10.20 [2019-03-28 12:34:52,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.24/10.20 [2019-03-28 12:34:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:52,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core 23.24/10.20 [2019-03-28 12:34:52,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.24/10.20 [2019-03-28 12:34:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:52,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core 23.24/10.20 [2019-03-28 12:34:52,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.24/10.20 [2019-03-28 12:34:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.24/10.20 [2019-03-28 12:34:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.24/10.20 [2019-03-28 12:34:52,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core 23.24/10.20 [2019-03-28 12:34:52,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.24/10.20 [2019-03-28 12:34:52,298 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 23.24/10.20 [2019-03-28 12:34:52,302 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates 23.24/10.20 [2019-03-28 12:34:52,303 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. 23.24/10.20 [2019-03-28 12:34:52,526 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 29 states and 39 transitions. Complement of second has 8 states. 23.24/10.20 [2019-03-28 12:34:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states 23.24/10.20 [2019-03-28 12:34:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 23.24/10.20 [2019-03-28 12:34:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. 23.24/10.20 [2019-03-28 12:34:52,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 5 letters. 23.24/10.20 [2019-03-28 12:34:52,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.24/10.20 [2019-03-28 12:34:52,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 10 letters. Loop has 5 letters. 23.24/10.20 [2019-03-28 12:34:52,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.24/10.20 [2019-03-28 12:34:52,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 10 letters. 23.24/10.20 [2019-03-28 12:34:52,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.24/10.20 [2019-03-28 12:34:52,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. 23.24/10.20 [2019-03-28 12:34:52,538 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 23.24/10.20 [2019-03-28 12:34:52,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:52,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 23.24/10.20 [2019-03-28 12:34:52,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 23.24/10.20 [2019-03-28 12:34:52,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:52,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 23.24/10.20 [2019-03-28 12:34:52,539 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:52,539 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:52,539 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:52,539 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 23.24/10.20 [2019-03-28 12:34:52,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 23.24/10.20 [2019-03-28 12:34:52,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 23.24/10.20 [2019-03-28 12:34:52,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 23.24/10.20 [2019-03-28 12:34:52,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:52 BasicIcfg 23.24/10.20 [2019-03-28 12:34:52,545 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 23.24/10.20 [2019-03-28 12:34:52,546 INFO L168 Benchmark]: Toolchain (without parser) took 5674.71 ms. Allocated memory was 514.9 MB in the beginning and 634.4 MB in the end (delta: 119.5 MB). Free memory was 440.4 MB in the beginning and 547.6 MB in the end (delta: -107.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,547 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 460.8 MB. There was no memory consumed. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.39 ms. Allocated memory was 514.9 MB in the beginning and 550.0 MB in the end (delta: 35.1 MB). Free memory was 440.4 MB in the beginning and 519.9 MB in the end (delta: -79.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 550.0 MB. Free memory was 519.9 MB in the beginning and 517.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,548 INFO L168 Benchmark]: Boogie Preprocessor took 24.36 ms. Allocated memory is still 550.0 MB. Free memory was 517.3 MB in the beginning and 515.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,549 INFO L168 Benchmark]: RCFGBuilder took 290.22 ms. Allocated memory is still 550.0 MB. Free memory was 515.7 MB in the beginning and 499.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,549 INFO L168 Benchmark]: BlockEncodingV2 took 118.55 ms. Allocated memory is still 550.0 MB. Free memory was 499.7 MB in the beginning and 493.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,550 INFO L168 Benchmark]: TraceAbstraction took 3080.60 ms. Allocated memory was 550.0 MB in the beginning and 589.3 MB in the end (delta: 39.3 MB). Free memory was 493.2 MB in the beginning and 441.7 MB in the end (delta: 51.4 MB). Peak memory consumption was 90.8 MB. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,551 INFO L168 Benchmark]: BuchiAutomizer took 1818.44 ms. Allocated memory was 589.3 MB in the beginning and 634.4 MB in the end (delta: 45.1 MB). Free memory was 441.7 MB in the beginning and 547.6 MB in the end (delta: -105.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 23.24/10.20 [2019-03-28 12:34:52,557 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 23.24/10.20 --- Results --- 23.24/10.20 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 23.24/10.20 - StatisticsResult: Initial Icfg 23.24/10.20 18 locations, 23 edges 23.24/10.20 - StatisticsResult: Encoded RCFG 23.24/10.20 12 locations, 20 edges 23.24/10.20 * Results from de.uni_freiburg.informatik.ultimate.core: 23.24/10.20 - StatisticsResult: Toolchain Benchmarks 23.24/10.20 Benchmark results are: 23.24/10.20 * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 460.8 MB. There was no memory consumed. Max. memory is 50.3 GB. 23.24/10.20 * CACSL2BoogieTranslator took 296.39 ms. Allocated memory was 514.9 MB in the beginning and 550.0 MB in the end (delta: 35.1 MB). Free memory was 440.4 MB in the beginning and 519.9 MB in the end (delta: -79.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 23.24/10.20 * Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 550.0 MB. Free memory was 519.9 MB in the beginning and 517.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 50.3 GB. 23.24/10.20 * Boogie Preprocessor took 24.36 ms. Allocated memory is still 550.0 MB. Free memory was 517.3 MB in the beginning and 515.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. 23.24/10.20 * RCFGBuilder took 290.22 ms. Allocated memory is still 550.0 MB. Free memory was 515.7 MB in the beginning and 499.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. 23.24/10.20 * BlockEncodingV2 took 118.55 ms. Allocated memory is still 550.0 MB. Free memory was 499.7 MB in the beginning and 493.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 23.24/10.20 * TraceAbstraction took 3080.60 ms. Allocated memory was 550.0 MB in the beginning and 589.3 MB in the end (delta: 39.3 MB). Free memory was 493.2 MB in the beginning and 441.7 MB in the end (delta: 51.4 MB). Peak memory consumption was 90.8 MB. Max. memory is 50.3 GB. 23.24/10.20 * BuchiAutomizer took 1818.44 ms. Allocated memory was 589.3 MB in the beginning and 634.4 MB in the end (delta: 45.1 MB). Free memory was 441.7 MB in the beginning and 547.6 MB in the end (delta: -105.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 23.24/10.20 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 - GenericResult: Unfinished Backtranslation 23.24/10.20 unknown boogie variable #length 23.24/10.20 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 23.24/10.20 - PositiveResult [Line: 12]: pointer dereference always succeeds 23.24/10.20 For all program executions holds that pointer dereference always succeeds at this location 23.24/10.20 - PositiveResult [Line: 12]: pointer dereference always succeeds 23.24/10.20 For all program executions holds that pointer dereference always succeeds at this location 23.24/10.20 - AllSpecificationsHoldResult: All specifications hold 23.24/10.20 2 specifications checked. All of them hold 23.24/10.20 - InvariantResult [Line: 11]: Loop Invariant 23.24/10.20 [2019-03-28 12:34:52,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 [2019-03-28 12:34:52,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.24/10.20 Derived loop invariant: (((((((p == 0 && n <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 1 == \valid[p]) && n <= unknown-#length-unknown[p]) && 1 <= n) && 0 == s) && 1 <= n) || (((((((n <= unknown-#length-unknown[s] && 1 == \valid[s]) && 1 == \valid[p]) && p + n <= unknown-#length-unknown[p]) && 1 <= p) && 1 <= n) && 0 == s) && 1 <= n) 23.24/10.20 - StatisticsResult: Ultimate Automizer benchmark data 23.24/10.20 CFG has 1 procedures, 12 locations, 2 error locations. SAFE Result, 2.9s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 161 SDslu, 344 SDs, 0 SdLazy, 645 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 21 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 70 HoareAnnotationTreeSize, 1 FomulaSimplifications, 160 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 139 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 7810 SizeOfPredicates, 27 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 21/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 23.24/10.20 - StatisticsResult: Constructed decomposition of program 23.24/10.20 Your program was decomposed into 3 terminating modules (2 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(n * sizeof(char))] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. 23.24/10.20 - StatisticsResult: Timing statistics 23.24/10.20 BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 73 SDslu, 95 SDs, 0 SdLazy, 153 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax100 hnf100 lsp92 ukn99 mio100 lsp51 div157 bol100 ite100 ukn100 eq143 hnf76 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 23.24/10.20 - TerminationAnalysisResult: Termination proven 23.24/10.20 Buchi Automizer proved that your program is terminating 23.24/10.20 RESULT: Ultimate proved your program to be correct! 23.24/10.20 !SESSION 2019-03-28 12:34:43.585 ----------------------------------------------- 23.24/10.20 eclipse.buildId=unknown 23.24/10.20 java.version=1.8.0_181 23.24/10.20 java.vendor=Oracle Corporation 23.24/10.20 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 23.24/10.20 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 23.24/10.20 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 23.24/10.20 23.24/10.20 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:34:52.798 23.24/10.20 !MESSAGE The workspace will exit with unsaved changes in this session. 23.24/10.20 Received shutdown request... 23.24/10.20 Ultimate: 23.24/10.20 GTK+ Version Check 23.24/10.20 EOF