java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/reducercommutativity/max.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:23:53,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:23:53,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:23:53,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:23:53,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:23:54,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:23:54,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:23:54,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:23:54,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:23:54,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:23:54,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:23:54,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:23:54,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:23:54,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:23:54,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:23:54,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:23:54,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:23:54,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:23:54,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:23:54,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:23:54,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:23:54,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:23:54,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:23:54,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:23:54,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:23:54,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:23:54,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:23:54,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:23:54,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:23:54,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:23:54,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:23:54,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:23:54,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:23:54,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:23:54,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:23:54,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:23:54,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:23:54,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:23:54,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:23:54,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:23:54,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:23:54,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 15:23:54,092 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:23:54,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:23:54,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:23:54,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:23:54,097 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:23:54,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:23:54,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:23:54,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:23:54,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:23:54,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:23:54,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:23:54,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:23:54,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:23:54,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:23:54,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:23:54,099 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:23:54,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:23:54,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:23:54,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:23:54,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:23:54,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:23:54,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:23:54,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:23:54,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:23:54,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:23:54,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:23:54,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:23:54,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:23:54,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:23:54,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:23:54,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:23:54,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:23:54,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:23:54,417 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:23:54,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max.i [2019-10-07 15:23:54,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4e91d4f/a2e1d4a214c54e4dadf345f559f176d1/FLAGadc1a4a34 [2019-10-07 15:23:54,936 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:23:54,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max.i [2019-10-07 15:23:54,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4e91d4f/a2e1d4a214c54e4dadf345f559f176d1/FLAGadc1a4a34 [2019-10-07 15:23:55,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4e91d4f/a2e1d4a214c54e4dadf345f559f176d1 [2019-10-07 15:23:55,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:23:55,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:23:55,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:23:55,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:23:55,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:23:55,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6063a733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55, skipping insertion in model container [2019-10-07 15:23:55,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,310 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:23:55,333 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:23:55,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:23:55,533 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:23:55,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:23:55,567 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:23:55,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55 WrapperNode [2019-10-07 15:23:55,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:23:55,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:23:55,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:23:55,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:23:55,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... [2019-10-07 15:23:55,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:23:55,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:23:55,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:23:55,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:23:55,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:23:55,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:23:55,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:23:55,754 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-10-07 15:23:55,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:23:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:23:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:23:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-10-07 15:23:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 15:23:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:23:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 15:23:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 15:23:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 15:23:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:23:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:23:56,151 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:23:56,152 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 15:23:56,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:23:56 BoogieIcfgContainer [2019-10-07 15:23:56,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:23:56,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:23:56,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:23:56,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:23:56,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:23:55" (1/3) ... [2019-10-07 15:23:56,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e1309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:23:56, skipping insertion in model container [2019-10-07 15:23:56,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:55" (2/3) ... [2019-10-07 15:23:56,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e1309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:23:56, skipping insertion in model container [2019-10-07 15:23:56,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:23:56" (3/3) ... [2019-10-07 15:23:56,161 INFO L109 eAbstractionObserver]: Analyzing ICFG max.i [2019-10-07 15:23:56,172 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:23:56,180 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:23:56,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:23:56,217 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:23:56,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:23:56,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:23:56,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:23:56,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:23:56,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:23:56,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:23:56,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:23:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-07 15:23:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 15:23:56,240 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:23:56,241 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:23:56,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:23:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:23:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1922277371, now seen corresponding path program 1 times [2019-10-07 15:23:56,256 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:23:56,256 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:56,256 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:56,256 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:23:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:23:56,515 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:56,516 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:23:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:23:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:56,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:23:56,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:23:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:23:56,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:23:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:23:56,792 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:23:56,792 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2019-10-07 15:23:56,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:23:56,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:23:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:23:56,818 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-10-07 15:23:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:23:56,915 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-10-07 15:23:56,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:23:56,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-07 15:23:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:23:56,927 INFO L225 Difference]: With dead ends: 46 [2019-10-07 15:23:56,928 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 15:23:56,932 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:23:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 15:23:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 15:23:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 15:23:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-07 15:23:56,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 24 [2019-10-07 15:23:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:23:56,970 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-07 15:23:56,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:23:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-07 15:23:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 15:23:56,973 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:23:56,973 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:23:57,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:23:57,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:23:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:23:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1360249756, now seen corresponding path program 1 times [2019-10-07 15:23:57,178 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:23:57,178 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:57,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:57,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:23:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 15:23:57,329 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:57,330 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:23:57,330 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:23:57,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:23:57,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:23:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:23:57,332 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2019-10-07 15:23:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:23:57,382 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 15:23:57,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:23:57,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-07 15:23:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:23:57,384 INFO L225 Difference]: With dead ends: 30 [2019-10-07 15:23:57,384 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 15:23:57,385 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:23:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 15:23:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 15:23:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 15:23:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-07 15:23:57,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 27 [2019-10-07 15:23:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:23:57,395 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-07 15:23:57,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:23:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-10-07 15:23:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 15:23:57,396 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:23:57,396 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:23:57,397 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:23:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:23:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1127678421, now seen corresponding path program 1 times [2019-10-07 15:23:57,397 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:23:57,398 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:57,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:57,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:23:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 15:23:57,496 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:57,496 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:23:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:23:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:57,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 15:23:57,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:23:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 15:23:57,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:23:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 15:23:57,731 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:23:57,775 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:23:57,775 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:23:57,784 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:23:57,799 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:23:57,800 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:23:58,027 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 15:23:59,985 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-07 15:24:00,031 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-07 15:24:00,037 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:24:00,038 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:24:00,038 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 610#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 15:24:00,038 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 606#(and (not (< max_~i~0 ~N~0)) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-07 15:24:00,038 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 437#true [2019-10-07 15:24:00,039 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 480#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (< (+ main_~i~1 1) ~N~0))) [2019-10-07 15:24:00,039 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 78#(or (exists ((v_prenex_2 Int) (v_max_~ret~0_BEFORE_RETURN_2 Int)) (or (and (= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) |main_#t~ret5|) (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) |main_#t~ret5|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)))) (exists ((v_max_~ret~0_BEFORE_RETURN_1 Int) (v_prenex_1 Int)) (or (and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= (+ (mod v_prenex_1 4294967296) (- 4294967296)) |main_#t~ret5|) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (not (<= (mod v_prenex_1 4294967296) 2147483647))) (and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= |main_#t~ret5| (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296)) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0))))) [2019-10-07 15:24:00,039 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:00,039 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 ~N~0) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-07 15:24:00,040 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 43#(and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |main_~#x~0.offset|) (<= |main_~#x~0.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (<= 1 ~N~0) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) [2019-10-07 15:24:00,040 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 338#true [2019-10-07 15:24:00,040 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 615#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:00,040 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:24:00,040 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 271#true [2019-10-07 15:24:00,041 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 559#true [2019-10-07 15:24:00,042 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 545#true [2019-10-07 15:24:00,042 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 518#true [2019-10-07 15:24:00,042 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 601#(<= 0 max_~i~0) [2019-10-07 15:24:00,043 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 550#(or (exists ((v_max_~ret~0_BEFORE_RETURN_1 Int) (v_prenex_2 Int) (v_max_~ret~0_BEFORE_RETURN_2 Int) (v_prenex_1 Int)) (or (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296)) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= main_~ret~1 (+ (mod v_prenex_1 4294967296) (- 4294967296))) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (not (<= (mod v_prenex_1 4294967296) 2147483647))) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1)))) (exists ((v_max_~ret~0_BEFORE_RETURN_1 Int) (v_prenex_2 Int) (v_max_~ret~0_BEFORE_RETURN_2 Int) (v_prenex_1 Int)) (or (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296)) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= main_~ret~1 (+ (mod v_prenex_1 4294967296) (- 4294967296))) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (not (<= (mod v_prenex_1 4294967296) 2147483647)))))) [2019-10-07 15:24:00,046 INFO L193 IcfgInterpreter]: Reachable states at location L20 satisfy 38#(and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-07 15:24:00,047 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 192#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_29 Int) (v_max_~ret~0_BEFORE_RETURN_5 Int) (v_prenex_30 Int) (v_max_~ret~0_BEFORE_RETURN_6 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (not (< (+ main_~i~1 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (not (< (+ main_~i~1 1) ~N~0)))))) (and (exists ((v_prenex_29 Int) (v_max_~ret~0_BEFORE_RETURN_5 Int) (v_prenex_30 Int) (v_max_~ret~0_BEFORE_RETURN_6 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (not (< (+ main_~i~1 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (not (< (+ main_~i~1 1) ~N~0))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-07 15:24:00,906 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:24:00,906 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 12] total 21 [2019-10-07 15:24:00,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 15:24:00,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 15:24:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-10-07 15:24:00,911 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 22 states. [2019-10-07 15:24:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:24:01,651 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-10-07 15:24:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 15:24:01,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-10-07 15:24:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:24:01,653 INFO L225 Difference]: With dead ends: 36 [2019-10-07 15:24:01,654 INFO L226 Difference]: Without dead ends: 22 [2019-10-07 15:24:01,655 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-07 15:24:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-07 15:24:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-07 15:24:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 15:24:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-07 15:24:01,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 28 [2019-10-07 15:24:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:24:01,666 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-07 15:24:01,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 15:24:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-07 15:24:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-07 15:24:01,669 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:24:01,669 INFO L385 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:24:01,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:01,874 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:24:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:24:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 257299344, now seen corresponding path program 2 times [2019-10-07 15:24:01,875 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:24:01,875 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:01,876 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:01,876 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:24:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat