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/nr3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:19:29,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:19:29,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:19:29,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:19:29,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:19:29,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:19:29,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:19:29,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:19:29,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:19:29,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:19:29,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:19:29,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:19:29,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:19:29,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:19:29,574 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:19:29,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:19:29,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:19:29,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:19:29,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:19:29,582 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:19:29,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:19:29,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:19:29,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:19:29,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:19:29,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:19:29,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:19:29,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:19:29,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:19:29,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:19:29,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:19:29,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:19:29,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:19:29,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:19:29,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:19:29,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:19:29,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:19:29,596 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:19:29,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:19:29,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:19:29,613 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:19:29,613 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:19:29,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:19:29,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:19:29,614 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:19:29,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:19:29,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:19:29,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:19:29,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:19:29,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:19:29,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:19:29,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:19:29,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:19:29,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:19:29,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:19:29,616 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:19:29,616 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:19:29,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:19:29,617 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:19:29,617 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:19:29,617 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:19:29,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:19:29,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:19:29,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:19:29,618 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:19:29,618 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:19:29,618 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:19:29,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:19:29,619 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:19:29,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:19:29,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:19:29,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:19:29,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:19:29,682 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:19:29,683 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i [2018-11-23 12:19:29,734 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329b8a4fd/6a0243a1ff5d4546bf63c636d1f24b5d/FLAG23a49ec79 [2018-11-23 12:19:30,222 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:19:30,222 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i [2018-11-23 12:19:30,230 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329b8a4fd/6a0243a1ff5d4546bf63c636d1f24b5d/FLAG23a49ec79 [2018-11-23 12:19:30,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329b8a4fd/6a0243a1ff5d4546bf63c636d1f24b5d [2018-11-23 12:19:30,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:19:30,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:19:30,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:30,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:19:30,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:19:30,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:30,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e55024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30, skipping insertion in model container [2018-11-23 12:19:30,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:30,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:19:30,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:19:30,912 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:30,922 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:19:30,968 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:30,998 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:19:30,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30 WrapperNode [2018-11-23 12:19:30,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:31,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:31,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:19:31,001 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:19:31,012 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:19:30" (1/1) ... [2018-11-23 12:19:31,023 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:19:30" (1/1) ... [2018-11-23 12:19:31,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:31,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:19:31,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:19:31,034 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:19:31,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:31,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:31,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:31,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:31,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:31,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:31,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (1/1) ... [2018-11-23 12:19:31,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:19:31,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:19:31,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:19:31,089 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:19:31,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (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:19:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:19:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:19:31,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:19:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:19:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:19:31,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:19:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:19:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:19:31,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:19:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:19:31,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:19:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:19:31,903 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:19:31,907 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:19:31,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:31 BoogieIcfgContainer [2018-11-23 12:19:31,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:19:31,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:19:31,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:19:31,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:19:31,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:19:30" (1/3) ... [2018-11-23 12:19:31,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794e9b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:31, skipping insertion in model container [2018-11-23 12:19:31,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:30" (2/3) ... [2018-11-23 12:19:31,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794e9b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:31, skipping insertion in model container [2018-11-23 12:19:31,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:31" (3/3) ... [2018-11-23 12:19:31,918 INFO L112 eAbstractionObserver]: Analyzing ICFG nr3_true-unreach-call.i [2018-11-23 12:19:31,927 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:19:31,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:19:31,953 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:19:31,992 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:19:31,993 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:19:31,993 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:19:31,993 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:19:31,994 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:19:31,994 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:19:31,994 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:19:31,994 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:19:31,994 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:19:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:19:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:32,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:32,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:32,024 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:32,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2018-11-23 12:19:32,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:32,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:32,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:32,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:32,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:32,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:19:32,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {34#true} is VALID [2018-11-23 12:19:32,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:19:32,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #83#return; {34#true} is VALID [2018-11-23 12:19:32,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret8 := main(); {34#true} is VALID [2018-11-23 12:19:32,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {34#true} is VALID [2018-11-23 12:19:32,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {34#true} is VALID [2018-11-23 12:19:32,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {34#true} is VALID [2018-11-23 12:19:32,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {34#true} is VALID [2018-11-23 12:19:32,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} ~i~0 := 0; {34#true} is VALID [2018-11-23 12:19:32,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {34#true} is VALID [2018-11-23 12:19:32,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume #t~short7; {36#|main_#t~short7|} is VALID [2018-11-23 12:19:32,637 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:19:32,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {38#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:19:32,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {35#false} is VALID [2018-11-23 12:19:32,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:19:32,655 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:19:32,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:32,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:19:32,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:32,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:32,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:19:32,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:32,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:19:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:19:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:32,763 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2018-11-23 12:19:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:33,404 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2018-11-23 12:19:33,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:19:33,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:33,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 12:19:33,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:33,932 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:19:33,932 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:19:33,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:19:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:19:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:19:33,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:33,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:33,992 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:33,992 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:33,997 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:33,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:33,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:33,998 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:33,998 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:34,003 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:34,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:34,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:34,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:34,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:19:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 12:19:34,010 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2018-11-23 12:19:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:34,010 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 12:19:34,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:19:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:19:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:34,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:34,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:34,012 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:34,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2018-11-23 12:19:34,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:34,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:34,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:34,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:34,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 12:19:34,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {222#true} is VALID [2018-11-23 12:19:34,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 12:19:34,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #83#return; {222#true} is VALID [2018-11-23 12:19:34,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret8 := main(); {222#true} is VALID [2018-11-23 12:19:34,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {222#true} is VALID [2018-11-23 12:19:34,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {224#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:19:34,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {224#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {225#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:34,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {223#false} is VALID [2018-11-23 12:19:34,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~i~0 := 0; {223#false} is VALID [2018-11-23 12:19:34,243 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {223#false} is VALID [2018-11-23 12:19:34,243 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {223#false} is VALID [2018-11-23 12:19:34,244 INFO L256 TraceCheckUtils]: 12: Hoare triple {223#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {223#false} is VALID [2018-11-23 12:19:34,244 INFO L273 TraceCheckUtils]: 13: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 12:19:34,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 12:19:34,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 12:19:34,247 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:19:34,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:34,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:34,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:34,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:34,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:34,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:34,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:34,281 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2018-11-23 12:19:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:34,527 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:19:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:34,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:34,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-23 12:19:34,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:34,669 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:19:34,669 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:19:34,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:19:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-23 12:19:34,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:34,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:34,723 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:34,723 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:34,726 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:34,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:34,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:34,727 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:34,727 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:34,731 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:34,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:34,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:34,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:34,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:19:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:19:34,736 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-11-23 12:19:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:34,736 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:19:34,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:19:34,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:34,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:34,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:34,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2018-11-23 12:19:34,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:34,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:34,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:34,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:34,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:34,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 12:19:34,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {411#true} is VALID [2018-11-23 12:19:34,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 12:19:34,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #83#return; {411#true} is VALID [2018-11-23 12:19:34,814 INFO L256 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret8 := main(); {411#true} is VALID [2018-11-23 12:19:34,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {411#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {411#true} is VALID [2018-11-23 12:19:34,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {411#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {411#true} is VALID [2018-11-23 12:19:34,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {411#true} is VALID [2018-11-23 12:19:34,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {411#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {413#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:34,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {413#(<= 3 main_~j~0)} assume !(~j~0 >= 1); {412#false} is VALID [2018-11-23 12:19:34,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {412#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {412#false} is VALID [2018-11-23 12:19:34,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {412#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {412#false} is VALID [2018-11-23 12:19:34,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {412#false} ~i~0 := 0; {412#false} is VALID [2018-11-23 12:19:34,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {412#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {412#false} is VALID [2018-11-23 12:19:34,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {412#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {412#false} is VALID [2018-11-23 12:19:34,819 INFO L256 TraceCheckUtils]: 15: Hoare triple {412#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {412#false} is VALID [2018-11-23 12:19:34,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 12:19:34,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 12:19:34,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 12:19:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:34,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:34,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:19:34,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:34,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:34,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:19:34,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:34,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:19:34,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:19:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:19:34,852 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-11-23 12:19:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:34,997 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:19:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:19:34,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:35,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:19:35,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:35,162 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:19:35,162 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:35,164 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:19:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:19:35,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:35,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:35,195 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:35,195 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,199 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:35,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,200 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:35,200 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,203 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:35,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:35,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:19:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 12:19:35,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-23 12:19:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:35,213 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 12:19:35,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:19:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:19:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:35,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:35,214 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:19:35,215 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:35,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2018-11-23 12:19:35,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:35,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:35,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2018-11-23 12:19:35,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {605#true} is VALID [2018-11-23 12:19:35,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2018-11-23 12:19:35,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #83#return; {605#true} is VALID [2018-11-23 12:19:35,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret8 := main(); {605#true} is VALID [2018-11-23 12:19:35,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {605#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {605#true} is VALID [2018-11-23 12:19:35,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:35,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:35,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {608#(<= (+ main_~MINVAL~0 1) main_~j~0)} is VALID [2018-11-23 12:19:35,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(<= (+ main_~MINVAL~0 1) main_~j~0)} assume !!(~j~0 >= 1); {608#(<= (+ main_~MINVAL~0 1) main_~j~0)} is VALID [2018-11-23 12:19:35,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {608#(<= (+ main_~MINVAL~0 1) main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {606#false} is VALID [2018-11-23 12:19:35,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {606#false} is VALID [2018-11-23 12:19:35,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~j~0 >= 1); {606#false} is VALID [2018-11-23 12:19:35,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {606#false} is VALID [2018-11-23 12:19:35,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {606#false} is VALID [2018-11-23 12:19:35,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {606#false} ~i~0 := 0; {606#false} is VALID [2018-11-23 12:19:35,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {606#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {606#false} is VALID [2018-11-23 12:19:35,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {606#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {606#false} is VALID [2018-11-23 12:19:35,359 INFO L256 TraceCheckUtils]: 18: Hoare triple {606#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {606#false} is VALID [2018-11-23 12:19:35,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2018-11-23 12:19:35,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#false} assume 0 == ~cond; {606#false} is VALID [2018-11-23 12:19:35,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#false} assume !false; {606#false} is VALID [2018-11-23 12:19:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:35,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:35,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:35,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:35,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:35,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:35,418 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:19:35,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:35,419 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2018-11-23 12:19:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,582 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:19:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:35,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:35,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2018-11-23 12:19:35,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:35,676 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:19:35,676 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:35,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:19:35,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:35,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:35,714 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:35,714 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,717 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:35,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,718 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:35,718 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,721 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:35,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:35,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:19:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:19:35,724 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-11-23 12:19:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:35,725 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:19:35,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:19:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:35,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:35,726 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:19:35,727 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:35,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2018-11-23 12:19:35,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:35,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:35,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {805#true} is VALID [2018-11-23 12:19:35,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:35,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:35,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:35,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {805#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {805#true} is VALID [2018-11-23 12:19:35,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:35,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:35,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {807#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:35,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:35,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {807#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:35,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:35,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 2 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:35,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {806#false} is VALID [2018-11-23 12:19:35,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {806#false} is VALID [2018-11-23 12:19:35,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:35,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {806#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {806#false} is VALID [2018-11-23 12:19:35,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {806#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {806#false} is VALID [2018-11-23 12:19:35,819 INFO L256 TraceCheckUtils]: 18: Hoare triple {806#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {806#false} is VALID [2018-11-23 12:19:35,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:35,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:35,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:35,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:35,822 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:19:35,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:35,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:36,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:36,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {805#true} is VALID [2018-11-23 12:19:36,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:36,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:36,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:36,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {805#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {805#true} is VALID [2018-11-23 12:19:36,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:36,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:36,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {807#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:36,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:36,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {807#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:36,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:36,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 2 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:36,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {806#false} is VALID [2018-11-23 12:19:36,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {806#false} is VALID [2018-11-23 12:19:36,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:36,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {806#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {806#false} is VALID [2018-11-23 12:19:36,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {806#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {806#false} is VALID [2018-11-23 12:19:36,176 INFO L256 TraceCheckUtils]: 18: Hoare triple {806#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {806#false} is VALID [2018-11-23 12:19:36,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:36,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:36,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:36,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:36,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 12:19:36,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:36,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:36,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:36,233 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:19:36,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:36,234 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 12:19:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,606 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-23 12:19:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:36,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:19:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:19:36,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:19:36,756 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:19:36,758 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:19:36,758 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:19:36,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 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:19:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:19:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 12:19:36,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:36,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:36,866 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:36,866 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,868 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:19:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:19:36,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:36,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:36,869 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-23 12:19:36,869 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-23 12:19:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,872 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:19:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:19:36,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:36,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:36,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:36,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:19:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 12:19:36,876 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-11-23 12:19:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:36,876 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 12:19:36,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:19:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:19:36,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:36,878 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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:19:36,878 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:36,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2018-11-23 12:19:36,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:36,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:36,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {1080#true} call ULTIMATE.init(); {1080#true} is VALID [2018-11-23 12:19:37,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {1080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1080#true} is VALID [2018-11-23 12:19:37,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {1080#true} assume true; {1080#true} is VALID [2018-11-23 12:19:37,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1080#true} {1080#true} #83#return; {1080#true} is VALID [2018-11-23 12:19:37,024 INFO L256 TraceCheckUtils]: 4: Hoare triple {1080#true} call #t~ret8 := main(); {1080#true} is VALID [2018-11-23 12:19:37,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {1080#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1080#true} is VALID [2018-11-23 12:19:37,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {1080#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1080#true} is VALID [2018-11-23 12:19:37,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {1080#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1080#true} is VALID [2018-11-23 12:19:37,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {1080#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1082#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:37,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {1082#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {1082#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:37,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {1082#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1082#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:37,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1083#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:37,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {1083#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {1083#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:37,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {1083#(<= 2 main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1083#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:37,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {1083#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1084#(<= 1 main_~j~0)} is VALID [2018-11-23 12:19:37,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1081#false} is VALID [2018-11-23 12:19:37,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {1081#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1081#false} is VALID [2018-11-23 12:19:37,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {1081#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1081#false} is VALID [2018-11-23 12:19:37,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#false} ~i~0 := 0; {1081#false} is VALID [2018-11-23 12:19:37,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {1081#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1081#false} is VALID [2018-11-23 12:19:37,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {1081#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1081#false} is VALID [2018-11-23 12:19:37,049 INFO L256 TraceCheckUtils]: 21: Hoare triple {1081#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1081#false} is VALID [2018-11-23 12:19:37,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {1081#false} ~cond := #in~cond; {1081#false} is VALID [2018-11-23 12:19:37,049 INFO L273 TraceCheckUtils]: 23: Hoare triple {1081#false} assume 0 == ~cond; {1081#false} is VALID [2018-11-23 12:19:37,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {1081#false} assume !false; {1081#false} is VALID [2018-11-23 12:19:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:37,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:37,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:37,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:37,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {1080#true} call ULTIMATE.init(); {1080#true} is VALID [2018-11-23 12:19:37,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {1080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1080#true} is VALID [2018-11-23 12:19:37,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {1080#true} assume true; {1080#true} is VALID [2018-11-23 12:19:37,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1080#true} {1080#true} #83#return; {1080#true} is VALID [2018-11-23 12:19:37,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {1080#true} call #t~ret8 := main(); {1080#true} is VALID [2018-11-23 12:19:37,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {1080#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1080#true} is VALID [2018-11-23 12:19:37,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {1080#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1106#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:37,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {1106#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1106#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:37,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {1106#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1113#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:37,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} assume !!(~j~0 >= 1); {1113#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:37,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1113#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1113#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:37,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {1113#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1123#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:37,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {1123#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} assume !!(~j~0 >= 1); {1123#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:37,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {1123#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1081#false} is VALID [2018-11-23 12:19:37,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {1081#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1081#false} is VALID [2018-11-23 12:19:37,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {1081#false} assume !(~j~0 >= 1); {1081#false} is VALID [2018-11-23 12:19:37,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {1081#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1081#false} is VALID [2018-11-23 12:19:37,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {1081#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1081#false} is VALID [2018-11-23 12:19:37,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#false} ~i~0 := 0; {1081#false} is VALID [2018-11-23 12:19:37,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {1081#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1081#false} is VALID [2018-11-23 12:19:37,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {1081#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1081#false} is VALID [2018-11-23 12:19:37,265 INFO L256 TraceCheckUtils]: 21: Hoare triple {1081#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1081#false} is VALID [2018-11-23 12:19:37,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {1081#false} ~cond := #in~cond; {1081#false} is VALID [2018-11-23 12:19:37,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {1081#false} assume 0 == ~cond; {1081#false} is VALID [2018-11-23 12:19:37,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {1081#false} assume !false; {1081#false} is VALID [2018-11-23 12:19:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:37,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 12:19:37,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:19:37,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:37,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:19:37,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:37,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:19:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:19:37,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:19:37,330 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2018-11-23 12:19:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:37,641 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-23 12:19:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:19:37,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:19:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:19:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-23 12:19:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:19:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-23 12:19:37,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2018-11-23 12:19:37,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:37,776 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:19:37,776 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:19:37,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:19:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:19:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:19:37,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:37,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 12:19:37,870 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:19:37,870 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:19:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:37,872 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:19:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:19:37,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:37,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:37,873 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:19:37,874 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:19:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:37,876 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:19:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:19:37,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:37,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:37,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:37,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:19:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 12:19:37,879 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2018-11-23 12:19:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:37,879 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 12:19:37,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:19:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:19:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:19:37,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:37,881 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:37,881 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:37,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:37,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1405489790, now seen corresponding path program 2 times [2018-11-23 12:19:37,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:37,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:37,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:37,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:37,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:38,594 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2018-11-23 12:19:38,778 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2018-11-23 12:19:40,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1381#true} is VALID [2018-11-23 12:19:40,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {1381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1381#true} is VALID [2018-11-23 12:19:40,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {1381#true} assume true; {1381#true} is VALID [2018-11-23 12:19:40,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} #83#return; {1381#true} is VALID [2018-11-23 12:19:40,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {1381#true} call #t~ret8 := main(); {1381#true} is VALID [2018-11-23 12:19:40,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {1381#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1381#true} is VALID [2018-11-23 12:19:40,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {1381#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1383#(and (<= 2 ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:40,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {1383#(and (<= 2 ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1384#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:40,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {1384#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1385#(and (= |main_~#volArray~0.offset| 0) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 (+ main_~MINVAL~0 1)))))} is VALID [2018-11-23 12:19:40,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {1385#(and (= |main_~#volArray~0.offset| 0) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 (+ main_~MINVAL~0 1)))))} assume !!(~j~0 >= 1); {1385#(and (= |main_~#volArray~0.offset| 0) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 (+ main_~MINVAL~0 1)))))} is VALID [2018-11-23 12:19:40,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {1385#(and (= |main_~#volArray~0.offset| 0) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 (+ main_~MINVAL~0 1)))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1386#(and (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 (+ main_~MINVAL~0 1)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:40,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {1386#(and (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 (+ main_~MINVAL~0 1)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1387#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))))} is VALID [2018-11-23 12:19:40,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {1387#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))))} assume !!(~j~0 >= 1); {1387#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))))} is VALID [2018-11-23 12:19:40,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {1387#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1388#(and (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:40,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {1388#(and (or (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1389#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:40,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {1389#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {1389#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:40,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {1389#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1390#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:19:40,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {1390#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1391#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:40,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {1391#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {1391#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:40,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {1391#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 11) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1392#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 23) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:40,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {1392#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 23) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1393#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:40,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {1393#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {1394#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:40,298 INFO L273 TraceCheckUtils]: 22: Hoare triple {1394#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1395#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:40,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {1395#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1396#|main_#t~short7|} is VALID [2018-11-23 12:19:40,301 INFO L256 TraceCheckUtils]: 24: Hoare triple {1396#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1397#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:19:40,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {1397#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1398#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:19:40,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {1398#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1382#false} is VALID [2018-11-23 12:19:40,304 INFO L273 TraceCheckUtils]: 27: Hoare triple {1382#false} assume !false; {1382#false} is VALID [2018-11-23 12:19:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:40,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:40,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:40,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:19:40,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:19:40,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:40,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:40,494 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 18 treesize of output 15 [2018-11-23 12:19:40,500 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 15 treesize of output 14 [2018-11-23 12:19:40,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:40,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:40,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:40,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 12:19:40,677 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 31 treesize of output 26 [2018-11-23 12:19:40,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:40,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:40,685 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 26 treesize of output 56 [2018-11-23 12:19:40,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:40,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:40,718 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:19:40,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-11-23 12:19:40,723 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:40,723 WARN L384 uantifierElimination]: Input elimination task: ∃ [main_~j~0, |v_#memory_int_10|]. (let ((.cse0 (select |v_#memory_int_10| |main_~#volArray~0.base|)) (.cse1 (* 12 main_~i~0))) (and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2) (= |#memory_int| (store |v_#memory_int_10| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) main_~j~0)) main_~j~0))) (= 3 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (- 12)))))) [2018-11-23 12:19:40,723 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0]. (let ((.cse0 (select |#memory_int| |main_~#volArray~0.base|)) (.cse1 (* 12 main_~i~0))) (and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= 3 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (- 12)))) (<= main_~j~0 2))) [2018-11-23 12:19:40,944 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 36 treesize of output 29 [2018-11-23 12:19:41,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:41,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:41,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:41,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:41,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 80 [2018-11-23 12:19:41,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:19:41,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:19:41,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 12:19:41,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:78 [2018-11-23 12:19:41,146 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:41,146 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, main_~j~0, v_prenex_1]. (let ((.cse0 (select |v_#memory_int_11| |main_~#volArray~0.base|))) (and (not (<= main_~MINVAL~0 main_~j~0)) (<= v_prenex_1 2) (<= main_~MINVAL~0 2) (= (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (= |#memory_int| (store |v_#memory_int_11| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12) 0))) (= |main_~#volArray~0.offset| 0) (= 3 (select .cse0 |main_~#volArray~0.offset|)))) [2018-11-23 12:19:41,146 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_2, main_~j~0, v_prenex_1]. (let ((.cse1 (select |#memory_int| |main_~#volArray~0.base|))) (let ((.cse0 (= (select .cse1 |main_~#volArray~0.offset|) 3)) (.cse2 (<= main_~MINVAL~0 2)) (.cse3 (= |main_~#volArray~0.offset| 0))) (or (and (not (<= main_~MINVAL~0 main_~j~0)) .cse0 (= (select .cse1 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) v_prenex_2) (<= v_prenex_2 2) .cse2 (= (select .cse1 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0) .cse3) (and .cse0 (<= v_prenex_1 2) .cse2 .cse3 (< v_prenex_1 main_~MINVAL~0) (= (select .cse1 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))) [2018-11-23 12:19:41,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1381#true} is VALID [2018-11-23 12:19:41,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {1381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1381#true} is VALID [2018-11-23 12:19:41,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {1381#true} assume true; {1381#true} is VALID [2018-11-23 12:19:41,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} #83#return; {1381#true} is VALID [2018-11-23 12:19:41,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {1381#true} call #t~ret8 := main(); {1381#true} is VALID [2018-11-23 12:19:41,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {1381#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1381#true} is VALID [2018-11-23 12:19:41,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {1381#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1420#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:41,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {1420#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1424#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:41,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {1424#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1428#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:41,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {1428#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {1428#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:41,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {1428#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1435#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:41,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {1435#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1439#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:41,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {1439#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 >= 1); {1439#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:41,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {1439#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1446#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} is VALID [2018-11-23 12:19:41,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1446#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} is VALID [2018-11-23 12:19:41,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} assume !!(~j~0 >= 1); {1446#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} is VALID [2018-11-23 12:19:41,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} is VALID [2018-11-23 12:19:41,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} is VALID [2018-11-23 12:19:41,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} assume !(~j~0 >= 1); {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} is VALID [2018-11-23 12:19:41,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} is VALID [2018-11-23 12:19:41,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} is VALID [2018-11-23 12:19:41,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))))} ~i~0 := 0; {1472#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:41,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {1472#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 2) (< v_prenex_1 main_~MINVAL~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) 0))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1396#|main_#t~short7|} is VALID [2018-11-23 12:19:41,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {1396#|main_#t~short7|} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1382#false} is VALID [2018-11-23 12:19:41,542 INFO L256 TraceCheckUtils]: 24: Hoare triple {1382#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1382#false} is VALID [2018-11-23 12:19:41,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {1382#false} ~cond := #in~cond; {1382#false} is VALID [2018-11-23 12:19:41,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {1382#false} assume 0 == ~cond; {1382#false} is VALID [2018-11-23 12:19:41,543 INFO L273 TraceCheckUtils]: 27: Hoare triple {1382#false} assume !false; {1382#false} is VALID [2018-11-23 12:19:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:41,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:41,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 26 [2018-11-23 12:19:41,568 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-11-23 12:19:41,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:41,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:19:41,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:41,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:19:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:19:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:19:41,641 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 26 states. [2018-11-23 12:19:43,030 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-23 12:19:45,567 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-23 12:19:48,652 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-11-23 12:19:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:49,922 INFO L93 Difference]: Finished difference Result 142 states and 177 transitions. [2018-11-23 12:19:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:19:49,922 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-11-23 12:19:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:19:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 152 transitions. [2018-11-23 12:19:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:19:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 152 transitions. [2018-11-23 12:19:49,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 152 transitions. [2018-11-23 12:19:50,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:50,235 INFO L225 Difference]: With dead ends: 142 [2018-11-23 12:19:50,235 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:19:50,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=559, Invalid=2411, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:19:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:19:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 58. [2018-11-23 12:19:50,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:50,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 58 states. [2018-11-23 12:19:50,390 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 58 states. [2018-11-23 12:19:50,391 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 58 states. [2018-11-23 12:19:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:50,398 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-11-23 12:19:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2018-11-23 12:19:50,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:50,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:50,400 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 126 states. [2018-11-23 12:19:50,400 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 126 states. [2018-11-23 12:19:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:50,406 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-11-23 12:19:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2018-11-23 12:19:50,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:50,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:50,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:50,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:19:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 12:19:50,409 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 28 [2018-11-23 12:19:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:50,410 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 12:19:50,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:19:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 12:19:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:19:50,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:50,411 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2018-11-23 12:19:50,411 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:50,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 612803125, now seen corresponding path program 1 times [2018-11-23 12:19:50,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:50,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:50,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:51,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2018-11-23 12:19:51,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {2077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2077#true} is VALID [2018-11-23 12:19:51,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2018-11-23 12:19:51,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #83#return; {2077#true} is VALID [2018-11-23 12:19:51,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret8 := main(); {2077#true} is VALID [2018-11-23 12:19:51,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {2077#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2077#true} is VALID [2018-11-23 12:19:51,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {2077#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2079#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:51,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {2079#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {2080#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {2080#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {2081#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {2081#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2081#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {2081#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2081#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {2081#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2082#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {2082#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2082#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {2082#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2083#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} is VALID [2018-11-23 12:19:51,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {2083#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2084#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {2084#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2084#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {2084#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2085#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {2085#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2085#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {2085#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~j~0 >= 1); {2085#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:19:51,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {2085#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2086#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (* 3 main_~i~0) 6) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} is VALID [2018-11-23 12:19:51,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {2086#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (* 3 main_~i~0) 6) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {2087#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1))} is VALID [2018-11-23 12:19:51,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {2087#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1))} ~i~0 := 0; {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} assume #t~short7; {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,754 INFO L256 TraceCheckUtils]: 24: Hoare triple {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2077#true} is VALID [2018-11-23 12:19:51,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2018-11-23 12:19:51,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2018-11-23 12:19:51,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {2077#true} assume true; {2077#true} is VALID [2018-11-23 12:19:51,762 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2077#true} {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} #87#return; {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {2088#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2089#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:51,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {2089#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2090#|main_#t~short7|} is VALID [2018-11-23 12:19:51,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {2090#|main_#t~short7|} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2078#false} is VALID [2018-11-23 12:19:51,793 INFO L256 TraceCheckUtils]: 33: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2078#false} is VALID [2018-11-23 12:19:51,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2018-11-23 12:19:51,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {2078#false} assume 0 == ~cond; {2078#false} is VALID [2018-11-23 12:19:51,794 INFO L273 TraceCheckUtils]: 36: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2018-11-23 12:19:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:51,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:51,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:51,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:51,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:52,218 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 18 treesize of output 15 [2018-11-23 12:19:52,222 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 15 treesize of output 14 [2018-11-23 12:19:52,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:52,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:52,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:52,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 12:19:52,495 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 26 treesize of output 21 [2018-11-23 12:19:52,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:52,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:52,502 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 21 treesize of output 43 [2018-11-23 12:19:52,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:52,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:52,526 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:19:52,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-23 12:19:52,531 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:52,532 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~j~0]. (let ((.cse0 (select |v_#memory_int_13| |main_~#volArray~0.base|))) (and (<= main_~j~0 1) (<= main_~MINVAL~0 2) (= 2 (select .cse0 (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= |#memory_int| (store |v_#memory_int_13| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12) 0))))) [2018-11-23 12:19:52,532 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0]. (let ((.cse0 (select |#memory_int| |main_~#volArray~0.base|))) (and (= (select .cse0 (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~j~0 1) (<= main_~MINVAL~0 2) (= (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0) (= |main_~#volArray~0.offset| 0))) [2018-11-23 12:19:53,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2018-11-23 12:19:53,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {2077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2077#true} is VALID [2018-11-23 12:19:53,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2018-11-23 12:19:53,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #83#return; {2077#true} is VALID [2018-11-23 12:19:53,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret8 := main(); {2077#true} is VALID [2018-11-23 12:19:53,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {2077#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2077#true} is VALID [2018-11-23 12:19:53,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {2077#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2112#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {2112#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {2116#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {2116#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {2120#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {2120#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2120#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {2120#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2120#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {2120#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2130#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {2130#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2130#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {2130#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2137#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {2137#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2141#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2141#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {2141#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:19:53,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:19:53,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !(~j~0 >= 1); {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:19:53,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:19:53,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:19:53,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {2148#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} ~i~0 := 0; {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} assume #t~short7; {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,104 INFO L256 TraceCheckUtils]: 24: Hoare triple {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-23 12:19:53,105 INFO L273 TraceCheckUtils]: 25: Hoare triple {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} ~cond := #in~cond; {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-23 12:19:53,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} assume !(0 == ~cond); {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-23 12:19:53,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} assume true; {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-23 12:19:53,108 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2174#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} #87#return; {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {2164#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2193#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:19:53,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {2193#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2090#|main_#t~short7|} is VALID [2018-11-23 12:19:53,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {2090#|main_#t~short7|} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2078#false} is VALID [2018-11-23 12:19:53,113 INFO L256 TraceCheckUtils]: 33: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2078#false} is VALID [2018-11-23 12:19:53,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2018-11-23 12:19:53,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {2078#false} assume 0 == ~cond; {2078#false} is VALID [2018-11-23 12:19:53,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2018-11-23 12:19:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:53,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:53,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-11-23 12:19:53,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-11-23 12:19:53,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:53,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:19:53,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:53,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:19:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:19:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:19:53,244 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 24 states. [2018-11-23 12:19:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:59,274 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2018-11-23 12:19:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:19:59,274 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-11-23 12:19:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:19:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 152 transitions. [2018-11-23 12:19:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:19:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 152 transitions. [2018-11-23 12:19:59,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 152 transitions. [2018-11-23 12:19:59,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:59,553 INFO L225 Difference]: With dead ends: 158 [2018-11-23 12:19:59,553 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 12:19:59,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=444, Invalid=2006, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:19:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 12:19:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 68. [2018-11-23 12:19:59,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:59,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 68 states. [2018-11-23 12:19:59,855 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 68 states. [2018-11-23 12:19:59,855 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 68 states. [2018-11-23 12:19:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:59,863 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-11-23 12:19:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-11-23 12:19:59,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:59,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:59,864 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 142 states. [2018-11-23 12:19:59,864 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 142 states. [2018-11-23 12:19:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:59,870 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-11-23 12:19:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-11-23 12:19:59,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:59,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:59,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:59,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:19:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-23 12:19:59,874 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 37 [2018-11-23 12:19:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:59,875 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-23 12:19:59,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:19:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-23 12:19:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:19:59,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:59,876 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:59,876 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:59,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash -763965346, now seen corresponding path program 2 times [2018-11-23 12:19:59,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:59,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:59,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:59,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:59,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:00,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2860#true} is VALID [2018-11-23 12:20:00,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {2860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2860#true} is VALID [2018-11-23 12:20:00,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2018-11-23 12:20:00,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #83#return; {2860#true} is VALID [2018-11-23 12:20:00,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret8 := main(); {2860#true} is VALID [2018-11-23 12:20:00,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {2860#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2860#true} is VALID [2018-11-23 12:20:00,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {2860#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2862#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:20:00,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {2862#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {2863#(and (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:20:00,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {2863#(and (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {2864#(and (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {2864#(and (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2864#(and (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {2864#(and (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2864#(and (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {2864#(and (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2865#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~j~0 2) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {2865#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~j~0 2) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2865#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~j~0 2) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {2865#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~j~0 2) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2865#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~j~0 2) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {2865#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~j~0 2) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2866#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {2866#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2866#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {2866#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2867#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:20:00,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {2867#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2868#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {2868#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~j~0 >= 1); {2868#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-23 12:20:00,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {2868#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2869#(and (<= (* 3 main_~i~0) 6) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} is VALID [2018-11-23 12:20:00,633 INFO L273 TraceCheckUtils]: 20: Hoare triple {2869#(and (<= (* 3 main_~i~0) 6) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {2870#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3))} is VALID [2018-11-23 12:20:00,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {2870#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3))} ~i~0 := 0; {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:00,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:00,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} assume #t~short7; {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:00,655 INFO L256 TraceCheckUtils]: 24: Hoare triple {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2860#true} is VALID [2018-11-23 12:20:00,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {2860#true} ~cond := #in~cond; {2860#true} is VALID [2018-11-23 12:20:00,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {2860#true} assume !(0 == ~cond); {2860#true} is VALID [2018-11-23 12:20:00,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {2860#true} assume true; {2860#true} is VALID [2018-11-23 12:20:00,672 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2860#true} {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} #87#return; {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:00,686 INFO L273 TraceCheckUtils]: 29: Hoare triple {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:00,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {2871#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 2) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 2)) (<= ~CELLCOUNT~0 3) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:00,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:00,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} assume #t~short7; {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:00,703 INFO L256 TraceCheckUtils]: 33: Hoare triple {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2860#true} is VALID [2018-11-23 12:20:00,703 INFO L273 TraceCheckUtils]: 34: Hoare triple {2860#true} ~cond := #in~cond; {2860#true} is VALID [2018-11-23 12:20:00,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {2860#true} assume !(0 == ~cond); {2860#true} is VALID [2018-11-23 12:20:00,704 INFO L273 TraceCheckUtils]: 36: Hoare triple {2860#true} assume true; {2860#true} is VALID [2018-11-23 12:20:00,704 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2860#true} {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} #87#return; {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:00,706 INFO L273 TraceCheckUtils]: 38: Hoare triple {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:00,706 INFO L273 TraceCheckUtils]: 39: Hoare triple {2872#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ main_~i~0 1)) |main_~#volArray~0.offset|))) (<= ~CELLCOUNT~0 (+ main_~i~0 1))) (<= ~CELLCOUNT~0 (+ main_~i~0 2)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2873#(or (<= ~CELLCOUNT~0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:00,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {2873#(or (<= ~CELLCOUNT~0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2874#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:20:00,708 INFO L273 TraceCheckUtils]: 41: Hoare triple {2874#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2875#|main_#t~short7|} is VALID [2018-11-23 12:20:00,709 INFO L256 TraceCheckUtils]: 42: Hoare triple {2875#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2876#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:00,710 INFO L273 TraceCheckUtils]: 43: Hoare triple {2876#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2877#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:00,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {2877#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2861#false} is VALID [2018-11-23 12:20:00,711 INFO L273 TraceCheckUtils]: 45: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2018-11-23 12:20:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:00,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:00,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:20:00,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:20:00,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:20:00,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:20:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:00,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:00,981 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:20:00,985 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:20:00,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:00,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:00,999 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:20:00,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-11-23 12:20:01,002 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:01,002 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, main_~j~0]. (and (<= main_~j~0 1) (= |#memory_int| (store |v_#memory_int_14| |main_~#volArray~0.base| (store (select |v_#memory_int_14| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12) 0))) (<= 1 main_~j~0)) [2018-11-23 12:20:01,002 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0]. (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) [2018-11-23 12:20:09,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2860#true} is VALID [2018-11-23 12:20:09,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {2860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2860#true} is VALID [2018-11-23 12:20:09,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2018-11-23 12:20:09,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #83#return; {2860#true} is VALID [2018-11-23 12:20:09,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret8 := main(); {2860#true} is VALID [2018-11-23 12:20:09,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {2860#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2860#true} is VALID [2018-11-23 12:20:09,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {2860#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2860#true} is VALID [2018-11-23 12:20:09,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {2860#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {2902#(= main_~i~0 1)} is VALID [2018-11-23 12:20:09,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {2902#(= main_~i~0 1)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {2906#(and (<= main_~j~0 3) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {2906#(and (<= main_~j~0 3) (= main_~i~0 1))} assume !!(~j~0 >= 1); {2906#(and (<= main_~j~0 3) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {2906#(and (<= main_~j~0 3) (= main_~i~0 1))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2906#(and (<= main_~j~0 3) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {2906#(and (<= main_~j~0 3) (= main_~i~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2916#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-23 12:20:09,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {2916#(and (= main_~i~0 1) (<= main_~j~0 2))} assume !!(~j~0 >= 1); {2916#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-23 12:20:09,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {2916#(and (= main_~i~0 1) (<= main_~j~0 2))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2916#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-23 12:20:09,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {2916#(and (= main_~i~0 1) (<= main_~j~0 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2926#(and (<= main_~j~0 1) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {2926#(and (<= main_~j~0 1) (= main_~i~0 1))} assume !!(~j~0 >= 1); {2930#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {2930#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} is VALID [2018-11-23 12:20:09,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} is VALID [2018-11-23 12:20:09,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} assume !(~j~0 >= 1); {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} is VALID [2018-11-23 12:20:09,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} is VALID [2018-11-23 12:20:09,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} is VALID [2018-11-23 12:20:09,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {2934#(exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)))} ~i~0 := 0; {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:09,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:09,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} assume #t~short7; {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:09,694 INFO L256 TraceCheckUtils]: 24: Hoare triple {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,694 INFO L273 TraceCheckUtils]: 25: Hoare triple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} ~cond := #in~cond; {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} assume !(0 == ~cond); {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} assume true; {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,696 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} #87#return; {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:09,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:09,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {2950#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} assume #t~short7; {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,702 INFO L256 TraceCheckUtils]: 33: Hoare triple {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} ~cond := #in~cond; {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} assume !(0 == ~cond); {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} assume true; {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} is VALID [2018-11-23 12:20:09,704 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2960#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) main_~j~0) |v_main_~#volArray~0.offset_BEFORE_CALL_2| 12))) (<= main_~j~0 1) (<= 1 main_~j~0)))} {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} #87#return; {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,707 INFO L273 TraceCheckUtils]: 38: Hoare triple {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:09,708 INFO L273 TraceCheckUtils]: 39: Hoare triple {2979#(and (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3007#(and (= main_~i~0 2) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:20:09,709 INFO L273 TraceCheckUtils]: 40: Hoare triple {3007#(and (= main_~i~0 2) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {3007#(and (= main_~i~0 2) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-23 12:20:09,713 INFO L273 TraceCheckUtils]: 41: Hoare triple {3007#(and (= main_~i~0 2) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2875#|main_#t~short7|} is VALID [2018-11-23 12:20:09,713 INFO L256 TraceCheckUtils]: 42: Hoare triple {2875#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3017#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:09,714 INFO L273 TraceCheckUtils]: 43: Hoare triple {3017#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3021#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:09,714 INFO L273 TraceCheckUtils]: 44: Hoare triple {3021#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2861#false} is VALID [2018-11-23 12:20:09,714 INFO L273 TraceCheckUtils]: 45: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2018-11-23 12:20:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:09,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:09,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30 [2018-11-23 12:20:09,741 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-11-23 12:20:09,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:09,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:20:09,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:09,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:20:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:20:09,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=751, Unknown=2, NotChecked=0, Total=870 [2018-11-23 12:20:09,851 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 30 states. [2018-11-23 12:20:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:21,440 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2018-11-23 12:20:21,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:20:21,440 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-11-23 12:20:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:20:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2018-11-23 12:20:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:20:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2018-11-23 12:20:21,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 91 transitions. [2018-11-23 12:20:21,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:21,592 INFO L225 Difference]: With dead ends: 116 [2018-11-23 12:20:21,592 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:20:21,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=363, Invalid=2391, Unknown=2, NotChecked=0, Total=2756 [2018-11-23 12:20:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:20:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2018-11-23 12:20:21,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:21,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 72 states. [2018-11-23 12:20:21,923 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 72 states. [2018-11-23 12:20:21,923 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 72 states. [2018-11-23 12:20:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:21,927 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-11-23 12:20:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-23 12:20:21,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:21,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:21,928 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 83 states. [2018-11-23 12:20:21,928 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 83 states. [2018-11-23 12:20:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:21,930 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-11-23 12:20:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-23 12:20:21,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:21,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:21,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:21,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:20:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-11-23 12:20:21,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 46 [2018-11-23 12:20:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:21,934 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-11-23 12:20:21,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:20:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-11-23 12:20:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:20:21,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:21,935 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:21,935 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:21,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash -786597600, now seen corresponding path program 1 times [2018-11-23 12:20:21,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:21,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:20:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:22,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {3501#true} call ULTIMATE.init(); {3501#true} is VALID [2018-11-23 12:20:22,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {3501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3501#true} is VALID [2018-11-23 12:20:22,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {3501#true} assume true; {3501#true} is VALID [2018-11-23 12:20:22,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3501#true} {3501#true} #83#return; {3501#true} is VALID [2018-11-23 12:20:22,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {3501#true} call #t~ret8 := main(); {3501#true} is VALID [2018-11-23 12:20:22,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {3501#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3501#true} is VALID [2018-11-23 12:20:22,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {3501#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {3503#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:20:22,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {3503#(<= 2 main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {3503#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:20:22,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {3503#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {3504#(<= main_~j~0 (+ main_~MINVAL~0 1))} is VALID [2018-11-23 12:20:22,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {3504#(<= main_~j~0 (+ main_~MINVAL~0 1))} assume !!(~j~0 >= 1); {3504#(<= main_~j~0 (+ main_~MINVAL~0 1))} is VALID [2018-11-23 12:20:22,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {3504#(<= main_~j~0 (+ main_~MINVAL~0 1))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3504#(<= main_~j~0 (+ main_~MINVAL~0 1))} is VALID [2018-11-23 12:20:22,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {3504#(<= main_~j~0 (+ main_~MINVAL~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3505#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-23 12:20:22,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {3505#(<= main_~j~0 main_~MINVAL~0)} assume !!(~j~0 >= 1); {3505#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-23 12:20:22,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {3505#(<= main_~j~0 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3505#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-23 12:20:22,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {3505#(<= main_~j~0 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3506#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:20:22,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {3506#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume !!(~j~0 >= 1); {3506#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:20:22,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {3506#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3502#false} is VALID [2018-11-23 12:20:22,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {3502#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3502#false} is VALID [2018-11-23 12:20:22,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {3502#false} assume !(~j~0 >= 1); {3502#false} is VALID [2018-11-23 12:20:22,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {3502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3502#false} is VALID [2018-11-23 12:20:22,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {3502#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {3502#false} is VALID [2018-11-23 12:20:22,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {3502#false} ~i~0 := 0; {3502#false} is VALID [2018-11-23 12:20:22,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {3502#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {3502#false} is VALID [2018-11-23 12:20:22,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {3502#false} assume #t~short7; {3502#false} is VALID [2018-11-23 12:20:22,131 INFO L256 TraceCheckUtils]: 24: Hoare triple {3502#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3501#true} is VALID [2018-11-23 12:20:22,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {3501#true} ~cond := #in~cond; {3501#true} is VALID [2018-11-23 12:20:22,131 INFO L273 TraceCheckUtils]: 26: Hoare triple {3501#true} assume !(0 == ~cond); {3501#true} is VALID [2018-11-23 12:20:22,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {3501#true} assume true; {3501#true} is VALID [2018-11-23 12:20:22,132 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3501#true} {3502#false} #87#return; {3502#false} is VALID [2018-11-23 12:20:22,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {3502#false} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {3502#false} is VALID [2018-11-23 12:20:22,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {3502#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3502#false} is VALID [2018-11-23 12:20:22,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {3502#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {3502#false} is VALID [2018-11-23 12:20:22,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {3502#false} assume #t~short7; {3502#false} is VALID [2018-11-23 12:20:22,132 INFO L256 TraceCheckUtils]: 33: Hoare triple {3502#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3501#true} is VALID [2018-11-23 12:20:22,132 INFO L273 TraceCheckUtils]: 34: Hoare triple {3501#true} ~cond := #in~cond; {3501#true} is VALID [2018-11-23 12:20:22,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {3501#true} assume !(0 == ~cond); {3501#true} is VALID [2018-11-23 12:20:22,133 INFO L273 TraceCheckUtils]: 36: Hoare triple {3501#true} assume true; {3501#true} is VALID [2018-11-23 12:20:22,133 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3501#true} {3502#false} #87#return; {3502#false} is VALID [2018-11-23 12:20:22,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {3502#false} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {3502#false} is VALID [2018-11-23 12:20:22,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {3502#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3502#false} is VALID [2018-11-23 12:20:22,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {3502#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {3502#false} is VALID [2018-11-23 12:20:22,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {3502#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {3502#false} is VALID [2018-11-23 12:20:22,134 INFO L256 TraceCheckUtils]: 42: Hoare triple {3502#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3502#false} is VALID [2018-11-23 12:20:22,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {3502#false} ~cond := #in~cond; {3502#false} is VALID [2018-11-23 12:20:22,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {3502#false} assume 0 == ~cond; {3502#false} is VALID [2018-11-23 12:20:22,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {3502#false} assume !false; {3502#false} is VALID [2018-11-23 12:20:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:20:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:20:22,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:20:22,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 12:20:22,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:22,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:20:22,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:22,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:20:22,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:20:22,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:20:22,170 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 6 states. [2018-11-23 12:20:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:23,153 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2018-11-23 12:20:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:20:23,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 12:20:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:20:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 12:20:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:20:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 12:20:23,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-23 12:20:23,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:23,226 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:20:23,226 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:20:23,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:20:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:20:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 12:20:23,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:23,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 12:20:23,438 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 12:20:23,439 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 12:20:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:23,441 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 12:20:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 12:20:23,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:23,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:23,442 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 12:20:23,442 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 12:20:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:23,444 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 12:20:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 12:20:23,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:23,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:23,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:23,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:20:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-23 12:20:23,446 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2018-11-23 12:20:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:23,446 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-23 12:20:23,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:20:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-23 12:20:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:20:23,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:23,447 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:23,448 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:23,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1090631198, now seen corresponding path program 3 times [2018-11-23 12:20:23,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:23,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:23,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:24,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {3845#true} call ULTIMATE.init(); {3845#true} is VALID [2018-11-23 12:20:24,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {3845#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3845#true} is VALID [2018-11-23 12:20:24,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {3845#true} assume true; {3845#true} is VALID [2018-11-23 12:20:24,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3845#true} {3845#true} #83#return; {3845#true} is VALID [2018-11-23 12:20:24,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {3845#true} call #t~ret8 := main(); {3845#true} is VALID [2018-11-23 12:20:24,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {3845#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3845#true} is VALID [2018-11-23 12:20:24,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {3845#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {3847#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:20:24,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {3847#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {3848#(and (<= main_~MINVAL~0 2) (= main_~i~0 1))} is VALID [2018-11-23 12:20:24,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {3848#(and (<= main_~MINVAL~0 2) (= main_~i~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {3849#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0))} is VALID [2018-11-23 12:20:24,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {3849#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0))} assume !!(~j~0 >= 1); {3849#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0))} is VALID [2018-11-23 12:20:24,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {3849#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3849#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0))} is VALID [2018-11-23 12:20:24,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {3849#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3850#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:20:24,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {3850#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2))} assume !!(~j~0 >= 1); {3850#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:20:24,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {3850#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3851#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} is VALID [2018-11-23 12:20:24,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {3851#(and (<= 2 main_~j~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3852#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:24,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {3852#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} assume !!(~j~0 >= 1); {3852#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:24,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {3852#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3853#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:24,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {3853#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3853#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:24,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {3853#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} assume !(~j~0 >= 1); {3853#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} is VALID [2018-11-23 12:20:24,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {3853#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3854#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) 5) (* 3 main_~i~0)))} is VALID [2018-11-23 12:20:24,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {3854#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) 5) (* 3 main_~i~0)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {3855#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) main_~j~0 2) (* 3 main_~i~0)))} is VALID [2018-11-23 12:20:24,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {3855#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) main_~j~0 2) (* 3 main_~i~0)))} assume !!(~j~0 >= 1); {3855#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) main_~j~0 2) (* 3 main_~i~0)))} is VALID [2018-11-23 12:20:24,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {3855#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) main_~j~0 2) (* 3 main_~i~0)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3855#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) main_~j~0 2) (* 3 main_~i~0)))} is VALID [2018-11-23 12:20:24,929 INFO L273 TraceCheckUtils]: 23: Hoare triple {3855#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div (+ (+ (* 4 1) |main_~#volArray~0.offset|) (- |main_~#volArray~0.offset|)) 4) main_~j~0 2) (* 3 main_~i~0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3856#(<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:20:24,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {3856#(<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !!(~j~0 >= 1); {3856#(<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:20:24,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {3856#(<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3857#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:20:24,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {3857#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3858#(or (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,933 INFO L273 TraceCheckUtils]: 27: Hoare triple {3858#(or (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !!(~j~0 >= 1); {3858#(or (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {3858#(or (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3859#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4))))} is VALID [2018-11-23 12:20:24,936 INFO L273 TraceCheckUtils]: 29: Hoare triple {3859#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,937 INFO L273 TraceCheckUtils]: 30: Hoare triple {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !(~j~0 >= 1); {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,938 INFO L273 TraceCheckUtils]: 32: Hoare triple {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {3860#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} ~i~0 := 0; {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:24,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:24,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} assume #t~short7; {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:24,941 INFO L256 TraceCheckUtils]: 36: Hoare triple {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3845#true} is VALID [2018-11-23 12:20:24,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {3845#true} ~cond := #in~cond; {3845#true} is VALID [2018-11-23 12:20:24,942 INFO L273 TraceCheckUtils]: 38: Hoare triple {3845#true} assume !(0 == ~cond); {3845#true} is VALID [2018-11-23 12:20:24,942 INFO L273 TraceCheckUtils]: 39: Hoare triple {3845#true} assume true; {3845#true} is VALID [2018-11-23 12:20:24,943 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3845#true} {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} #87#return; {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:24,944 INFO L273 TraceCheckUtils]: 41: Hoare triple {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} is VALID [2018-11-23 12:20:24,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {3861#(and (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3862#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {3862#(or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {3863#(or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:20:24,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {3863#(or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {3864#|main_#t~short7|} is VALID [2018-11-23 12:20:24,947 INFO L256 TraceCheckUtils]: 45: Hoare triple {3864#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3865#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:24,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {3865#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3866#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:24,948 INFO L273 TraceCheckUtils]: 47: Hoare triple {3866#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3846#false} is VALID [2018-11-23 12:20:24,948 INFO L273 TraceCheckUtils]: 48: Hoare triple {3846#false} assume !false; {3846#false} is VALID [2018-11-23 12:20:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:24,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:24,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:20:24,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:20:25,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 12:20:25,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:20:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:25,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:25,314 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:20:25,318 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:20:25,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:25,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:25,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:25,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-23 12:20:25,404 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 31 treesize of output 26 [2018-11-23 12:20:25,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:25,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 43 [2018-11-23 12:20:25,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:20:25,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:20:25,468 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 2 xjuncts. [2018-11-23 12:20:25,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:75 [2018-11-23 12:20:25,473 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:25,473 WARN L384 uantifierElimination]: Input elimination task: ∃ [main_~j~0, |v_#memory_int_16|]. (let ((.cse0 (select |v_#memory_int_16| |main_~#volArray~0.base|)) (.cse1 (* 12 main_~i~0))) (and (<= main_~MINVAL~0 2) (= 2 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (= |#memory_int| (store |v_#memory_int_16| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) main_~j~0)) 0))) (< 1 ~CELLCOUNT~0))) [2018-11-23 12:20:25,473 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0]. (let ((.cse5 (select |#memory_int| |main_~#volArray~0.base|)) (.cse6 (* 12 main_~i~0))) (let ((.cse0 (select .cse5 (+ |main_~#volArray~0.offset| .cse6 (- 8)))) (.cse1 (<= main_~MINVAL~0 2)) (.cse2 (= main_~i~0 1)) (.cse3 (= |main_~#volArray~0.offset| 0)) (.cse4 (= (mod ~CELLCOUNT~0 3) 0)) (.cse7 (< 1 ~CELLCOUNT~0))) (or (and (= .cse0 2) .cse1 .cse2 .cse3 .cse4 (= (select .cse5 (+ |main_~#volArray~0.offset| .cse6 (* (- 4) main_~j~0))) 0) .cse7) (and (= .cse0 0) .cse1 .cse2 .cse3 .cse4 .cse7)))) [2018-11-23 12:20:25,778 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 40 [2018-11-23 12:20:25,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2018-11-23 12:20:25,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:20:25,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:20:25,902 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 57 treesize of output 50 [2018-11-23 12:20:25,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:25,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:25,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 76 [2018-11-23 12:20:25,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-23 12:20:26,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:20:26,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 12:20:26,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:180 [2018-11-23 12:20:26,426 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:26,426 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_7, v_prenex_6, |v_#memory_int_17|]. (let ((.cse4 (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) (.cse0 (<= 2 main_~i~0)) (.cse6 (+ |main_~#volArray~0.offset| 4)) (.cse1 (<= main_~MINVAL~0 2)) (.cse2 (= |main_~#volArray~0.offset| 0)) (.cse5 (= (mod ~CELLCOUNT~0 3) 0)) (.cse7 (< 1 ~CELLCOUNT~0))) (or (let ((.cse3 (select |v_#memory_int_17| |main_~#volArray~0.base|))) (and .cse0 .cse1 .cse2 (= |#memory_int| (store |v_#memory_int_17| |main_~#volArray~0.base| (store .cse3 .cse4 main_~j~0))) .cse5 (= 0 (select .cse3 .cse6)) .cse7)) (let ((.cse8 (select v_prenex_7 |main_~#volArray~0.base|))) (and (= |#memory_int| (store v_prenex_7 |main_~#volArray~0.base| (store .cse8 .cse4 main_~j~0))) .cse0 (= 2 (select .cse8 .cse6)) .cse1 .cse2 .cse5 (= (select .cse8 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_6) 12)) 0) .cse7)))) [2018-11-23 12:20:26,426 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_6]. (let ((.cse10 (select |#memory_int| |main_~#volArray~0.base|)) (.cse9 (+ |main_~#volArray~0.offset| 4))) (let ((.cse8 (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) (.cse7 (select .cse10 .cse9))) (let ((.cse0 (<= 2 main_~i~0)) (.cse1 (= .cse7 2)) (.cse2 (<= main_~MINVAL~0 2)) (.cse3 (= |main_~#volArray~0.offset| 0)) (.cse4 (= main_~j~0 (select .cse10 .cse8))) (.cse5 (= (mod ~CELLCOUNT~0 3) 0)) (.cse6 (< 1 ~CELLCOUNT~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= .cse7 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 (= .cse8 .cse9) .cse5 .cse6) (and .cse0 (= (select .cse10 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_6) 12)) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))))) [2018-11-23 12:20:26,604 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-11-23 12:20:26,857 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 64 treesize of output 57 [2018-11-23 12:20:26,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:26,895 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 64 [2018-11-23 12:20:26,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:20:26,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:20:27,093 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 56 treesize of output 51 [2018-11-23 12:20:27,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 12:20:27,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:27,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:27,236 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 64 treesize of output 57 [2018-11-23 12:20:27,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:27,275 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 64 [2018-11-23 12:20:27,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 12:20:27,326 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:20:27,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 12:20:27,414 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:185, output treesize:173 [2018-11-23 12:20:27,676 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-11-23 12:20:27,858 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 62 treesize of output 55 [2018-11-23 12:20:27,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:27,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:27,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:27,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 87 [2018-11-23 12:20:27,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:20:27,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:20:28,113 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 73 treesize of output 66 [2018-11-23 12:20:28,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:28,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:28,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:28,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 101 [2018-11-23 12:20:28,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 12:20:28,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:20:28,384 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 62 treesize of output 55 [2018-11-23 12:20:28,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:28,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:28,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2018-11-23 12:20:28,404 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:28,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:28,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:20:28,511 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:198, output treesize:186 [2018-11-23 12:20:33,107 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 66 [2018-11-23 12:20:35,797 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-11-23 12:20:35,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {3845#true} call ULTIMATE.init(); {3845#true} is VALID [2018-11-23 12:20:35,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {3845#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3845#true} is VALID [2018-11-23 12:20:35,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {3845#true} assume true; {3845#true} is VALID [2018-11-23 12:20:35,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3845#true} {3845#true} #83#return; {3845#true} is VALID [2018-11-23 12:20:35,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {3845#true} call #t~ret8 := main(); {3845#true} is VALID [2018-11-23 12:20:35,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {3845#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3845#true} is VALID [2018-11-23 12:20:35,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {3845#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {3888#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {3888#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (< 1 ~CELLCOUNT~0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {3892#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {3892#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {3896#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {3896#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} assume !!(~j~0 >= 1); {3896#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {3896#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3896#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {3896#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3906#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {3906#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} assume !!(~j~0 >= 1); {3906#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {3906#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3913#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {3913#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3913#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {3913#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} assume !!(~j~0 >= 1); {3913#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} is VALID [2018-11-23 12:20:35,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {3913#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3923#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {3923#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3923#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {3923#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} assume !(~j~0 >= 1); {3923#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {3923#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3933#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {3933#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (< 1 ~CELLCOUNT~0)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {3933#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {3933#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (< 1 ~CELLCOUNT~0)))} assume !!(~j~0 >= 1); {3933#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {3933#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (< 1 ~CELLCOUNT~0)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3943#(or (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {3943#(or (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (* 12 main_~i~0) (+ (* 4 main_~j~0) 4)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3947#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (exists ((v_main_~j~0_17 Int)) (and (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 12 main_~i~0)))) (<= v_main_~j~0_17 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (<= (* 3 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (exists ((v_prenex_8 Int)) (and (= v_prenex_8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_8) (* 12 main_~i~0)))) (<= v_prenex_8 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {3947#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (exists ((v_main_~j~0_17 Int)) (and (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 12 main_~i~0)))) (<= v_main_~j~0_17 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (<= (* 3 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (exists ((v_prenex_8 Int)) (and (= v_prenex_8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_8) (* 12 main_~i~0)))) (<= v_prenex_8 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} assume !!(~j~0 >= 1); {3947#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (exists ((v_main_~j~0_17 Int)) (and (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 12 main_~i~0)))) (<= v_main_~j~0_17 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (<= (* 3 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (exists ((v_prenex_8 Int)) (and (= v_prenex_8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_8) (* 12 main_~i~0)))) (<= v_prenex_8 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {3947#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (exists ((v_main_~j~0_17 Int)) (and (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 12 main_~i~0)))) (<= v_main_~j~0_17 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (<= (* 3 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (exists ((v_prenex_8 Int)) (and (= v_prenex_8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_8) (* 12 main_~i~0)))) (<= v_prenex_8 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3954#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (<= (* 3 main_~i~0) (+ main_~j~0 2)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {3954#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (<= (* 3 main_~i~0) (+ main_~j~0 2)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3958#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {3958#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} assume !!(~j~0 >= 1); {3958#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {3958#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {3965#(or (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (< 1 ~CELLCOUNT~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)))} is VALID [2018-11-23 12:20:35,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {3965#(or (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (< 1 ~CELLCOUNT~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0))) 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3969#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((v_main_~j~0_19 Int)) (and (<= v_main_~j~0_19 (+ main_~j~0 1)) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19) (- 4)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19))) 0))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (exists ((v_prenex_14 Int)) (and (= (+ v_prenex_14 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14) (- 4)))) (<= v_prenex_14 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14))) 0))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (exists ((v_prenex_13 Int)) (and (= (+ v_prenex_13 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_13) (- 4)))) (<= (* 3 main_~i~0) (+ v_prenex_13 3)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 (+ main_~j~0 1)))) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,989 INFO L273 TraceCheckUtils]: 30: Hoare triple {3969#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((v_main_~j~0_19 Int)) (and (<= v_main_~j~0_19 (+ main_~j~0 1)) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19) (- 4)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19))) 0))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (exists ((v_prenex_14 Int)) (and (= (+ v_prenex_14 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14) (- 4)))) (<= v_prenex_14 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14))) 0))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (* 3 main_~i~0) (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1)) (= (mod ~CELLCOUNT~0 3) 0) (exists ((v_prenex_13 Int)) (and (= (+ v_prenex_13 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_13) (- 4)))) (<= (* 3 main_~i~0) (+ v_prenex_13 3)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 (+ main_~j~0 1)))) (< 1 ~CELLCOUNT~0)))} assume !(~j~0 >= 1); {3973#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((v_main_~j~0_19 Int)) (and (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19) (- 4)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19))) 0) (<= v_main_~j~0_19 1))) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((v_prenex_14 Int)) (and (= (+ v_prenex_14 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14) (- 4)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14))) 0) (<= v_prenex_14 1))) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:35,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {3973#(or (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((v_main_~j~0_19 Int)) (and (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19) (- 4)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_main_~j~0_19))) 0) (<= v_main_~j~0_19 1))) (< 1 ~CELLCOUNT~0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (exists ((v_prenex_14 Int)) (and (= (+ v_prenex_14 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14) (- 4)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) v_prenex_14))) 0) (<= v_prenex_14 1))) (< 1 ~CELLCOUNT~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3977#(or (and (exists ((v_main_~i~0_19 Int) (v_prenex_14 Int)) (and (<= main_~i~0 (+ v_main_~i~0_19 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_main_~i~0_19) (* (- 4) v_prenex_14) (- 4))) (+ v_prenex_14 1)) (<= v_prenex_14 1) (<= 2 v_main_~i~0_19) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_main_~i~0_19) (* (- 4) v_prenex_14)))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= main_~i~0 (+ v_prenex_17 1)) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (<= v_main_~j~0_19 1))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} is VALID [2018-11-23 12:20:36,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {3977#(or (and (exists ((v_main_~i~0_19 Int) (v_prenex_14 Int)) (and (<= main_~i~0 (+ v_main_~i~0_19 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_main_~i~0_19) (* (- 4) v_prenex_14) (- 4))) (+ v_prenex_14 1)) (<= v_prenex_14 1) (<= 2 v_main_~i~0_19) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_main_~i~0_19) (* (- 4) v_prenex_14)))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= main_~i~0 (+ v_prenex_17 1)) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (<= v_main_~j~0_19 1))) (= |main_~#volArray~0.offset| 0) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {3981#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1))))))} is VALID [2018-11-23 12:20:36,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {3981#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1))))))} ~i~0 := 0; {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} is VALID [2018-11-23 12:20:36,023 INFO L273 TraceCheckUtils]: 34: Hoare triple {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} is VALID [2018-11-23 12:20:36,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} assume #t~short7; {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} is VALID [2018-11-23 12:20:36,038 INFO L256 TraceCheckUtils]: 36: Hoare triple {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} is VALID [2018-11-23 12:20:36,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} ~cond := #in~cond; {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} is VALID [2018-11-23 12:20:36,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} assume !(0 == ~cond); {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} is VALID [2018-11-23 12:20:36,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} assume true; {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} is VALID [2018-11-23 12:20:36,040 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3995#(or (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (v_prenex_32 Int) (~CELLCOUNT~0 Int)) (and (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (= (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19))) 0) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (mod ~CELLCOUNT~0 3) 0) (= (select (select |#memory_int| v_prenex_32) 4) 0) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| v_prenex_32) (+ (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_4| Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (= (+ v_prenex_23 1) (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20) (- 4)))) (<= 2 v_prenex_20) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) 4) 2) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_4|) (+ (* (- 4) v_prenex_23) (* 12 v_prenex_20))) 0) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20))))} {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} #87#return; {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} is VALID [2018-11-23 12:20:36,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} havoc #t~mem6;havoc #t~mem5;havoc #t~short7; {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} is VALID [2018-11-23 12:20:36,045 INFO L273 TraceCheckUtils]: 42: Hoare triple {3985#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1)))) (= main_~i~0 0)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4014#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1))))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))))} is VALID [2018-11-23 12:20:36,047 INFO L273 TraceCheckUtils]: 43: Hoare triple {4014#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1))))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {4018#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and |main_#t~short7| (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1))))))} is VALID [2018-11-23 12:20:36,049 INFO L273 TraceCheckUtils]: 44: Hoare triple {4018#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_17 Int) (v_main_~j~0_19 Int) (~CELLCOUNT~0 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19)))) (<= 2 v_prenex_17) (<= (div ~CELLCOUNT~0 3) v_prenex_17) (<= (+ (div ~CELLCOUNT~0 3) 1) v_prenex_17) (= (+ v_main_~j~0_19 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_17) (* (- 4) v_main_~j~0_19) (- 4)))) (= (mod ~CELLCOUNT~0 3) 0) (< 1 ~CELLCOUNT~0) (<= v_main_~j~0_19 1)))) (and |main_#t~short7| (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_20 Int)) (and (= (mod v_prenex_25 3) 0) (<= 2 v_prenex_20) (<= 0 v_prenex_25) (< 1 v_prenex_25) (<= v_prenex_23 1) (<= (div v_prenex_25 3) v_prenex_20) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 v_prenex_20) (* (- 4) v_prenex_23) (- 4))) (+ v_prenex_23 1))))))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {3864#|main_#t~short7|} is VALID [2018-11-23 12:20:36,050 INFO L256 TraceCheckUtils]: 45: Hoare triple {3864#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {4025#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:36,051 INFO L273 TraceCheckUtils]: 46: Hoare triple {4025#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4029#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:36,051 INFO L273 TraceCheckUtils]: 47: Hoare triple {4029#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3846#false} is VALID [2018-11-23 12:20:36,052 INFO L273 TraceCheckUtils]: 48: Hoare triple {3846#false} assume !false; {3846#false} is VALID [2018-11-23 12:20:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:36,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:36,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2018-11-23 12:20:36,100 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2018-11-23 12:20:36,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:36,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:20:36,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:36,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:20:36,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:20:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1676, Unknown=2, NotChecked=0, Total=1892 [2018-11-23 12:20:36,550 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 44 states. [2018-11-23 12:20:43,558 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-23 12:20:43,849 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2018-11-23 12:20:44,393 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2018-11-23 12:20:52,181 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 74 [2018-11-23 12:20:57,305 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2018-11-23 12:21:07,302 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2018-11-23 12:21:15,739 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-23 12:21:20,256 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-23 12:21:29,224 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2018-11-23 12:21:37,468 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2018-11-23 12:21:51,016 WARN L180 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2018-11-23 12:22:04,135 WARN L180 SmtUtils]: Spent 12.73 s on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2018-11-23 12:22:12,873 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-11-23 12:22:20,619 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2018-11-23 12:22:26,982 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-11-23 12:22:37,439 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2018-11-23 12:22:54,211 WARN L180 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-11-23 12:22:56,131 WARN L180 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-11-23 12:23:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:06,557 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2018-11-23 12:23:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:23:06,557 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2018-11-23 12:23:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:23:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 141 transitions. [2018-11-23 12:23:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:23:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 141 transitions. [2018-11-23 12:23:06,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 141 transitions.