java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/mbpr2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:18:00,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:18:00,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:18:00,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:18:00,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:18:00,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:18:00,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:18:00,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:18:00,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:18:00,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:18:00,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:18:00,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:18:00,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:18:00,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:18:00,665 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:18:00,666 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:18:00,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:18:00,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:18:00,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:18:00,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:18:00,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:18:00,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:18:00,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:18:00,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:18:00,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:18:00,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:18:00,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:18:00,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:18:00,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:18:00,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:18:00,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:18:00,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:18:00,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:18:00,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:18:00,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:18:00,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:18:00,685 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:18:00,713 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:18:00,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:18:00,715 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:18:00,718 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:18:00,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:18:00,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:18:00,719 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:18:00,719 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:18:00,719 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:18:00,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:18:00,720 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:18:00,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:18:00,720 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:18:00,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:18:00,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:18:00,721 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:18:00,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:18:00,721 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:18:00,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:18:00,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:18:00,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:18:00,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:18:00,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:18:00,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:18:00,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:18:00,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:18:00,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:18:00,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:18:00,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:18:00,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:18:00,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:18:00,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:18:00,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:18:00,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:18:00,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:18:00,790 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:18:00,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr2_true-unreach-call.i [2018-11-23 12:18:00,852 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefca3125/2c8a026d5d8a46c79da22929798823b0/FLAG7123cff46 [2018-11-23 12:18:01,292 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:18:01,293 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr2_true-unreach-call.i [2018-11-23 12:18:01,300 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefca3125/2c8a026d5d8a46c79da22929798823b0/FLAG7123cff46 [2018-11-23 12:18:01,673 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefca3125/2c8a026d5d8a46c79da22929798823b0 [2018-11-23 12:18:01,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:18:01,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:18:01,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:18:01,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:18:01,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:18:01,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:18:01" (1/1) ... [2018-11-23 12:18:01,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b236532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:01, skipping insertion in model container [2018-11-23 12:18:01,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:18:01" (1/1) ... [2018-11-23 12:18:01,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:18:01,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:18:01,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:18:01,976 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:18:02,013 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:18:02,039 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:18:02,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02 WrapperNode [2018-11-23 12:18:02,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:18:02,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:18:02,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:18:02,041 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:18:02,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:18:02,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:18:02,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:18:02,071 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:18:02,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (1/1) ... [2018-11-23 12:18:02,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:18:02,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:18:02,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:18:02,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:18:02,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (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 [2018-11-23 12:18:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:18:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:18:02,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:18:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:18:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:18:02,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:18:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:18:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:18:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:18:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:18:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:18:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:18:03,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:18:03,235 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:18:03,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:18:03 BoogieIcfgContainer [2018-11-23 12:18:03,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:18:03,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:18:03,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:18:03,240 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:18:03,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:18:01" (1/3) ... [2018-11-23 12:18:03,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e44fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:18:03, skipping insertion in model container [2018-11-23 12:18:03,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:02" (2/3) ... [2018-11-23 12:18:03,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e44fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:18:03, skipping insertion in model container [2018-11-23 12:18:03,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:18:03" (3/3) ... [2018-11-23 12:18:03,244 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr2_true-unreach-call.i [2018-11-23 12:18:03,253 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:18:03,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:18:03,278 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:18:03,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:18:03,312 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:18:03,312 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:18:03,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:18:03,313 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:18:03,313 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:18:03,313 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:18:03,313 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:18:03,313 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:18:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 12:18:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:18:03,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:03,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:03,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:03,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:03,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1027175342, now seen corresponding path program 1 times [2018-11-23 12:18:03,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:03,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:03,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:03,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:03,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 12:18:03,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {38#true} is VALID [2018-11-23 12:18:03,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 12:18:03,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2018-11-23 12:18:03,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret10 := main(); {38#true} is VALID [2018-11-23 12:18:03,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {38#true} is VALID [2018-11-23 12:18:03,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {38#true} is VALID [2018-11-23 12:18:03,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {38#true} is VALID [2018-11-23 12:18:03,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {38#true} is VALID [2018-11-23 12:18:03,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#true} ~i~0 := 1; {38#true} is VALID [2018-11-23 12:18:03,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 12:18:03,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 12:18:03,550 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {39#false} is VALID [2018-11-23 12:18:03,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} assume #t~short9; {39#false} is VALID [2018-11-23 12:18:03,550 INFO L256 TraceCheckUtils]: 14: Hoare triple {39#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {39#false} is VALID [2018-11-23 12:18:03,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 12:18:03,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2018-11-23 12:18:03,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 12:18:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:18:03,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:18:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:18:03,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 12:18:03,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:03,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:18:03,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:03,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:18:03,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:18:03,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:18:03,655 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 12:18:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:04,065 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2018-11-23 12:18:04,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:18:04,065 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 12:18:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:18:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-23 12:18:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:18:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-23 12:18:04,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-23 12:18:04,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:04,378 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:18:04,379 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:18:04,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:18:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:18:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:18:04,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:04,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:18:04,431 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:18:04,431 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:18:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:04,437 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:18:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:18:04,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:04,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:04,438 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:18:04,438 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:18:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:04,443 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:18:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:18:04,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:04,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:04,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:04,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:18:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:18:04,450 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2018-11-23 12:18:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:04,450 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:18:04,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:18:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:18:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:18:04,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:04,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:04,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:04,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2086094079, now seen corresponding path program 1 times [2018-11-23 12:18:04,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:04,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:04,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {209#true} is VALID [2018-11-23 12:18:04,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {209#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {209#true} is VALID [2018-11-23 12:18:04,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {209#true} assume true; {209#true} is VALID [2018-11-23 12:18:04,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {209#true} {209#true} #94#return; {209#true} is VALID [2018-11-23 12:18:04,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {209#true} call #t~ret10 := main(); {209#true} is VALID [2018-11-23 12:18:04,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {209#true} is VALID [2018-11-23 12:18:04,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {209#true} is VALID [2018-11-23 12:18:04,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {209#true} is VALID [2018-11-23 12:18:04,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {209#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {209#true} is VALID [2018-11-23 12:18:04,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {209#true} ~i~0 := 1; {209#true} is VALID [2018-11-23 12:18:04,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {209#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {209#true} is VALID [2018-11-23 12:18:04,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {209#true} ~i~0 := 0; {209#true} is VALID [2018-11-23 12:18:04,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {209#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {209#true} is VALID [2018-11-23 12:18:04,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {209#true} assume #t~short9; {211#|main_#t~short9|} is VALID [2018-11-23 12:18:04,635 INFO L256 TraceCheckUtils]: 14: Hoare triple {211#|main_#t~short9|} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {212#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:18:04,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {212#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {213#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:18:04,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {213#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {210#false} is VALID [2018-11-23 12:18:04,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {210#false} assume !false; {210#false} is VALID [2018-11-23 12:18:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:18:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:18:04,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:18:04,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 12:18:04,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:04,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:18:04,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:04,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:18:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:18:04,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:18:04,801 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2018-11-23 12:18:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:05,375 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:18:05,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:18:05,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 12:18:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:18:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:18:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:18:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:18:05,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 12:18:05,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:05,506 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:18:05,507 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:18:05,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:18:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:18:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 12:18:05,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:05,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 12:18:05,555 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 12:18:05,555 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 12:18:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:05,559 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:18:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:18:05,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:05,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:05,560 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 12:18:05,560 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 12:18:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:05,563 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:18:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:18:05,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:05,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:05,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:05,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:18:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 12:18:05,568 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2018-11-23 12:18:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:05,569 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 12:18:05,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:18:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:18:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:18:05,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:05,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:05,570 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:05,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2087941121, now seen corresponding path program 1 times [2018-11-23 12:18:05,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:05,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:05,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:05,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:05,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-23 12:18:05,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {381#true} is VALID [2018-11-23 12:18:05,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 12:18:05,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #94#return; {381#true} is VALID [2018-11-23 12:18:05,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret10 := main(); {381#true} is VALID [2018-11-23 12:18:05,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {381#true} is VALID [2018-11-23 12:18:05,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {381#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {383#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:18:05,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {383#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {384#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:18:05,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {384#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {382#false} is VALID [2018-11-23 12:18:05,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#false} ~i~0 := 1; {382#false} is VALID [2018-11-23 12:18:05,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {382#false} is VALID [2018-11-23 12:18:05,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {382#false} ~i~0 := 0; {382#false} is VALID [2018-11-23 12:18:05,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {382#false} is VALID [2018-11-23 12:18:05,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#false} assume !#t~short9;call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := 0 == #t~mem8; {382#false} is VALID [2018-11-23 12:18:05,778 INFO L256 TraceCheckUtils]: 14: Hoare triple {382#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {382#false} is VALID [2018-11-23 12:18:05,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-23 12:18:05,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2018-11-23 12:18:05,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-23 12:18:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:18:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:18:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:18:05,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:18:05,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:05,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:18:05,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:05,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:18:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:18:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:18:05,820 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 4 states. [2018-11-23 12:18:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:06,140 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-23 12:18:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:18:06,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:18:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:18:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:18:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:18:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:18:06,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 12:18:06,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:06,304 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:18:06,304 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:18:06,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:18:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:18:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-23 12:18:06,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:06,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-23 12:18:06,328 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-23 12:18:06,328 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-23 12:18:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:06,332 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 12:18:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:18:06,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:06,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:06,333 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-23 12:18:06,333 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-23 12:18:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:06,336 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 12:18:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:18:06,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:06,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:06,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:06,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:18:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 12:18:06,340 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 18 [2018-11-23 12:18:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:06,341 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 12:18:06,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:18:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:18:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:18:06,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:06,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:06,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:06,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -779690650, now seen corresponding path program 1 times [2018-11-23 12:18:06,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:06,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:06,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2018-11-23 12:18:06,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {588#true} is VALID [2018-11-23 12:18:06,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2018-11-23 12:18:06,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #94#return; {588#true} is VALID [2018-11-23 12:18:06,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret10 := main(); {588#true} is VALID [2018-11-23 12:18:06,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {588#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {588#true} is VALID [2018-11-23 12:18:06,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {588#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {590#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:18:06,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-23 12:18:06,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-23 12:18:06,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4); {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-23 12:18:06,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);havoc #t~mem3; {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-23 12:18:06,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-23 12:18:06,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {591#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {590#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:18:06,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {590#(<= 2 ~CELLCOUNT~0)} ~i~0 := 1; {592#(and (= main_~i~0 1) (<= 1 (div ~CELLCOUNT~0 2)))} is VALID [2018-11-23 12:18:06,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {592#(and (= main_~i~0 1) (<= 1 (div ~CELLCOUNT~0 2)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {589#false} is VALID [2018-11-23 12:18:06,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {589#false} ~i~0 := 0; {589#false} is VALID [2018-11-23 12:18:06,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {589#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {589#false} is VALID [2018-11-23 12:18:06,655 INFO L273 TraceCheckUtils]: 17: Hoare triple {589#false} assume !#t~short9;call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := 0 == #t~mem8; {589#false} is VALID [2018-11-23 12:18:06,655 INFO L256 TraceCheckUtils]: 18: Hoare triple {589#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {589#false} is VALID [2018-11-23 12:18:06,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {589#false} ~cond := #in~cond; {589#false} is VALID [2018-11-23 12:18:06,656 INFO L273 TraceCheckUtils]: 20: Hoare triple {589#false} assume 0 == ~cond; {589#false} is VALID [2018-11-23 12:18:06,657 INFO L273 TraceCheckUtils]: 21: Hoare triple {589#false} assume !false; {589#false} is VALID [2018-11-23 12:18:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:18:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:18:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:18:06,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:18:06,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:06,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:18:06,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:06,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:18:06,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:18:06,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:18:06,697 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 5 states. [2018-11-23 12:18:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:07,014 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 12:18:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:18:07,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:18:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:18:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:18:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:18:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:18:07,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:18:07,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:07,130 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:18:07,130 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:18:07,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:18:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:18:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-11-23 12:18:07,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:07,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 36 states. [2018-11-23 12:18:07,346 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 36 states. [2018-11-23 12:18:07,346 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 36 states. [2018-11-23 12:18:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:07,349 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:18:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:18:07,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:07,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:07,350 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 42 states. [2018-11-23 12:18:07,351 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 42 states. [2018-11-23 12:18:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:07,354 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:18:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:18:07,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:07,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:07,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:07,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:18:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 12:18:07,358 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2018-11-23 12:18:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:07,358 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 12:18:07,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:18:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:18:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:18:07,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:07,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:07,360 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:07,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1576263499, now seen corresponding path program 1 times [2018-11-23 12:18:07,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:07,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:07,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:07,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:07,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:07,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {807#true} is VALID [2018-11-23 12:18:07,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {807#true} is VALID [2018-11-23 12:18:07,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2018-11-23 12:18:07,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #94#return; {807#true} is VALID [2018-11-23 12:18:07,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {807#true} call #t~ret10 := main(); {807#true} is VALID [2018-11-23 12:18:07,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {807#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {807#true} is VALID [2018-11-23 12:18:07,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {807#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4); {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);havoc #t~mem3; {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:18:07,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {809#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4); {808#false} is VALID [2018-11-23 12:18:07,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {808#false} call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4);havoc #t~mem5; {808#false} is VALID [2018-11-23 12:18:07,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {808#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {808#false} is VALID [2018-11-23 12:18:07,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {808#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {808#false} is VALID [2018-11-23 12:18:07,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {808#false} ~i~0 := 0; {808#false} is VALID [2018-11-23 12:18:07,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {808#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {808#false} is VALID [2018-11-23 12:18:07,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {808#false} assume !#t~short9;call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := 0 == #t~mem8; {808#false} is VALID [2018-11-23 12:18:07,461 INFO L256 TraceCheckUtils]: 22: Hoare triple {808#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {808#false} is VALID [2018-11-23 12:18:07,461 INFO L273 TraceCheckUtils]: 23: Hoare triple {808#false} ~cond := #in~cond; {808#false} is VALID [2018-11-23 12:18:07,461 INFO L273 TraceCheckUtils]: 24: Hoare triple {808#false} assume 0 == ~cond; {808#false} is VALID [2018-11-23 12:18:07,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {808#false} assume !false; {808#false} is VALID [2018-11-23 12:18:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:18:07,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:18:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:18:07,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:18:07,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:07,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:18:07,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:07,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:18:07,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:18:07,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:18:07,522 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2018-11-23 12:18:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:07,639 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 12:18:07,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:18:07,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:18:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:18:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 12:18:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:18:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 12:18:07,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2018-11-23 12:18:07,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:07,869 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:18:07,869 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:18:07,870 INFO L631 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 [2018-11-23 12:18:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:18:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:18:07,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:07,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 12:18:07,916 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:18:07,916 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:18:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:07,918 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:18:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:18:07,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:07,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:07,919 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:18:07,919 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:18:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:07,921 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:18:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:18:07,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:07,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:07,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:07,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:18:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 12:18:07,924 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2018-11-23 12:18:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:07,925 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 12:18:07,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:18:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:18:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:18:07,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:07,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:07,927 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:07,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2017639219, now seen corresponding path program 1 times [2018-11-23 12:18:07,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:07,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:07,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:07,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:07,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:08,545 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2018-11-23 12:18:08,731 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2018-11-23 12:18:09,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2018-11-23 12:18:09,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {1009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1009#true} is VALID [2018-11-23 12:18:09,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {1009#true} assume true; {1009#true} is VALID [2018-11-23 12:18:09,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1009#true} {1009#true} #94#return; {1009#true} is VALID [2018-11-23 12:18:09,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {1009#true} call #t~ret10 := main(); {1009#true} is VALID [2018-11-23 12:18:09,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {1009#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1009#true} is VALID [2018-11-23 12:18:09,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {1009#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1011#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-23 12:18:09,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {1011#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {1012#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0)))} is VALID [2018-11-23 12:18:09,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {1012#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1013#(and (<= main_~i~0 (div ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0)))} is VALID [2018-11-23 12:18:09,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {1013#(and (<= main_~i~0 (div ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0)))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4); {1014#(and (<= main_~i~0 (div ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)))) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} is VALID [2018-11-23 12:18:09,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {1014#(and (<= main_~i~0 (div ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)))) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);havoc #t~mem3; {1014#(and (<= main_~i~0 (div ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)))) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} is VALID [2018-11-23 12:18:09,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {1014#(and (<= main_~i~0 (div ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) 8)) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4)))) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1015#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:09,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {1015#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1016#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:18:09,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {1016#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} ~i~0 := 1; {1017#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:18:09,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {1017#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1018#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} is VALID [2018-11-23 12:18:09,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {1018#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4); {1018#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} is VALID [2018-11-23 12:18:10,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {1018#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4);havoc #t~mem5; {1018#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} is VALID [2018-11-23 12:18:10,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {1018#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= 9 (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (- 8))))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1019#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 8 (div ~CELLCOUNT~0 2)) 7)) (and (< ~CELLCOUNT~0 0) (<= (* 8 main_~i~0) (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)) 15)) (not (= (* 2 (div ~CELLCOUNT~0 2)) ~CELLCOUNT~0))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:18:10,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {1019#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 8 (div ~CELLCOUNT~0 2)) 7)) (and (< ~CELLCOUNT~0 0) (<= (* 8 main_~i~0) (+ |main_~#volArray~0.offset| (* 8 (div ~CELLCOUNT~0 2)) 15)) (not (= (* 2 (div ~CELLCOUNT~0 2)) ~CELLCOUNT~0))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1020#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-23 12:18:10,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {1020#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {1021#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} is VALID [2018-11-23 12:18:10,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {1021#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {1022#(and |main_#t~short9| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:18:10,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {1022#(and |main_#t~short9| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !#t~short9;call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := 0 == #t~mem8; {1010#false} is VALID [2018-11-23 12:18:10,024 INFO L256 TraceCheckUtils]: 22: Hoare triple {1010#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {1010#false} is VALID [2018-11-23 12:18:10,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#false} ~cond := #in~cond; {1010#false} is VALID [2018-11-23 12:18:10,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#false} assume 0 == ~cond; {1010#false} is VALID [2018-11-23 12:18:10,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2018-11-23 12:18:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:18:10,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:10,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:10,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:10,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:10,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:18:10,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 12:18:10,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-23 12:18:10,403 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:18:10,404 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~CCCELVOL2~0]. (and (<= main_~MINVAL~0 2) (<= 3 main_~CCCELVOL2~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (store |v_#memory_int_17| |main_~#volArray~0.base| (store (select |v_#memory_int_17| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8)) main_~CCCELVOL2~0)) |#memory_int|)) [2018-11-23 12:18:10,404 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8)))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0)) [2018-11-23 12:18:10,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 12:18:10,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:10,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-23 12:18:10,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2018-11-23 12:18:10,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 12:18:10,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:10,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:10,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 37 [2018-11-23 12:18:10,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:10,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 12:18:11,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 12:18:11,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:11,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:11,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:18:11,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 84 [2018-11-23 12:18:11,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:18:11,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:11,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:18:11,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2018-11-23 12:18:11,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2018-11-23 12:18:11,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {1009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1009#true} is VALID [2018-11-23 12:18:11,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {1009#true} assume true; {1009#true} is VALID [2018-11-23 12:18:11,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1009#true} {1009#true} #94#return; {1009#true} is VALID [2018-11-23 12:18:11,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {1009#true} call #t~ret10 := main(); {1009#true} is VALID [2018-11-23 12:18:11,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {1009#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1009#true} is VALID [2018-11-23 12:18:11,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {1009#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1044#(and (<= main_~MINVAL~0 2) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {1044#(and (<= main_~MINVAL~0 2) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {1048#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {1048#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1048#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {1048#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4); {1055#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8)))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {1055#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8)))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4);havoc #t~mem3; {1059#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {1059#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1059#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {1059#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1059#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {1059#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {1069#(and (<= 1 main_~i~0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {1069#(and (<= 1 main_~i~0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1069#(and (<= 1 main_~i~0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {1069#(and (<= 1 main_~i~0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 1), 4); {1076#(and (<= 1 main_~i~0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:18:11,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {1076#(and (<= 1 main_~i~0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - 2), 4);havoc #t~mem5; {1080#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0))))} is VALID [2018-11-23 12:18:11,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1080#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0))))} is VALID [2018-11-23 12:18:11,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {1080#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1080#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0))))} is VALID [2018-11-23 12:18:11,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {1080#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0))))} ~i~0 := 0; {1090#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= 1 v_prenex_1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_1) (- 4))) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:18:11,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#(and (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= 1 v_prenex_1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_1) (- 4))) 0))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {1094#|main_#t~short9|} is VALID [2018-11-23 12:18:11,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {1094#|main_#t~short9|} assume !#t~short9;call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short9 := 0 == #t~mem8; {1010#false} is VALID [2018-11-23 12:18:11,888 INFO L256 TraceCheckUtils]: 22: Hoare triple {1010#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {1010#false} is VALID [2018-11-23 12:18:11,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#false} ~cond := #in~cond; {1010#false} is VALID [2018-11-23 12:18:11,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#false} assume 0 == ~cond; {1010#false} is VALID [2018-11-23 12:18:11,889 INFO L273 TraceCheckUtils]: 25: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2018-11-23 12:18:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:18:11,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:11,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-11-23 12:18:11,919 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-11-23 12:18:11,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:11,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:18:12,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:12,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:18:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:18:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:18:12,136 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 23 states. [2018-11-23 12:18:15,642 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-11-23 12:18:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:16,030 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-23 12:18:16,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:18:16,031 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-11-23 12:18:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:18:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 12:18:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:18:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 12:18:16,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 87 transitions. [2018-11-23 12:18:16,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:16,177 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:18:16,178 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:18:16,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:18:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:18:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-11-23 12:18:16,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:16,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 38 states. [2018-11-23 12:18:16,325 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 38 states. [2018-11-23 12:18:16,325 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 38 states. [2018-11-23 12:18:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:16,330 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:18:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:18:16,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:16,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:16,331 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 55 states. [2018-11-23 12:18:16,331 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 55 states. [2018-11-23 12:18:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:16,334 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:18:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:18:16,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:16,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:16,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:16,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:18:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-23 12:18:16,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2018-11-23 12:18:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:16,338 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-23 12:18:16,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:18:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-23 12:18:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:18:16,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:16,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:16,339 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:16,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:16,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1612272465, now seen corresponding path program 1 times [2018-11-23 12:18:16,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:16,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:17,109 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: select-over-store with same index should have been removed at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:72) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) 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.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2018-11-23 12:18:17,113 INFO L168 Benchmark]: Toolchain (without parser) took 15429.98 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 863.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -314.0 MB). Peak memory consumption was 549.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:18:17,114 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:18:17,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:18:17,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:18:17,116 INFO L168 Benchmark]: Boogie Preprocessor took 37.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:18:17,116 INFO L168 Benchmark]: RCFGBuilder took 1128.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:18:17,117 INFO L168 Benchmark]: TraceAbstraction took 13875.00 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 448.6 MB). Peak memory consumption was 572.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:18:17,122 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1128.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13875.00 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 448.6 MB). Peak memory consumption was 572.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: select-over-store with same index should have been removed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: select-over-store with same index should have been removed: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:72) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...