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/max05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:23:55,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:23:55,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:23:55,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:23:55,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:23:55,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:23:55,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:23:55,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:23:55,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:23:55,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:23:55,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:23:55,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:23:55,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:23:55,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:23:55,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:23:55,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:23:55,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:23:55,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:23:55,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:23:55,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:23:55,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:23:55,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:23:55,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:23:55,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:23:55,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:23:55,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:23:55,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:23:55,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:23:55,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:23:55,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:23:55,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:23:55,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:23:55,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:23:55,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:23:55,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:23:55,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:23:55,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:23:55,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:23:55,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:23:55,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:23:55,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:23:55,652 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:55,666 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:23:55,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:23:55,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:23:55,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:23:55,668 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:23:55,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:23:55,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:23:55,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:23:55,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:23:55,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:23:55,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:23:55,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:23:55,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:23:55,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:23:55,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:23:55,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:23:55,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:23:55,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:23:55,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:23:55,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:23:55,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:23:55,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:23:55,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:23:55,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:23:55,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:23:55,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:23:55,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:23:55,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:23:55,672 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:55,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:23:56,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:23:56,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:23:56,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:23:56,020 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:23:56,020 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max05-1.i [2019-10-07 15:23:56,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d84e8227/c88ada8221894153839e790bc14c8c54/FLAG7d3b9e16d [2019-10-07 15:23:56,532 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:23:56,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max05-1.i [2019-10-07 15:23:56,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d84e8227/c88ada8221894153839e790bc14c8c54/FLAG7d3b9e16d [2019-10-07 15:23:56,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d84e8227/c88ada8221894153839e790bc14c8c54 [2019-10-07 15:23:56,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:23:56,945 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:23:56,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:23:56,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:23:56,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:23:56,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:23:56" (1/1) ... [2019-10-07 15:23:56,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33327728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:56, skipping insertion in model container [2019-10-07 15:23:56,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:23:56" (1/1) ... [2019-10-07 15:23:56,961 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:23:56,982 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:23:57,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:23:57,184 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:23:57,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:23:57,219 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:23:57,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:57 WrapperNode [2019-10-07 15:23:57,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:23:57,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:23:57,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:23:57,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:23:57,314 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:57" (1/1) ... [2019-10-07 15:23:57,314 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:57" (1/1) ... [2019-10-07 15:23:57,321 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:57" (1/1) ... [2019-10-07 15:23:57,321 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:57" (1/1) ... [2019-10-07 15:23:57,329 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:57" (1/1) ... [2019-10-07 15:23:57,336 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:57" (1/1) ... [2019-10-07 15:23:57,338 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:57" (1/1) ... [2019-10-07 15:23:57,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:23:57,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:23:57,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:23:57,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:23:57,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:57" (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:57,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:23:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:23:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-10-07 15:23:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:23:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:23:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:23:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-10-07 15:23:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 15:23:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:23:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 15:23:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 15:23:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 15:23:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:23:57,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:23:57,807 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:23:57,807 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 15:23:57,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:23:57 BoogieIcfgContainer [2019-10-07 15:23:57,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:23:57,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:23:57,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:23:57,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:23:57,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:23:56" (1/3) ... [2019-10-07 15:23:57,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2020b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:23:57, skipping insertion in model container [2019-10-07 15:23:57,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:57" (2/3) ... [2019-10-07 15:23:57,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2020b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:23:57, skipping insertion in model container [2019-10-07 15:23:57,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:23:57" (3/3) ... [2019-10-07 15:23:57,817 INFO L109 eAbstractionObserver]: Analyzing ICFG max05-1.i [2019-10-07 15:23:57,833 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:23:57,841 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:23:57,852 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:23:57,879 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:23:57,879 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:23:57,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:23:57,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:23:57,879 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:23:57,880 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:23:57,880 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:23:57,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:23:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-07 15:23:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 15:23:57,904 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:23:57,905 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:57,907 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:23:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:23:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 855740909, now seen corresponding path program 1 times [2019-10-07 15:23:57,919 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:23:57,919 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:57,919 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:57,919 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:23:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 15:23:58,121 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:58,124 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:23:58,124 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:23:58,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:23:58,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:23:58,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:23:58,156 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-07 15:23:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:23:58,216 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-07 15:23:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:23:58,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-07 15:23:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:23:58,232 INFO L225 Difference]: With dead ends: 41 [2019-10-07 15:23:58,232 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 15:23:58,240 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:23:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 15:23:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 15:23:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 15:23:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-07 15:23:58,296 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-07 15:23:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:23:58,298 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-07 15:23:58,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:23:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-07 15:23:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 15:23:58,304 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:23:58,304 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, 1] [2019-10-07 15:23:58,305 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:23:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:23:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1075349738, now seen corresponding path program 1 times [2019-10-07 15:23:58,307 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:23:58,307 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:58,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:58,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:23:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 15:23:58,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:58,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:23:58,455 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:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:58,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 15:23:58,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:23:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 15:23:58,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:23:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 15:23:58,620 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:23:58,620 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-07 15:23:58,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:23:58,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:23:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:23:58,624 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-07 15:23:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:23:58,641 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-07 15:23:58,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:23:58,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-07 15:23:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:23:58,644 INFO L225 Difference]: With dead ends: 33 [2019-10-07 15:23:58,644 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 15:23:58,646 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:23:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 15:23:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 15:23:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 15:23:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-07 15:23:58,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-07 15:23:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:23:58,659 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-07 15:23:58,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:23:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-07 15:23:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 15:23:58,663 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:23:58,663 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:58,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:23:58,865 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:23:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:23:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash 447698074, now seen corresponding path program 1 times [2019-10-07 15:23:58,865 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:23:58,866 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:58,866 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:58,866 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:23:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 15:23:58,942 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:58,943 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:23:58,943 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:23:58,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:23:58,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:23:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:23:58,945 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-07 15:23:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:23:58,962 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-07 15:23:58,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:23:58,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-07 15:23:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:23:58,964 INFO L225 Difference]: With dead ends: 31 [2019-10-07 15:23:58,965 INFO L226 Difference]: Without dead ends: 22 [2019-10-07 15:23:58,965 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:23:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-07 15:23:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-07 15:23:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 15:23:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-07 15:23:58,972 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-07 15:23:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:23:58,974 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-07 15:23:58,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:23:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-07 15:23:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 15:23:58,976 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:23:58,976 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, 1] [2019-10-07 15:23:58,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:23:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:23:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash -69054062, now seen corresponding path program 1 times [2019-10-07 15:23:58,977 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:23:58,977 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:58,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:58,978 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:23:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:23:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 15:23:59,083 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:23:59,084 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:23:59,084 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:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:23:59,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:23:59,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:23:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 15:23:59,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:23:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 15:23:59,247 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:23:59,273 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:23:59,273 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:23:59,279 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:23:59,287 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:23:59,288 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:23:59,412 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:24:01,342 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-07 15:24:01,383 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:24:01,387 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:24:01,388 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:24:01,388 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 222#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (v_max_~ret~0_BEFORE_RETURN_5 Int) (v_max_~ret~0_BEFORE_RETURN_6 Int)) (or (and (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_30 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_30 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)))))) (and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (v_max_~ret~0_BEFORE_RETURN_5 Int) (v_max_~ret~0_BEFORE_RETURN_6 Int)) (or (and (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_30 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_30 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-07 15:24:01,389 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 640#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 15:24:01,389 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 636#(and (not (< max_~i~0 5)) (<= 0 max_~i~0) (<= 5 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:01,389 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 467#true [2019-10-07 15:24:01,390 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 510#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-07 15:24:01,390 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 631#(<= 0 max_~i~0) [2019-10-07 15:24:01,391 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:01,391 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:01,391 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(or (exists ((v_prenex_2 Int) (v_max_~ret~0_BEFORE_RETURN_2 Int)) (or (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (not (< main_~i~1 5)) (= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) |main_#t~ret6|)))) (exists ((v_max_~ret~0_BEFORE_RETURN_1 Int) (v_prenex_1 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (not (< main_~i~1 5)) (= |main_#t~ret6| (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296))) (and (= (+ (mod v_prenex_1 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_prenex_1 4294967296) 2147483647)))))) [2019-10-07 15:24:01,391 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 368#true [2019-10-07 15:24:01,391 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 645#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:01,392 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:24:01,392 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 301#true [2019-10-07 15:24:01,392 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 589#true [2019-10-07 15:24:01,392 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 575#true [2019-10-07 15:24:01,392 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 548#true [2019-10-07 15:24:01,394 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-07 15:24:01,394 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 580#(exists ((v_prenex_2 Int) (v_max_~ret~0_BEFORE_RETURN_1 Int) (v_max_~ret~0_BEFORE_RETURN_2 Int) (v_prenex_1 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_prenex_1 4294967296) (- 4294967296))) (not (<= (mod v_prenex_1 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296)) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-07 15:24:01,395 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:24:01,755 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:24:01,755 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 15:24:01,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 15:24:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 15:24:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-07 15:24:01,758 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-07 15:24:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:24:02,427 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-07 15:24:02,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 15:24:02,427 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-07 15:24:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:24:02,428 INFO L225 Difference]: With dead ends: 40 [2019-10-07 15:24:02,428 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 15:24:02,431 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2019-10-07 15:24:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 15:24:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 15:24:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 15:24:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-07 15:24:02,438 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-07 15:24:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:24:02,439 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-07 15:24:02,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 15:24:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-07 15:24:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 15:24:02,440 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:24:02,440 INFO L385 BasicCegarLoop]: trace histogram [4, 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:24:02,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:02,644 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:24:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:24:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash -493974743, now seen corresponding path program 2 times [2019-10-07 15:24:02,645 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:24:02,645 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:02,645 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:02,646 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:24:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:24:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 15:24:02,715 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:02,716 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:24:02,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:02,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 15:24:02,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 15:24:02,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:24:02,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:24:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 15:24:02,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:24:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 15:24:02,857 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:24:02,858 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:24:02,859 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:24:02,859 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:24:02,860 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:24:02,860 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:24:02,884 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:24:04,451 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-07 15:24:04,495 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:24:04,507 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:24:04,508 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:24:04,509 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (exists ((v_prenex_224 Int) (v_max_~ret~0_BEFORE_RETURN_32 Int) (v_max_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0)))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_224 Int) (v_max_~ret~0_BEFORE_RETURN_32 Int) (v_max_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0)))))) [2019-10-07 15:24:04,509 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 15:24:04,510 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 5)) (<= 0 max_~i~0) (<= 5 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:04,510 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-07 15:24:04,510 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-07 15:24:04,510 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-07 15:24:04,510 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:04,511 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:04,511 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_prenex_196 Int) (v_max_~ret~0_BEFORE_RETURN_28 Int)) (or (and (not (<= (mod v_prenex_196 4294967296) 2147483647)) (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647) (not (< main_~i~1 5)) (= |main_#t~ret6| (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296))))) (exists ((v_prenex_195 Int) (v_max_~ret~0_BEFORE_RETURN_27 Int)) (or (and (= (mod v_prenex_195 4294967296) |main_#t~ret6|) (not (< main_~i~1 5)) (<= (mod v_prenex_195 4294967296) 2147483647)) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (not (< main_~i~1 5)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) |main_#t~ret6|))))) [2019-10-07 15:24:04,511 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-07 15:24:04,517 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:04,518 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:24:04,518 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-07 15:24:04,518 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-07 15:24:04,518 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-07 15:24:04,519 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-07 15:24:04,519 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-07 15:24:04,519 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_prenex_196 Int) (v_prenex_195 Int) (v_max_~ret~0_BEFORE_RETURN_28 Int) (v_max_~ret~0_BEFORE_RETURN_27 Int)) (or (and (<= main_~ret~1 2147483647) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) main_~ret~1) (not (<= (mod v_prenex_196 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_prenex_195 4294967296) main_~ret~1) (<= (mod v_prenex_195 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296)) (<= main_~ret~1 2147483647) (<= (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-07 15:24:04,519 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:24:04,890 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:24:04,891 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-07 15:24:04,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 15:24:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 15:24:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-07 15:24:04,893 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-07 15:24:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:24:05,775 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-07 15:24:05,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 15:24:05,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-07 15:24:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:24:05,776 INFO L225 Difference]: With dead ends: 44 [2019-10-07 15:24:05,776 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 15:24:05,779 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 15:24:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 15:24:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-07 15:24:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 15:24:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-07 15:24:05,791 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-07 15:24:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:24:05,792 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-07 15:24:05,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 15:24:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-07 15:24:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 15:24:05,795 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:24:05,795 INFO L385 BasicCegarLoop]: trace histogram [12, 5, 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:05,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:06,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:24:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:24:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 132820922, now seen corresponding path program 3 times [2019-10-07 15:24:06,000 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:24:06,000 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:06,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:06,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:24:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:24:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 15:24:06,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:06,149 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:24:06,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:06,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 15:24:06,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 15:24:06,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 15:24:06,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:24:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 15:24:06,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:24:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 15:24:06,374 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:24:06,377 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:24:06,377 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:24:06,378 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:24:06,378 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:24:06,378 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:24:06,403 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:24:08,034 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-07 15:24:08,068 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:24:08,072 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:24:08,073 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:24:08,073 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_max_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int) (v_max_~ret~0_BEFORE_RETURN_58 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_prenex_418 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_418 4294967296) 2147483647) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_prenex_417 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_417 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647)) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)))))) (and (not (= main_~ret~1 main_~ret5~0)) (exists ((v_max_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int) (v_max_~ret~0_BEFORE_RETURN_58 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_prenex_418 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_418 4294967296) 2147483647) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_prenex_417 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_417 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647)) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))))))) [2019-10-07 15:24:08,074 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 15:24:08,074 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 5)) (<= 0 max_~i~0) (<= 5 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:08,075 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-07 15:24:08,075 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-07 15:24:08,075 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-07 15:24:08,076 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:08,076 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:08,076 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_max_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (not (< main_~i~1 5)) (= |main_#t~ret6| (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296)) (<= (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647)) (and (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_prenex_390 4294967296) 2147483647))))) (exists ((v_prenex_389 Int) (v_max_~ret~0_BEFORE_RETURN_53 Int)) (or (and (not (< main_~i~1 5)) (<= (mod v_prenex_389 4294967296) 2147483647) (= |main_#t~ret6| (mod v_prenex_389 4294967296))) (and (= (+ (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647)))))) [2019-10-07 15:24:08,077 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-07 15:24:08,077 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:08,077 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:24:08,078 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-07 15:24:08,078 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-07 15:24:08,078 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-07 15:24:08,078 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-07 15:24:08,079 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-07 15:24:08,079 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_prenex_389 Int) (v_max_~ret~0_BEFORE_RETURN_54 Int) (v_max_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_390 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296)) (<= (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (mod v_prenex_389 4294967296) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_389 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-07 15:24:08,080 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:24:08,502 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:24:08,503 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 18 [2019-10-07 15:24:08,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-07 15:24:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-07 15:24:08,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-07 15:24:08,505 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 19 states. [2019-10-07 15:24:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:24:09,238 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-07 15:24:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 15:24:09,238 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-10-07 15:24:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:24:09,239 INFO L225 Difference]: With dead ends: 47 [2019-10-07 15:24:09,239 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 15:24:09,240 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-10-07 15:24:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 15:24:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-07 15:24:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 15:24:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-07 15:24:09,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 42 [2019-10-07 15:24:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:24:09,249 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-07 15:24:09,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-07 15:24:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-07 15:24:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 15:24:09,250 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:24:09,250 INFO L385 BasicCegarLoop]: trace histogram [15, 5, 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:09,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:09,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:24:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:24:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1289972562, now seen corresponding path program 4 times [2019-10-07 15:24:09,456 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:24:09,456 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:09,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:09,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:24:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:24:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-07 15:24:09,553 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:09,553 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:24:09,553 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:24:09,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:24:09,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:24:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-07 15:24:09,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:24:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-07 15:24:09,727 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:24:09,728 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:24:09,729 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:24:09,729 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:24:09,729 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:24:09,730 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:24:09,746 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:24:11,031 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-07 15:24:11,055 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:24:11,058 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:24:11,058 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:24:11,058 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 222#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_max_~ret~0_BEFORE_RETURN_84 Int) (v_max_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647) (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) (- 4294967296))) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_612 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_612 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_611 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_611 4294967296)) (not (< main_~i~2 4)))))) (and (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_max_~ret~0_BEFORE_RETURN_84 Int) (v_max_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647) (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) (- 4294967296))) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_612 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_612 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_611 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_611 4294967296)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-07 15:24:11,059 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 640#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 15:24:11,059 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 636#(and (not (< max_~i~0 5)) (<= 0 max_~i~0) (<= 5 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:11,059 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 467#true [2019-10-07 15:24:11,059 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 510#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-07 15:24:11,059 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 631#(<= 0 max_~i~0) [2019-10-07 15:24:11,059 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:11,060 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:11,060 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(or (exists ((v_max_~ret~0_BEFORE_RETURN_79 Int) (v_prenex_583 Int)) (or (and (= (+ (mod v_prenex_583 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_prenex_583 4294967296) 2147483647))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) |main_#t~ret6|) (not (< main_~i~1 5))))) (exists ((v_prenex_584 Int) (v_max_~ret~0_BEFORE_RETURN_80 Int)) (or (and (not (< main_~i~1 5)) (<= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) |main_#t~ret6|)) (and (= (+ (mod v_prenex_584 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_prenex_584 4294967296) 2147483647)))))) [2019-10-07 15:24:11,060 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 368#true [2019-10-07 15:24:11,060 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 645#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:24:11,060 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:24:11,060 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 301#true [2019-10-07 15:24:11,061 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 589#true [2019-10-07 15:24:11,061 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 575#true [2019-10-07 15:24:11,061 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 548#true [2019-10-07 15:24:11,061 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-07 15:24:11,061 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 580#(exists ((v_max_~ret~0_BEFORE_RETURN_79 Int) (v_prenex_583 Int) (v_prenex_584 Int) (v_max_~ret~0_BEFORE_RETURN_80 Int)) (or (and (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_583 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_583 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (<= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) main_~ret~1) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_584 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_prenex_584 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-07 15:24:11,061 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:24:11,390 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:24:11,391 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 15:24:11,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 15:24:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 15:24:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-07 15:24:11,393 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 18 states. [2019-10-07 15:24:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:24:12,022 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-07 15:24:12,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 15:24:12,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-10-07 15:24:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:24:12,024 INFO L225 Difference]: With dead ends: 46 [2019-10-07 15:24:12,024 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 15:24:12,025 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-10-07 15:24:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 15:24:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-07 15:24:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 15:24:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-07 15:24:12,031 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 45 [2019-10-07 15:24:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:24:12,032 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-07 15:24:12,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 15:24:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-07 15:24:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 15:24:12,033 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:24:12,033 INFO L385 BasicCegarLoop]: trace histogram [15, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:24:12,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:24:12,240 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:24:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:24:12,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1303168550, now seen corresponding path program 5 times [2019-10-07 15:24:12,240 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:24:12,241 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:24:12,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:12,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:24:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:24:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:24:17,521 ERROR L253 erpolLogProxyWrapper]: Interpolant 15 not inductive [2019-10-07 15:24:21,790 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:863) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:55) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 15:24:21,796 INFO L168 Benchmark]: Toolchain (without parser) took 24851.66 ms. Allocated memory was 146.3 MB in the beginning and 543.2 MB in the end (delta: 396.9 MB). Free memory was 104.5 MB in the beginning and 206.7 MB in the end (delta: -102.2 MB). Peak memory consumption was 373.7 MB. Max. memory is 7.1 GB. [2019-10-07 15:24:21,796 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 15:24:21,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.71 ms. Allocated memory is still 146.3 MB. Free memory was 104.5 MB in the beginning and 93.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-10-07 15:24:21,798 INFO L168 Benchmark]: Boogie Preprocessor took 122.11 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.6 MB in the beginning and 181.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-10-07 15:24:21,798 INFO L168 Benchmark]: RCFGBuilder took 466.75 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 158.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-10-07 15:24:21,798 INFO L168 Benchmark]: TraceAbstraction took 23984.90 ms. Allocated memory was 203.4 MB in the beginning and 543.2 MB in the end (delta: 339.7 MB). Free memory was 157.2 MB in the beginning and 206.7 MB in the end (delta: -49.5 MB). Peak memory consumption was 369.2 MB. Max. memory is 7.1 GB. [2019-10-07 15:24:21,800 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.71 ms. Allocated memory is still 146.3 MB. Free memory was 104.5 MB in the beginning and 93.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.11 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.6 MB in the beginning and 181.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.75 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 158.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23984.90 ms. Allocated memory was 203.4 MB in the beginning and 543.2 MB in the end (delta: 339.7 MB). Free memory was 157.2 MB in the beginning and 206.7 MB in the end (delta: -49.5 MB). Peak memory consumption was 369.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...