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/pnr3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:19:55,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:19:55,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:19:55,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:19:55,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:19:55,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:19:55,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:19:55,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:19:55,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:19:55,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:19:55,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:19:55,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:19:55,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:19:55,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:19:55,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:19:55,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:19:55,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:19:55,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:19:55,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:19:55,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:19:55,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:19:55,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:19:55,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:19:55,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:19:55,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:19:55,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:19:55,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:19:55,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:19:55,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:19:55,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:19:55,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:19:55,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:19:55,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:19:55,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:19:55,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:19:55,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:19:55,399 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:55,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:19:55,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:19:55,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:19:55,416 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:19:55,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:19:55,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:19:55,417 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:19:55,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:19:55,417 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:19:55,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:19:55,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:19:55,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:19:55,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:19:55,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:19:55,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:19:55,418 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:19:55,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:19:55,419 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:19:55,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:19:55,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:19:55,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:19:55,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:19:55,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:19:55,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:19:55,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:19:55,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:19:55,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:19:55,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:19:55,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:19:55,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:19:55,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:19:55,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:19:55,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:19:55,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:19:55,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:19:55,484 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:19:55,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr3_true-unreach-call.i [2018-11-23 12:19:55,546 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86fd852/cab36300fbb146dd91f29be340c0fc39/FLAG6c171643c [2018-11-23 12:19:56,028 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:19:56,028 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr3_true-unreach-call.i [2018-11-23 12:19:56,036 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86fd852/cab36300fbb146dd91f29be340c0fc39/FLAG6c171643c [2018-11-23 12:19:56,380 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86fd852/cab36300fbb146dd91f29be340c0fc39 [2018-11-23 12:19:56,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:19:56,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:19:56,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:56,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:19:56,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:19:56,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:56" (1/1) ... [2018-11-23 12:19:56,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:56, skipping insertion in model container [2018-11-23 12:19:56,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:56" (1/1) ... [2018-11-23 12:19:56,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:19:56,444 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:19:56,672 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:56,677 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:19:56,717 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:56,745 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:19:56,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:56 WrapperNode [2018-11-23 12:19:56,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:56,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:56,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:19:56,747 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:19:56,758 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:56" (1/1) ... [2018-11-23 12:19:56,769 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:56" (1/1) ... [2018-11-23 12:19:56,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:56,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:19:56,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:19:56,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:19:56,789 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:56" (1/1) ... [2018-11-23 12:19:56,789 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:56" (1/1) ... [2018-11-23 12:19:56,792 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:56" (1/1) ... [2018-11-23 12:19:56,792 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:56" (1/1) ... [2018-11-23 12:19:56,804 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:56" (1/1) ... [2018-11-23 12:19:56,811 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:56" (1/1) ... [2018-11-23 12:19:56,813 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:56" (1/1) ... [2018-11-23 12:19:56,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:19:56,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:19:56,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:19:56,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:19:56,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:56" (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:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:19:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:19:56,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:19:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:19:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-23 12:19:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:19:56,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:19:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:19:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:19:56,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:19:56,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:19:56,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:19:56,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:19:57,719 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:19:57,720 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:19:57,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:57 BoogieIcfgContainer [2018-11-23 12:19:57,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:19:57,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:19:57,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:19:57,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:19:57,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:19:56" (1/3) ... [2018-11-23 12:19:57,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5948669f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:57, skipping insertion in model container [2018-11-23 12:19:57,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:56" (2/3) ... [2018-11-23 12:19:57,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5948669f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:57, skipping insertion in model container [2018-11-23 12:19:57,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:57" (3/3) ... [2018-11-23 12:19:57,730 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr3_true-unreach-call.i [2018-11-23 12:19:57,741 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:19:57,750 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:19:57,768 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:19:57,802 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:19:57,803 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:19:57,803 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:19:57,803 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:19:57,804 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:19:57,804 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:19:57,804 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:19:57,804 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:19:57,804 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:19:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:19:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:19:57,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:57,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:57,841 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:57,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1717917651, now seen corresponding path program 1 times [2018-11-23 12:19:57,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:57,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:57,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:58,444 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-11-23 12:19:58,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:19:58,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {35#true} is VALID [2018-11-23 12:19:58,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:19:58,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #79#return; {35#true} is VALID [2018-11-23 12:19:58,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2018-11-23 12:19:58,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {35#true} is VALID [2018-11-23 12:19:58,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {37#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:19:58,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {38#(and (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:19:58,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#(and (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (<= 2 ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {36#false} is VALID [2018-11-23 12:19:58,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:19:58,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36#false} is VALID [2018-11-23 12:19:58,462 INFO L256 TraceCheckUtils]: 11: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {36#false} is VALID [2018-11-23 12:19:58,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-23 12:19:58,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2018-11-23 12:19:58,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:19:58,465 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:58,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:58,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:58,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:19:58,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:58,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:58,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:58,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:58,595 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-11-23 12:19:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:59,154 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 12:19:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:59,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:19:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:19:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:19:59,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 12:19:59,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:59,629 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:19:59,629 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:19:59,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:19:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-23 12:19:59,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:59,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 27 states. [2018-11-23 12:19:59,700 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 27 states. [2018-11-23 12:19:59,700 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 27 states. [2018-11-23 12:19:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:59,705 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 12:19:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 12:19:59,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:59,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:59,706 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 33 states. [2018-11-23 12:19:59,706 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 33 states. [2018-11-23 12:19:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:59,711 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 12:19:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 12:19:59,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:59,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:59,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:59,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:19:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:19:59,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2018-11-23 12:19:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:59,722 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:19:59,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:19:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:59,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:59,724 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:59,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:59,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash -200071319, now seen corresponding path program 1 times [2018-11-23 12:19:59,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:00,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 12:20:00,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {216#true} is VALID [2018-11-23 12:20:00,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 12:20:00,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #79#return; {216#true} is VALID [2018-11-23 12:20:00,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret8 := main(); {216#true} is VALID [2018-11-23 12:20:00,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {216#true} is VALID [2018-11-23 12:20:00,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {216#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {218#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:00,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {219#(and (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:00,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {219#(and (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {220#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:00,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {220#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:00,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:00,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:00,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:01,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:01,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {222#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (<= (+ (* 12 main_~i~0) (* 6 ~SIZE~0) |main_~#a~0.offset|) (+ (* 18 (div ~SIZE~0 3)) 23)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:01,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {222#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (<= (+ (* 12 main_~i~0) (* 6 ~SIZE~0) |main_~#a~0.offset|) (+ (* 18 (div ~SIZE~0 3)) 23)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:01,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {224#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:01,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {224#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {225#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:20:01,069 INFO L256 TraceCheckUtils]: 18: Hoare triple {225#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {226#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:01,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {226#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {227#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:01,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {227#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {217#false} is VALID [2018-11-23 12:20:01,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 12:20:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:01,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:01,076 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:20:01,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:01,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:01,316 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:01,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:01,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 12:20:01,351 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:01,352 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~value~0]. (and (= |#memory_int| (store |v_#memory_int_16| |main_~#a~0.base| (store (select |v_#memory_int_16| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0))) (not (= main_~value~0 main_~DEFAULTVAL~0)) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:01,352 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:01,491 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 38 treesize of output 33 [2018-11-23 12:20:01,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:01,523 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 25 treesize of output 40 [2018-11-23 12:20:01,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:20 [2018-11-23 12:20:01,572 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:01,572 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~FIXEDVAL~0]. (let ((.cse1 (* 12 main_~i~0))) (let ((.cse0 (store (select |v_#memory_int_17| |main_~#a~0.base|) (+ .cse1 |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0))) (and (not (= main_~DEFAULTVAL~0 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12))))) (= main_~i~0 1) (= |#memory_int| (store |v_#memory_int_17| |main_~#a~0.base| .cse0)) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:20:01,572 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:01,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:20:01,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:01,914 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 17 treesize of output 24 [2018-11-23 12:20:01,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:01,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:12 [2018-11-23 12:20:01,985 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:01,985 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, main_~value~0, main_~FIXEDVAL~0]. (let ((.cse0 (select |v_#memory_int_18| |main_~#a~0.base|))) (and (= (store |v_#memory_int_18| |main_~#a~0.base| (store .cse0 (+ |main_~#a~0.offset| 8) main_~value~0)) |#memory_int|) (not (= (select (store .cse0 (+ |main_~#a~0.offset| 4) main_~FIXEDVAL~0) |main_~#a~0.offset|) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))) [2018-11-23 12:20:01,985 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:02,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 12 [2018-11-23 12:20:02,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 12:20:02,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:02,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:02,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:02,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 12:20:02,076 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:02,076 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (= .cse0 |main_#t~mem7|) (not (= .cse0 main_~DEFAULTVAL~0)))) [2018-11-23 12:20:02,076 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) [2018-11-23 12:20:02,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 12:20:02,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {216#true} is VALID [2018-11-23 12:20:02,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 12:20:02,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #79#return; {216#true} is VALID [2018-11-23 12:20:02,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret8 := main(); {216#true} is VALID [2018-11-23 12:20:02,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {216#true} is VALID [2018-11-23 12:20:02,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {216#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {249#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:20:02,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {249#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {220#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {220#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {220#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {220#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,137 INFO L273 TraceCheckUtils]: 14: Hoare triple {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {223#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {224#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:02,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {224#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {225#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:20:02,141 INFO L256 TraceCheckUtils]: 18: Hoare triple {225#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {286#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:02,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {286#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {290#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:02,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {290#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {217#false} is VALID [2018-11-23 12:20:02,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 12:20:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:02,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:02,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2018-11-23 12:20:02,174 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 12:20:02,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:02,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:20:02,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:02,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:20:02,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:20:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:20:02,225 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 15 states. [2018-11-23 12:20:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:04,039 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2018-11-23 12:20:04,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:20:04,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 12:20:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:20:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-23 12:20:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:20:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-23 12:20:04,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 84 transitions. [2018-11-23 12:20:04,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:04,205 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:20:04,205 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:20:04,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:20:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:20:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2018-11-23 12:20:04,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:04,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 41 states. [2018-11-23 12:20:04,263 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 41 states. [2018-11-23 12:20:04,264 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 41 states. [2018-11-23 12:20:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:04,271 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2018-11-23 12:20:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-11-23 12:20:04,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:04,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:04,273 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 66 states. [2018-11-23 12:20:04,273 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 66 states. [2018-11-23 12:20:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:04,279 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2018-11-23 12:20:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-11-23 12:20:04,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:04,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:04,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:04,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:20:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:20:04,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 22 [2018-11-23 12:20:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:04,288 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:20:04,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:20:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:20:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:20:04,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:04,289 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:20:04,290 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:04,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash -786877333, now seen corresponding path program 1 times [2018-11-23 12:20:04,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:04,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:04,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:04,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:04,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:05,754 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 16 [2018-11-23 12:20:06,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-23 12:20:06,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {585#true} is VALID [2018-11-23 12:20:06,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-23 12:20:06,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #79#return; {585#true} is VALID [2018-11-23 12:20:06,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret8 := main(); {585#true} is VALID [2018-11-23 12:20:06,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {585#true} is VALID [2018-11-23 12:20:06,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {587#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {587#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {588#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (or (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (<= 0 ~SIZE~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {588#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (or (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (<= 0 ~SIZE~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {589#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {590#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {590#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {590#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {590#(and (not (= main_~FIXEDVAL~0 0)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {591#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {591#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {591#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {591#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {591#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {591#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= 12 (+ (* 12 main_~i~0) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {592#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (and (<= (+ (* 12 main_~i~0) (* 6 ~SIZE~0) |main_~#a~0.offset|) (+ (* 18 (div ~SIZE~0 3)) 23)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {592#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (and (<= (+ (* 12 main_~i~0) (* 6 ~SIZE~0) |main_~#a~0.offset|) (+ (* 18 (div ~SIZE~0 3)) 23)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {593#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {593#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) 0) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {594#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:06,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {594#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {595#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:06,030 INFO L256 TraceCheckUtils]: 18: Hoare triple {595#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {596#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:06,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {596#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {597#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:06,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {597#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {586#false} is VALID [2018-11-23 12:20:06,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-23 12:20:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:06,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:06,035 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:20:06,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:06,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:06,377 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:06,383 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:06,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 12:20:06,543 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 38 treesize of output 31 [2018-11-23 12:20:06,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:06,551 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 0 case distinctions, treesize of input 31 treesize of output 48 [2018-11-23 12:20:06,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-23 12:20:06,680 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 34 treesize of output 25 [2018-11-23 12:20:06,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:06,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:06,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:06,693 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 0 case distinctions, treesize of input 25 treesize of output 50 [2018-11-23 12:20:06,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2018-11-23 12:20:06,721 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:06,721 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, main_~value~0]. (let ((.cse1 (select |v_#memory_int_21| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 |main_~#a~0.offset|))) (and (= .cse0 (select .cse1 (+ |main_~#a~0.offset| 4))) (<= 10 .cse0) (= |#memory_int| (store |v_#memory_int_21| |main_~#a~0.base| (store .cse1 (+ |main_~#a~0.offset| 8) main_~value~0))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:06,722 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 |main_~#a~0.offset|))) (and (<= 10 .cse0) (= (select .cse1 (+ |main_~#a~0.offset| 4)) .cse0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:06,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 [2018-11-23 12:20:06,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 12:20:06,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:06,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2018-11-23 12:20:06,848 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:06,848 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (<= 10 .cse1) (<= .cse1 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0)))) [2018-11-23 12:20:06,848 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:06,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-23 12:20:06,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {585#true} is VALID [2018-11-23 12:20:06,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-23 12:20:06,913 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #79#return; {585#true} is VALID [2018-11-23 12:20:06,913 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret8 := main(); {585#true} is VALID [2018-11-23 12:20:06,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {585#true} is VALID [2018-11-23 12:20:06,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {619#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {619#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {623#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {623#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {623#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {623#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {630#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {630#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {637#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {637#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {637#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {637#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {644#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {644#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {644#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {644#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {644#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {644#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {654#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {654#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {658#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:06,927 INFO L256 TraceCheckUtils]: 18: Hoare triple {658#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {662#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:06,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {662#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {666#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:06,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {666#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {586#false} is VALID [2018-11-23 12:20:06,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-23 12:20:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:06,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:06,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-23 12:20:06,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-11-23 12:20:06,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:06,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:20:06,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:06,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:20:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:20:07,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:20:07,000 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 22 states. [2018-11-23 12:20:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:10,592 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-11-23 12:20:10,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:20:10,592 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-11-23 12:20:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:20:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 86 transitions. [2018-11-23 12:20:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:20:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 86 transitions. [2018-11-23 12:20:10,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 86 transitions. [2018-11-23 12:20:10,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:10,781 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:20:10,782 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:20:10,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:20:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:20:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2018-11-23 12:20:10,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:10,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 59 states. [2018-11-23 12:20:10,941 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 59 states. [2018-11-23 12:20:10,941 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 59 states. [2018-11-23 12:20:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:10,947 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 12:20:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2018-11-23 12:20:10,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:10,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:10,949 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 82 states. [2018-11-23 12:20:10,949 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 82 states. [2018-11-23 12:20:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:10,955 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 12:20:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2018-11-23 12:20:10,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:10,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:10,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:10,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:20:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-11-23 12:20:10,964 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 22 [2018-11-23 12:20:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:10,964 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-23 12:20:10,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:20:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2018-11-23 12:20:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:20:10,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:10,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:10,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:10,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2002732516, now seen corresponding path program 1 times [2018-11-23 12:20:10,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:10,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:10,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:12,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2018-11-23 12:20:12,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {1051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1051#true} is VALID [2018-11-23 12:20:12,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {1051#true} assume true; {1051#true} is VALID [2018-11-23 12:20:12,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} #79#return; {1051#true} is VALID [2018-11-23 12:20:12,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {1051#true} call #t~ret8 := main(); {1051#true} is VALID [2018-11-23 12:20:12,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {1051#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1051#true} is VALID [2018-11-23 12:20:12,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {1051#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {1053#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:20:12,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {1053#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} is VALID [2018-11-23 12:20:12,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} is VALID [2018-11-23 12:20:12,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} is VALID [2018-11-23 12:20:12,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} is VALID [2018-11-23 12:20:12,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {1054#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (= ~SIZE~0 (* 3 (div ~SIZE~0 3))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {1055#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3))))} is VALID [2018-11-23 12:20:12,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {1055#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {1055#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3))))} is VALID [2018-11-23 12:20:12,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {1055#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {1055#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3))))} is VALID [2018-11-23 12:20:12,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {1055#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1056#(and (<= (div (+ (* 6 main_~i~0) (* (- 9) (div ~SIZE~0 3)) (* 3 ~SIZE~0) (- 5)) 2) 3) (or (<= (div (+ (* 6 main_~i~0) (* (- 9) (div ~SIZE~0 3)) (* 3 ~SIZE~0) (- 5)) 2) 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (div (+ (* 6 main_~i~0) (* (- 9) (div ~SIZE~0 3)) (* 3 ~SIZE~0) (- 5)) 2)) |main_~#a~0.offset| (- 8)))))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} is VALID [2018-11-23 12:20:12,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {1056#(and (<= (div (+ (* 6 main_~i~0) (* (- 9) (div ~SIZE~0 3)) (* 3 ~SIZE~0) (- 5)) 2) 3) (or (<= (div (+ (* 6 main_~i~0) (* (- 9) (div ~SIZE~0 3)) (* 3 ~SIZE~0) (- 5)) 2) 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (div (+ (* 6 main_~i~0) (* (- 9) (div ~SIZE~0 3)) (* 3 ~SIZE~0) (- 5)) 2)) |main_~#a~0.offset| (- 8)))))) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {1057#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} is VALID [2018-11-23 12:20:12,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {1057#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0))} ~i~0 := 0; {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:20:12,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:20:12,043 INFO L256 TraceCheckUtils]: 18: Hoare triple {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1051#true} is VALID [2018-11-23 12:20:12,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {1051#true} ~cond := #in~cond; {1051#true} is VALID [2018-11-23 12:20:12,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {1051#true} assume !(0 == ~cond); {1051#true} is VALID [2018-11-23 12:20:12,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {1051#true} assume true; {1051#true} is VALID [2018-11-23 12:20:12,061 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1051#true} {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} #83#return; {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:20:12,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} havoc #t~mem7; {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:20:12,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {1058#(and (<= (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2) 3) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (div (+ (* 3 ~SIZE~0) (+ (* (- 3) (div ~SIZE~0 3)) 1)) 2)) (- 8)))) main_~DEFAULTVAL~0)) (< (+ (div ~SIZE~0 3) 1) ~SIZE~0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1059#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:12,070 INFO L273 TraceCheckUtils]: 25: Hoare triple {1059#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1060#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:12,071 INFO L256 TraceCheckUtils]: 26: Hoare triple {1060#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1061#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:12,071 INFO L273 TraceCheckUtils]: 27: Hoare triple {1061#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1062#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:12,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {1062#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1052#false} is VALID [2018-11-23 12:20:12,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2018-11-23 12:20:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:12,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:12,077 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:20:12,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:12,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:12,267 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:12,272 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:12,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-23 12:20:12,300 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:12,301 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, main_~FIXEDVAL~0]. (and (= |#memory_int| (store |v_#memory_int_22| |main_~#a~0.base| (store (select |v_#memory_int_22| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0))) (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:12,301 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:12,360 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 23 treesize of output 18 [2018-11-23 12:20:12,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:12,368 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 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 12:20:12,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-23 12:20:12,394 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:12,395 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_23| |main_~#a~0.base|))) (and (= |#memory_int| (store |v_#memory_int_23| |main_~#a~0.base| (store .cse0 (+ |main_~#a~0.offset| 8) main_~value~0))) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:12,395 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:12,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 12:20:12,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-23 12:20:12,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:20:12,829 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:12,830 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 4))) (and (<= .cse0 |main_#t~mem7|) (<= 10 .cse0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:12,830 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:12,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2018-11-23 12:20:12,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {1051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1051#true} is VALID [2018-11-23 12:20:12,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {1051#true} assume true; {1051#true} is VALID [2018-11-23 12:20:12,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} #79#return; {1051#true} is VALID [2018-11-23 12:20:12,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {1051#true} call #t~ret8 := main(); {1051#true} is VALID [2018-11-23 12:20:12,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {1051#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1051#true} is VALID [2018-11-23 12:20:12,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {1051#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {1084#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {1084#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {1088#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {1101#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {1101#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {1101#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {1101#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {1108#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {1108#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1108#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {1108#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {1108#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {1108#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,964 INFO L256 TraceCheckUtils]: 18: Hoare triple {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:12,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} ~cond := #in~cond; {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:12,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} assume !(0 == ~cond); {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:12,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} assume true; {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:20:12,967 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1125#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #83#return; {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem7; {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {1118#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1101#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1147#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:12,973 INFO L256 TraceCheckUtils]: 26: Hoare triple {1147#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1151#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:12,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {1151#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1155#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:12,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {1155#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1052#false} is VALID [2018-11-23 12:20:12,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2018-11-23 12:20:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:12,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:12,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-23 12:20:12,997 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-23 12:20:12,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:12,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:20:13,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:13,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:20:13,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:20:13,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:20:13,200 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 21 states. [2018-11-23 12:20:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:26,242 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2018-11-23 12:20:26,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:20:26,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-23 12:20:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:20:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2018-11-23 12:20:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:20:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2018-11-23 12:20:26,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 144 transitions. [2018-11-23 12:20:26,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:26,536 INFO L225 Difference]: With dead ends: 188 [2018-11-23 12:20:26,536 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 12:20:26,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:20:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 12:20:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 65. [2018-11-23 12:20:26,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:26,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 65 states. [2018-11-23 12:20:26,857 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 65 states. [2018-11-23 12:20:26,857 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 65 states. [2018-11-23 12:20:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:26,867 INFO L93 Difference]: Finished difference Result 186 states and 232 transitions. [2018-11-23 12:20:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 232 transitions. [2018-11-23 12:20:26,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:26,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:26,869 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 186 states. [2018-11-23 12:20:26,869 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 186 states. [2018-11-23 12:20:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:26,879 INFO L93 Difference]: Finished difference Result 186 states and 232 transitions. [2018-11-23 12:20:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 232 transitions. [2018-11-23 12:20:26,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:26,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:26,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:26,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:20:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-23 12:20:26,884 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 30 [2018-11-23 12:20:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:26,884 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-23 12:20:26,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:20:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-23 12:20:26,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:20:26,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:26,886 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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:26,886 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:26,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash -212473393, now seen corresponding path program 2 times [2018-11-23 12:20:26,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:26,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:27,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {1910#true} call ULTIMATE.init(); {1910#true} is VALID [2018-11-23 12:20:27,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {1910#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1910#true} is VALID [2018-11-23 12:20:27,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {1910#true} assume true; {1910#true} is VALID [2018-11-23 12:20:27,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1910#true} {1910#true} #79#return; {1910#true} is VALID [2018-11-23 12:20:27,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {1910#true} call #t~ret8 := main(); {1910#true} is VALID [2018-11-23 12:20:27,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {1910#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1910#true} is VALID [2018-11-23 12:20:27,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {1910#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {1912#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:20:27,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {1912#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {1913#(and (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:27,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {1913#(and (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:27,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:27,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:27,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:27,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:27,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {1915#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4))))) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:27,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {1915#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4))))) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1916#(and (or (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 5)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))) (or (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 6)) (and (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 9)) (< ~SIZE~0 0))))} is VALID [2018-11-23 12:20:27,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {1916#(and (or (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 5)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))) (or (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 6)) (and (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 9)) (< ~SIZE~0 0))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {1917#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} is VALID [2018-11-23 12:20:27,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {1917#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} ~i~0 := 0; {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:27,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:27,522 INFO L256 TraceCheckUtils]: 18: Hoare triple {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1910#true} is VALID [2018-11-23 12:20:27,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2018-11-23 12:20:27,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2018-11-23 12:20:27,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {1910#true} assume true; {1910#true} is VALID [2018-11-23 12:20:27,525 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1910#true} {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #83#return; {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:27,526 INFO L273 TraceCheckUtils]: 23: Hoare triple {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} havoc #t~mem7; {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:27,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {1918#(and (or (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:27,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:27,529 INFO L256 TraceCheckUtils]: 26: Hoare triple {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1910#true} is VALID [2018-11-23 12:20:27,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2018-11-23 12:20:27,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2018-11-23 12:20:27,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {1910#true} assume true; {1910#true} is VALID [2018-11-23 12:20:27,531 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1910#true} {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} #83#return; {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:27,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} havoc #t~mem7; {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} is VALID [2018-11-23 12:20:27,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {1919#(and (or (<= ~SIZE~0 (+ main_~i~0 1)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))) (<= ~SIZE~0 (+ main_~i~0 2)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1920#(or (<= ~SIZE~0 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))} is VALID [2018-11-23 12:20:27,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {1920#(or (<= ~SIZE~0 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1921#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:20:27,536 INFO L256 TraceCheckUtils]: 34: Hoare triple {1921#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1922#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:27,537 INFO L273 TraceCheckUtils]: 35: Hoare triple {1922#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1923#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:27,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {1923#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1911#false} is VALID [2018-11-23 12:20:27,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {1911#false} assume !false; {1911#false} is VALID [2018-11-23 12:20:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:27,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:27,546 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:20:27,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:20:27,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:20:27,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:20:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:27,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:27,901 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 13 treesize of output 10 [2018-11-23 12:20:27,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 12:20:27,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:27,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:27,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:27,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-23 12:20:27,933 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:27,933 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= |#memory_int| (store |v_#memory_int_24| |main_~#a~0.base| (store (select |v_#memory_int_24| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8) main_~value~0))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:27,933 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:20:28,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 12 [2018-11-23 12:20:28,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 12:20:28,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:28,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:28,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:28,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 12:20:28,402 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:28,402 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 8))) (and (= .cse0 |main_#t~mem7|) (not (= main_~DEFAULTVAL~0 .cse0)))) [2018-11-23 12:20:28,402 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) [2018-11-23 12:20:28,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {1910#true} call ULTIMATE.init(); {1910#true} is VALID [2018-11-23 12:20:28,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {1910#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1910#true} is VALID [2018-11-23 12:20:28,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {1910#true} assume true; {1910#true} is VALID [2018-11-23 12:20:28,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1910#true} {1910#true} #79#return; {1910#true} is VALID [2018-11-23 12:20:28,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {1910#true} call #t~ret8 := main(); {1910#true} is VALID [2018-11-23 12:20:28,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {1910#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1910#true} is VALID [2018-11-23 12:20:28,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {1910#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {1945#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:20:28,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {1945#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {1949#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {1968#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1968#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1968#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {1968#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {1968#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {1968#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,471 INFO L256 TraceCheckUtils]: 18: Hoare triple {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1910#true} is VALID [2018-11-23 12:20:28,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2018-11-23 12:20:28,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2018-11-23 12:20:28,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {1910#true} assume true; {1910#true} is VALID [2018-11-23 12:20:28,473 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1910#true} {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #83#return; {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {1978#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,477 INFO L256 TraceCheckUtils]: 26: Hoare triple {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {1910#true} is VALID [2018-11-23 12:20:28,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2018-11-23 12:20:28,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2018-11-23 12:20:28,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {1910#true} assume true; {1910#true} is VALID [2018-11-23 12:20:28,509 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1910#true} {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} #83#return; {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {2003#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2028#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:28,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {2028#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1921#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:20:28,518 INFO L256 TraceCheckUtils]: 34: Hoare triple {1921#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {2035#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:28,518 INFO L273 TraceCheckUtils]: 35: Hoare triple {2035#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2039#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:28,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {2039#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1911#false} is VALID [2018-11-23 12:20:28,520 INFO L273 TraceCheckUtils]: 37: Hoare triple {1911#false} assume !false; {1911#false} is VALID [2018-11-23 12:20:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:20:28,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:28,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2018-11-23 12:20:28,544 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-11-23 12:20:28,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:28,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:20:28,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:28,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:20:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:20:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:20:28,622 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 22 states. [2018-11-23 12:20:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:33,315 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2018-11-23 12:20:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:20:33,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-11-23 12:20:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:20:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2018-11-23 12:20:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:20:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2018-11-23 12:20:33,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 120 transitions. [2018-11-23 12:20:33,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:33,530 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:20:33,530 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:20:33,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=325, Invalid=1655, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:20:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:20:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2018-11-23 12:20:34,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:34,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 117 states. [2018-11-23 12:20:34,017 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 117 states. [2018-11-23 12:20:34,017 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 117 states. [2018-11-23 12:20:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:34,022 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2018-11-23 12:20:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2018-11-23 12:20:34,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:34,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:34,023 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 128 states. [2018-11-23 12:20:34,023 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 128 states. [2018-11-23 12:20:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:34,029 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2018-11-23 12:20:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2018-11-23 12:20:34,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:34,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:34,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:34,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:20:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2018-11-23 12:20:34,036 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 38 [2018-11-23 12:20:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:34,036 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2018-11-23 12:20:34,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:20:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2018-11-23 12:20:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:20:34,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:34,037 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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:34,038 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:34,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash -841070524, now seen corresponding path program 1 times [2018-11-23 12:20:34,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:34,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:34,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:20:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:34,538 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-11-23 12:20:35,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {2701#true} call ULTIMATE.init(); {2701#true} is VALID [2018-11-23 12:20:35,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {2701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2701#true} is VALID [2018-11-23 12:20:35,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2018-11-23 12:20:35,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2701#true} #79#return; {2701#true} is VALID [2018-11-23 12:20:35,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {2701#true} call #t~ret8 := main(); {2701#true} is VALID [2018-11-23 12:20:35,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {2701#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2701#true} is VALID [2018-11-23 12:20:35,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {2701#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {2703#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:35,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {2703#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:35,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:35,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:35,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:35,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {2704#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {2705#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)))} is VALID [2018-11-23 12:20:35,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {2705#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {2705#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)))} is VALID [2018-11-23 12:20:35,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {2705#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {2705#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)))} is VALID [2018-11-23 12:20:35,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {2705#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~DEFAULTVAL~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2706#(or (and (or (<= (div ~SIZE~0 3) 1) (< main_~i~0 (div ~SIZE~0 3))) (or (<= 2 main_~i~0) (< 1 (div ~SIZE~0 3)))) (and (not (= (* 12 main_~i~0) 12)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))))} is VALID [2018-11-23 12:20:35,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {2706#(or (and (or (<= (div ~SIZE~0 3) 1) (< main_~i~0 (div ~SIZE~0 3))) (or (<= 2 main_~i~0) (< 1 (div ~SIZE~0 3)))) (and (not (= (* 12 main_~i~0) 12)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2707#(or (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))) (and (not (= (* 12 main_~i~0) 12)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))))} is VALID [2018-11-23 12:20:35,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {2707#(or (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))) (and (not (= (* 12 main_~i~0) 12)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {2707#(or (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))) (and (not (= (* 12 main_~i~0) 12)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))))} is VALID [2018-11-23 12:20:35,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {2707#(or (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))) (and (not (= (* 12 main_~i~0) 12)) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {2708#(or (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)))} is VALID [2018-11-23 12:20:35,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {2708#(or (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))) (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~value~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {2709#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))))} is VALID [2018-11-23 12:20:35,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {2709#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {2709#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))))} is VALID [2018-11-23 12:20:35,926 INFO L273 TraceCheckUtils]: 20: Hoare triple {2709#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {2709#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))))} is VALID [2018-11-23 12:20:35,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {2709#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (< main_~i~0 (div ~SIZE~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2710#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (<= main_~i~0 (div ~SIZE~0 3))))} is VALID [2018-11-23 12:20:35,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {2710#(or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (and (< 1 (div ~SIZE~0 3)) (<= main_~i~0 (div ~SIZE~0 3))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {2711#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:35,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {2711#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0))} ~i~0 := 0; {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:35,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:35,928 INFO L256 TraceCheckUtils]: 25: Hoare triple {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {2701#true} is VALID [2018-11-23 12:20:35,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {2701#true} ~cond := #in~cond; {2701#true} is VALID [2018-11-23 12:20:35,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {2701#true} assume !(0 == ~cond); {2701#true} is VALID [2018-11-23 12:20:35,929 INFO L273 TraceCheckUtils]: 28: Hoare triple {2701#true} assume true; {2701#true} is VALID [2018-11-23 12:20:35,930 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2701#true} {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} #83#return; {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:35,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} havoc #t~mem7; {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:35,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {2712#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 8)))) main_~DEFAULTVAL~0)) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2713#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:35,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {2713#(not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2714#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:35,934 INFO L256 TraceCheckUtils]: 33: Hoare triple {2714#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {2715#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:20:35,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {2715#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2716#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:35,935 INFO L273 TraceCheckUtils]: 35: Hoare triple {2716#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2702#false} is VALID [2018-11-23 12:20:35,936 INFO L273 TraceCheckUtils]: 36: Hoare triple {2702#false} assume !false; {2702#false} is VALID [2018-11-23 12:20:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:35,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:35,942 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:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:36,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:36,163 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:36,166 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:36,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-23 12:20:36,188 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:36,189 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|, main_~FIXEDVAL~0]. (and (= main_~i~0 1) (= (store |v_#memory_int_25| |main_~#a~0.base| (store (select |v_#memory_int_25| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0)) |#memory_int|) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:36,189 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:36,232 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 29 treesize of output 24 [2018-11-23 12:20:36,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:36,240 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 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-23 12:20:36,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 12:20:36,276 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:36,277 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_26| |main_~#a~0.base|)) (.cse1 (* 12 main_~i~0))) (and (= (store |v_#memory_int_26| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 4)) main_~value~0)) |#memory_int|) (= main_~i~0 1) (<= 10 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:36,277 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:36,334 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:20:36,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:36,342 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 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 12:20:36,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-23 12:20:36,367 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:36,367 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_27| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= |#memory_int| (store |v_#memory_int_27| |main_~#a~0.base| (store .cse0 (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:36,367 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:36,444 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:20:36,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:36,452 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 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 12:20:36,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-23 12:20:36,477 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:36,477 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_28| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= (store |v_#memory_int_28| |main_~#a~0.base| (store .cse0 (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:36,477 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:36,498 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:20:36,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:36,520 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 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 12:20:36,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2018-11-23 12:20:36,544 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:36,544 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, main_~i~0, main_~value~0]. (let ((.cse0 (select |v_#memory_int_29| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (= (store |v_#memory_int_29| |main_~#a~0.base| (store .cse0 (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)) main_~value~0)) |#memory_int|) (<= 10 (select .cse0 (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:36,544 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:36,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 12:20:36,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-23 12:20:36,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:36,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:20:36,745 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:36,745 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 4))) (and (<= .cse0 |main_#t~mem7|) (<= 10 .cse0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:20:36,745 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:20:36,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {2701#true} call ULTIMATE.init(); {2701#true} is VALID [2018-11-23 12:20:36,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {2701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2701#true} is VALID [2018-11-23 12:20:36,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2018-11-23 12:20:36,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2701#true} #79#return; {2701#true} is VALID [2018-11-23 12:20:36,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {2701#true} call #t~ret8 := main(); {2701#true} is VALID [2018-11-23 12:20:36,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {2701#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2701#true} is VALID [2018-11-23 12:20:36,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {2701#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {2738#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {2738#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {2742#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {2765#(and (<= 2 main_~i~0) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {2784#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {2784#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2784#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {2784#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {2784#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {2784#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,835 INFO L256 TraceCheckUtils]: 25: Hoare triple {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} is VALID [2018-11-23 12:20:36,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} ~cond := #in~cond; {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} is VALID [2018-11-23 12:20:36,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} assume !(0 == ~cond); {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} is VALID [2018-11-23 12:20:36,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} assume true; {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} is VALID [2018-11-23 12:20:36,838 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 4)))} {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #83#return; {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem7; {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {2794#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {2755#(and (= main_~i~0 1) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2823#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:20:36,843 INFO L256 TraceCheckUtils]: 33: Hoare triple {2823#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {2827#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:36,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {2827#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2831#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:36,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {2831#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2702#false} is VALID [2018-11-23 12:20:36,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {2702#false} assume !false; {2702#false} is VALID [2018-11-23 12:20:36,849 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:20:36,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:36,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-11-23 12:20:36,871 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-11-23 12:20:36,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:36,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:20:36,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:36,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:20:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:20:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:20:36,955 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand 26 states. [2018-11-23 12:20:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:41,953 INFO L93 Difference]: Finished difference Result 213 states and 261 transitions. [2018-11-23 12:20:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:20:41,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-11-23 12:20:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:20:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2018-11-23 12:20:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:20:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2018-11-23 12:20:41,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2018-11-23 12:20:42,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:42,142 INFO L225 Difference]: With dead ends: 213 [2018-11-23 12:20:42,142 INFO L226 Difference]: Without dead ends: 211 [2018-11-23 12:20:42,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=337, Invalid=1643, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:20:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-23 12:20:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 113. [2018-11-23 12:20:42,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:42,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 113 states. [2018-11-23 12:20:42,742 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 113 states. [2018-11-23 12:20:42,743 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 113 states. [2018-11-23 12:20:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:42,752 INFO L93 Difference]: Finished difference Result 211 states and 258 transitions. [2018-11-23 12:20:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 258 transitions. [2018-11-23 12:20:42,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:42,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:42,753 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 211 states. [2018-11-23 12:20:42,753 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 211 states. [2018-11-23 12:20:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:42,762 INFO L93 Difference]: Finished difference Result 211 states and 258 transitions. [2018-11-23 12:20:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 258 transitions. [2018-11-23 12:20:42,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:42,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:42,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:42,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:20:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2018-11-23 12:20:42,768 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 37 [2018-11-23 12:20:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:42,768 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2018-11-23 12:20:42,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:20:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2018-11-23 12:20:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:20:42,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:42,770 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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:42,770 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:42,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash -71924783, now seen corresponding path program 1 times [2018-11-23 12:20:42,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:42,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:42,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:42,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:42,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:43,409 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2018-11-23 12:20:43,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {3721#true} call ULTIMATE.init(); {3721#true} is VALID [2018-11-23 12:20:43,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {3721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3721#true} is VALID [2018-11-23 12:20:43,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {3721#true} assume true; {3721#true} is VALID [2018-11-23 12:20:43,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3721#true} {3721#true} #79#return; {3721#true} is VALID [2018-11-23 12:20:43,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {3721#true} call #t~ret8 := main(); {3721#true} is VALID [2018-11-23 12:20:43,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {3721#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3721#true} is VALID [2018-11-23 12:20:43,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {3721#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {3723#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:20:43,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {3723#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {3724#(and (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (= main_~i~0 1))} is VALID [2018-11-23 12:20:43,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {3724#(and (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {3725#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:43,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {3725#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {3725#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:43,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {3725#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {3725#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:43,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {3725#(and (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {3726#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:43,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {3726#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {3726#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:43,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {3726#(and (= main_~i~0 1) (= main_~FIXEDVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {3727#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:20:43,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {3727#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)))) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3728#(and (or (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 5)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) (* (- 12) (div ~SIZE~0 3)) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 20))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) (* (- 12) (div ~SIZE~0 3)) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 16))))) (or (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 6)) (and (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 9)) (< ~SIZE~0 0))))} is VALID [2018-11-23 12:20:43,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {3728#(and (or (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 5)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) (* (- 12) (div ~SIZE~0 3)) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 20))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) (* (- 12) (div ~SIZE~0 3)) (* 4 ~SIZE~0) |main_~#a~0.offset| (- 16))))) (or (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 6)) (and (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 9)) (< ~SIZE~0 0))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {3729#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} is VALID [2018-11-23 12:20:43,931 INFO L273 TraceCheckUtils]: 16: Hoare triple {3729#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} ~i~0 := 0; {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:43,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:43,932 INFO L256 TraceCheckUtils]: 18: Hoare triple {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {3721#true} is VALID [2018-11-23 12:20:43,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2018-11-23 12:20:43,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2018-11-23 12:20:43,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {3721#true} assume true; {3721#true} is VALID [2018-11-23 12:20:43,933 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3721#true} {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #83#return; {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:43,934 INFO L273 TraceCheckUtils]: 23: Hoare triple {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} havoc #t~mem7; {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:20:43,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {3730#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 ~SIZE~0) (- 8))))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} is VALID [2018-11-23 12:20:43,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {3731#(or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3732#(or (and (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} is VALID [2018-11-23 12:20:43,935 INFO L256 TraceCheckUtils]: 26: Hoare triple {3732#(or (and (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {3721#true} is VALID [2018-11-23 12:20:43,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {3721#true} ~cond := #in~cond; {3733#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:20:43,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {3733#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {3734#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:20:43,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {3734#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3734#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:20:43,939 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3734#(not (= |__VERIFIER_assert_#in~cond| 0))} {3732#(or (and (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} #83#return; {3735#(or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} is VALID [2018-11-23 12:20:43,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {3735#(or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} havoc #t~mem7; {3735#(or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} is VALID [2018-11-23 12:20:43,941 INFO L273 TraceCheckUtils]: 32: Hoare triple {3735#(or (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 2))) (<= ~SIZE~0 (+ main_~i~0 1)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3736#(or (<= ~SIZE~0 main_~i~0) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0)))} is VALID [2018-11-23 12:20:43,941 INFO L273 TraceCheckUtils]: 33: Hoare triple {3736#(or (<= ~SIZE~0 main_~i~0) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0)))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3737#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:43,942 INFO L256 TraceCheckUtils]: 34: Hoare triple {3737#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {3734#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:20:43,943 INFO L273 TraceCheckUtils]: 35: Hoare triple {3734#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3738#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:43,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {3738#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3722#false} is VALID [2018-11-23 12:20:43,944 INFO L273 TraceCheckUtils]: 37: Hoare triple {3722#false} assume !false; {3722#false} is VALID [2018-11-23 12:20:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:20:43,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:20:43,952 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:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:44,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:44,129 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:44,132 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:44,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:20:44,187 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 19 treesize of output 14 [2018-11-23 12:20:44,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:44,192 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 0 case distinctions, treesize of input 14 treesize of output 24 [2018-11-23 12:20:44,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:20:44,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 12:20:44,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 4 [2018-11-23 12:20:44,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:44,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:4 [2018-11-23 12:20:44,707 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:44,707 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse2 4)) (.cse1 (select .cse2 8))) (and (not (= .cse0 main_~DEFAULTVAL~0)) (= .cse1 |main_#t~mem7|) (= .cse0 .cse1)))) [2018-11-23 12:20:44,708 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) [2018-11-23 12:20:44,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {3721#true} call ULTIMATE.init(); {3721#true} is VALID [2018-11-23 12:20:44,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {3721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3721#true} is VALID [2018-11-23 12:20:44,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {3721#true} assume true; {3721#true} is VALID [2018-11-23 12:20:44,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3721#true} {3721#true} #79#return; {3721#true} is VALID [2018-11-23 12:20:44,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {3721#true} call #t~ret8 := main(); {3721#true} is VALID [2018-11-23 12:20:44,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {3721#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3721#true} is VALID [2018-11-23 12:20:44,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {3721#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {3760#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:20:44,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {3760#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {3764#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {3777#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {3777#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {3777#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {3777#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {3784#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {3784#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3784#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {3784#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {3784#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {3784#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,792 INFO L256 TraceCheckUtils]: 18: Hoare triple {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} is VALID [2018-11-23 12:20:44,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} ~cond := #in~cond; {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} is VALID [2018-11-23 12:20:44,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} assume !(0 == ~cond); {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} is VALID [2018-11-23 12:20:44,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} assume true; {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} is VALID [2018-11-23 12:20:44,795 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #83#return; {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {3794#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3820#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {3820#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3824#(and (= main_~i~0 1) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,799 INFO L256 TraceCheckUtils]: 26: Hoare triple {3824#(and (= main_~i~0 1) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} is VALID [2018-11-23 12:20:44,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {3801#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))} ~cond := #in~cond; {3831#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:20:44,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {3831#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {3835#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} is VALID [2018-11-23 12:20:44,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {3835#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} assume true; {3835#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} is VALID [2018-11-23 12:20:44,805 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3835#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} {3824#(and (= main_~i~0 1) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #83#return; {3842#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {3842#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {3842#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,807 INFO L273 TraceCheckUtils]: 32: Hoare triple {3842#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3849#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:20:44,823 INFO L273 TraceCheckUtils]: 33: Hoare triple {3849#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3737#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:20:44,824 INFO L256 TraceCheckUtils]: 34: Hoare triple {3737#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {3856#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:44,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {3856#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3860#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:44,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {3860#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3722#false} is VALID [2018-11-23 12:20:44,825 INFO L273 TraceCheckUtils]: 37: Hoare triple {3722#false} assume !false; {3722#false} is VALID [2018-11-23 12:20:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:20:44,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:20:44,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-11-23 12:20:44,848 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-11-23 12:20:44,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:44,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:20:44,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:44,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:20:44,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:20:44,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:20:44,937 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand 32 states. [2018-11-23 12:21:22,411 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2018-11-23 12:21:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:22,990 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2018-11-23 12:21:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:21:22,990 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-11-23 12:21:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:21:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 90 transitions. [2018-11-23 12:21:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:21:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 90 transitions. [2018-11-23 12:21:22,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 90 transitions. [2018-11-23 12:21:23,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:23,196 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:21:23,196 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 12:21:23,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=502, Invalid=3158, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:21:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 12:21:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2018-11-23 12:21:23,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:23,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 115 states. [2018-11-23 12:21:23,787 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 115 states. [2018-11-23 12:21:23,787 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 115 states. [2018-11-23 12:21:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:23,792 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2018-11-23 12:21:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 157 transitions. [2018-11-23 12:21:23,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:23,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:23,793 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 123 states. [2018-11-23 12:21:23,793 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 123 states. [2018-11-23 12:21:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:23,798 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2018-11-23 12:21:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 157 transitions. [2018-11-23 12:21:23,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:23,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:23,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:23,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:21:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2018-11-23 12:21:23,803 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 38 [2018-11-23 12:21:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:23,803 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2018-11-23 12:21:23,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:21:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2018-11-23 12:21:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:21:23,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:23,805 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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:21:23,805 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:23,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1995152817, now seen corresponding path program 1 times [2018-11-23 12:21:23,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:23,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:23,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:23,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:24,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {4523#true} call ULTIMATE.init(); {4523#true} is VALID [2018-11-23 12:21:24,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {4523#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4523#true} is VALID [2018-11-23 12:21:24,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {4523#true} assume true; {4523#true} is VALID [2018-11-23 12:21:24,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4523#true} {4523#true} #79#return; {4523#true} is VALID [2018-11-23 12:21:24,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {4523#true} call #t~ret8 := main(); {4523#true} is VALID [2018-11-23 12:21:24,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {4523#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4523#true} is VALID [2018-11-23 12:21:24,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {4523#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {4525#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:21:24,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {4525#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (<= 2 ~SIZE~0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {4526#(and (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} is VALID [2018-11-23 12:21:24,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {4526#(and (= (* 3 (div ~SIZE~0 3)) ~SIZE~0) (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:21:24,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:21:24,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:21:24,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:21:24,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:21:24,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {4527#(and (not (= main_~FIXEDVAL~0 0)) (= 0 main_~DEFAULTVAL~0) (= main_~i~0 1) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {4528#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4))) main_~DEFAULTVAL~0)) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} is VALID [2018-11-23 12:21:24,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {4528#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4))) main_~DEFAULTVAL~0)) (or (< ~SIZE~0 0) (<= ~SIZE~0 (* 3 (div ~SIZE~0 3)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4529#(and (or (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 6)) (and (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 9)) (< ~SIZE~0 0))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 5))))} is VALID [2018-11-23 12:21:24,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {4529#(and (or (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 6)) (and (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 9)) (< ~SIZE~0 0))) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (not (= (* 3 (div ~SIZE~0 3)) ~SIZE~0)) (<= (+ (* 3 main_~i~0) ~SIZE~0) (+ (* 3 (div ~SIZE~0 3)) 5))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {4530#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} is VALID [2018-11-23 12:21:24,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {4530#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} ~i~0 := 0; {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:21:24,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:21:24,607 INFO L256 TraceCheckUtils]: 18: Hoare triple {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {4523#true} is VALID [2018-11-23 12:21:24,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {4523#true} ~cond := #in~cond; {4523#true} is VALID [2018-11-23 12:21:24,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {4523#true} assume !(0 == ~cond); {4523#true} is VALID [2018-11-23 12:21:24,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {4523#true} assume true; {4523#true} is VALID [2018-11-23 12:21:24,609 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {4523#true} {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #83#return; {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:21:24,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} havoc #t~mem7; {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:21:24,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {4531#(and (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:21:24,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:21:24,612 INFO L256 TraceCheckUtils]: 26: Hoare triple {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {4523#true} is VALID [2018-11-23 12:21:24,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {4523#true} ~cond := #in~cond; {4523#true} is VALID [2018-11-23 12:21:24,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {4523#true} assume !(0 == ~cond); {4523#true} is VALID [2018-11-23 12:21:24,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {4523#true} assume true; {4523#true} is VALID [2018-11-23 12:21:24,614 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {4523#true} {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} #83#return; {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:21:24,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} havoc #t~mem7; {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:21:24,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {4532#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4)))) main_~DEFAULTVAL~0)) (<= ~SIZE~0 (+ main_~i~0 1))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4533#(or (<= ~SIZE~0 main_~i~0) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0)))} is VALID [2018-11-23 12:21:24,617 INFO L273 TraceCheckUtils]: 33: Hoare triple {4533#(or (<= ~SIZE~0 main_~i~0) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~DEFAULTVAL~0)))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4534#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} is VALID [2018-11-23 12:21:24,617 INFO L256 TraceCheckUtils]: 34: Hoare triple {4534#(not (= |main_#t~mem7| main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {4535#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:21:24,618 INFO L273 TraceCheckUtils]: 35: Hoare triple {4535#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4536#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:21:24,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {4536#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4524#false} is VALID [2018-11-23 12:21:24,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {4524#false} assume !false; {4524#false} is VALID [2018-11-23 12:21:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:21:24,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:24,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:24,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:24,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:24,817 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 13 treesize of output 10 [2018-11-23 12:21:24,820 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 10 treesize of output 9 [2018-11-23 12:21:24,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-23 12:21:24,838 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:24,838 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, main_~FIXEDVAL~0]. (and (= (store |v_#memory_int_32| |main_~#a~0.base| (store (select |v_#memory_int_32| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8) main_~FIXEDVAL~0)) |#memory_int|) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:21:24,839 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:21:25,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 12:21:25,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-23 12:21:25,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:21:25,171 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:25,171 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 8))) (and (<= .cse0 |main_#t~mem7|) (<= 10 .cse0) (<= main_~DEFAULTVAL~0 0))) [2018-11-23 12:21:25,172 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0)) [2018-11-23 12:21:25,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {4523#true} call ULTIMATE.init(); {4523#true} is VALID [2018-11-23 12:21:25,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {4523#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4523#true} is VALID [2018-11-23 12:21:25,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {4523#true} assume true; {4523#true} is VALID [2018-11-23 12:21:25,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4523#true} {4523#true} #79#return; {4523#true} is VALID [2018-11-23 12:21:25,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {4523#true} call #t~ret8 := main(); {4523#true} is VALID [2018-11-23 12:21:25,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {4523#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4523#true} is VALID [2018-11-23 12:21:25,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {4523#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {4558#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {4558#(and (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {4562#(and (= main_~i~0 1) (<= 10 main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {4581#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {4581#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4581#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {4581#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {4581#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {4581#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} ~i~0 := 0; {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,271 INFO L256 TraceCheckUtils]: 18: Hoare triple {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} ~cond := #in~cond; {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} assume !(0 == ~cond); {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} assume true; {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,278 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #83#return; {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem7; {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {4591#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,281 INFO L256 TraceCheckUtils]: 26: Hoare triple {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} ~cond := #in~cond; {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} assume !(0 == ~cond); {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} assume true; {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} is VALID [2018-11-23 12:21:25,284 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {4598#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (<= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 8)))} {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #83#return; {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,285 INFO L273 TraceCheckUtils]: 31: Hoare triple {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} havoc #t~mem7; {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,286 INFO L273 TraceCheckUtils]: 32: Hoare triple {4617#(and (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4642#(and (= main_~i~0 2) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,287 INFO L273 TraceCheckUtils]: 33: Hoare triple {4642#(and (= main_~i~0 2) (<= 10 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0) (<= main_~DEFAULTVAL~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4646#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} is VALID [2018-11-23 12:21:25,288 INFO L256 TraceCheckUtils]: 34: Hoare triple {4646#(and (<= 10 |main_#t~mem7|) (<= main_~DEFAULTVAL~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {4650#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:25,289 INFO L273 TraceCheckUtils]: 35: Hoare triple {4650#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4654#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:21:25,289 INFO L273 TraceCheckUtils]: 36: Hoare triple {4654#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4524#false} is VALID [2018-11-23 12:21:25,289 INFO L273 TraceCheckUtils]: 37: Hoare triple {4524#false} assume !false; {4524#false} is VALID [2018-11-23 12:21:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:21:25,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-23 12:21:25,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2018-11-23 12:21:25,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:25,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:21:25,398 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:21:25,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:21:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:21:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:21:25,399 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand 24 states. [2018-11-23 12:21:39,530 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-11-23 12:21:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:41,953 INFO L93 Difference]: Finished difference Result 205 states and 252 transitions. [2018-11-23 12:21:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:21:41,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2018-11-23 12:21:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:21:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 130 transitions. [2018-11-23 12:21:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:21:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 130 transitions. [2018-11-23 12:21:41,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 130 transitions. [2018-11-23 12:21:42,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:42,620 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:21:42,620 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 12:21:42,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=359, Invalid=1897, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:21:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 12:21:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 104. [2018-11-23 12:21:43,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:43,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 104 states. [2018-11-23 12:21:43,700 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 104 states. [2018-11-23 12:21:43,700 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 104 states. [2018-11-23 12:21:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,707 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2018-11-23 12:21:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2018-11-23 12:21:43,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:43,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:43,708 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 182 states. [2018-11-23 12:21:43,708 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 182 states. [2018-11-23 12:21:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,714 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2018-11-23 12:21:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2018-11-23 12:21:43,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:43,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:43,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:43,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:21:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2018-11-23 12:21:43,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 38 [2018-11-23 12:21:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:43,718 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2018-11-23 12:21:43,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:21:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2018-11-23 12:21:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:21:43,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:43,719 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:43,720 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:43,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash -505187284, now seen corresponding path program 3 times [2018-11-23 12:21:43,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:43,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:43,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:44,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {5474#true} call ULTIMATE.init(); {5474#true} is VALID [2018-11-23 12:21:44,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {5474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {5474#true} is VALID [2018-11-23 12:21:44,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:44,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5474#true} {5474#true} #79#return; {5474#true} is VALID [2018-11-23 12:21:44,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {5474#true} call #t~ret8 := main(); {5474#true} is VALID [2018-11-23 12:21:44,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {5474#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5474#true} is VALID [2018-11-23 12:21:44,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {5474#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {5474#true} is VALID [2018-11-23 12:21:44,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {5474#true} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {5476#(= main_~i~0 1)} is VALID [2018-11-23 12:21:44,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {5476#(= main_~i~0 1)} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {5476#(= main_~i~0 1)} is VALID [2018-11-23 12:21:44,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {5476#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {5476#(= main_~i~0 1)} is VALID [2018-11-23 12:21:44,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {5476#(= main_~i~0 1)} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {5476#(= main_~i~0 1)} is VALID [2018-11-23 12:21:44,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {5476#(= main_~i~0 1)} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {5476#(= main_~i~0 1)} is VALID [2018-11-23 12:21:44,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {5476#(= main_~i~0 1)} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {5476#(= main_~i~0 1)} is VALID [2018-11-23 12:21:44,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {5476#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {5476#(= main_~i~0 1)} is VALID [2018-11-23 12:21:44,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {5476#(= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5477#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:21:44,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {5477#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {5477#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:21:44,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {5477#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} is VALID [2018-11-23 12:21:44,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} is VALID [2018-11-23 12:21:44,072 INFO L273 TraceCheckUtils]: 18: Hoare triple {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} is VALID [2018-11-23 12:21:44,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} is VALID [2018-11-23 12:21:44,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} is VALID [2018-11-23 12:21:44,077 INFO L273 TraceCheckUtils]: 21: Hoare triple {5478#(and (<= 2 main_~i~0) (<= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5479#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12))))))} is VALID [2018-11-23 12:21:44,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {5479#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12))))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {5479#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12))))))} is VALID [2018-11-23 12:21:44,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {5479#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12))))))} ~i~0 := 0; {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:44,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:44,079 INFO L256 TraceCheckUtils]: 25: Hoare triple {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5474#true} is VALID [2018-11-23 12:21:44,079 INFO L273 TraceCheckUtils]: 26: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2018-11-23 12:21:44,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2018-11-23 12:21:44,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:44,080 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {5474#true} {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} #83#return; {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:44,081 INFO L273 TraceCheckUtils]: 30: Hoare triple {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} havoc #t~mem7; {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:44,082 INFO L273 TraceCheckUtils]: 31: Hoare triple {5480#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 6) (- 12)))))) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} is VALID [2018-11-23 12:21:44,083 INFO L273 TraceCheckUtils]: 32: Hoare triple {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} is VALID [2018-11-23 12:21:44,083 INFO L256 TraceCheckUtils]: 33: Hoare triple {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5474#true} is VALID [2018-11-23 12:21:44,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2018-11-23 12:21:44,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2018-11-23 12:21:44,083 INFO L273 TraceCheckUtils]: 36: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:44,084 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {5474#true} {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} #83#return; {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} is VALID [2018-11-23 12:21:44,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} havoc #t~mem7; {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} is VALID [2018-11-23 12:21:44,085 INFO L273 TraceCheckUtils]: 39: Hoare triple {5481#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 5)) (- 12))))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} is VALID [2018-11-23 12:21:44,085 INFO L273 TraceCheckUtils]: 40: Hoare triple {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} is VALID [2018-11-23 12:21:44,086 INFO L256 TraceCheckUtils]: 41: Hoare triple {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5474#true} is VALID [2018-11-23 12:21:44,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2018-11-23 12:21:44,086 INFO L273 TraceCheckUtils]: 43: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2018-11-23 12:21:44,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:44,087 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5474#true} {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} #83#return; {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} is VALID [2018-11-23 12:21:44,088 INFO L273 TraceCheckUtils]: 46: Hoare triple {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} havoc #t~mem7; {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} is VALID [2018-11-23 12:21:44,090 INFO L273 TraceCheckUtils]: 47: Hoare triple {5482#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 4)) (- 12))))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5483#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))} is VALID [2018-11-23 12:21:44,090 INFO L273 TraceCheckUtils]: 48: Hoare triple {5483#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5484#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:21:44,091 INFO L256 TraceCheckUtils]: 49: Hoare triple {5484#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5485#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:21:44,091 INFO L273 TraceCheckUtils]: 50: Hoare triple {5485#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5486#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:21:44,092 INFO L273 TraceCheckUtils]: 51: Hoare triple {5486#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5475#false} is VALID [2018-11-23 12:21:44,092 INFO L273 TraceCheckUtils]: 52: Hoare triple {5475#false} assume !false; {5475#false} is VALID [2018-11-23 12:21:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:21:44,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:44,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:44,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:21:44,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:21:44,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:21:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:44,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:44,270 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:21:44,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:21:44,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 12:21:44,296 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:44,297 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_33|, main_~value~0]. (and (= main_~i~0 2) (not (= main_~value~0 main_~DEFAULTVAL~0)) (= (store |v_#memory_int_33| |main_~#a~0.base| (store (select |v_#memory_int_33| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:44,297 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:44,347 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 30 treesize of output 25 [2018-11-23 12:21:44,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:44,356 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 25 treesize of output 40 [2018-11-23 12:21:44,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-23 12:21:44,385 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:44,385 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, main_~FIXEDVAL~0]. (let ((.cse0 (select |v_#memory_int_34| |main_~#a~0.base|)) (.cse1 (* 12 main_~i~0))) (and (= main_~i~0 2) (not (= (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 12))) main_~DEFAULTVAL~0)) (= (store |v_#memory_int_34| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)) main_~FIXEDVAL~0)) |#memory_int|) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:44,385 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:44,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 12:21:44,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:44,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-23 12:21:44,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-23 12:21:44,451 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:44,451 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_35| |main_~#a~0.base|))) (and (= (store |v_#memory_int_35| |main_~#a~0.base| (store .cse0 (+ |main_~#a~0.offset| 20) main_~value~0)) |#memory_int|) (not (= (select .cse0 (+ |main_~#a~0.offset| 12)) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:44,451 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:44,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 12 [2018-11-23 12:21:44,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 12:21:44,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:44,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 12:21:44,938 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:44,938 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 12))) (and (= .cse0 |main_#t~mem7|) (not (= .cse0 main_~DEFAULTVAL~0)))) [2018-11-23 12:21:44,939 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) [2018-11-23 12:21:44,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {5474#true} call ULTIMATE.init(); {5474#true} is VALID [2018-11-23 12:21:44,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {5474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {5474#true} is VALID [2018-11-23 12:21:44,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:44,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5474#true} {5474#true} #79#return; {5474#true} is VALID [2018-11-23 12:21:44,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {5474#true} call #t~ret8 := main(); {5474#true} is VALID [2018-11-23 12:21:44,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {5474#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5474#true} is VALID [2018-11-23 12:21:44,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {5474#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {5508#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:21:44,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {5508#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {5512#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5534#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {5534#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {5534#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {5534#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,992 INFO L273 TraceCheckUtils]: 19: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {5554#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {5554#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5554#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {5554#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {5554#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {5554#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,997 INFO L256 TraceCheckUtils]: 25: Hoare triple {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5474#true} is VALID [2018-11-23 12:21:44,997 INFO L273 TraceCheckUtils]: 26: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2018-11-23 12:21:44,997 INFO L273 TraceCheckUtils]: 27: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2018-11-23 12:21:44,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:44,998 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {5474#true} {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #83#return; {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:44,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {5564#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,001 INFO L256 TraceCheckUtils]: 33: Hoare triple {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5474#true} is VALID [2018-11-23 12:21:45,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2018-11-23 12:21:45,002 INFO L273 TraceCheckUtils]: 35: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2018-11-23 12:21:45,002 INFO L273 TraceCheckUtils]: 36: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:45,003 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {5474#true} {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} #83#return; {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,003 INFO L273 TraceCheckUtils]: 38: Hoare triple {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {5589#(and (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,005 INFO L273 TraceCheckUtils]: 40: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,006 INFO L256 TraceCheckUtils]: 41: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5474#true} is VALID [2018-11-23 12:21:45,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2018-11-23 12:21:45,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2018-11-23 12:21:45,006 INFO L273 TraceCheckUtils]: 44: Hoare triple {5474#true} assume true; {5474#true} is VALID [2018-11-23 12:21:45,007 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5474#true} {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} #83#return; {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,009 INFO L273 TraceCheckUtils]: 47: Hoare triple {5541#(and (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12))))) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#(and (= main_~i~0 3) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:45,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {5638#(and (= main_~i~0 3) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5484#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:21:45,010 INFO L256 TraceCheckUtils]: 49: Hoare triple {5484#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {5645#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:45,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {5645#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5649#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:21:45,011 INFO L273 TraceCheckUtils]: 51: Hoare triple {5649#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5475#false} is VALID [2018-11-23 12:21:45,011 INFO L273 TraceCheckUtils]: 52: Hoare triple {5475#false} assume !false; {5475#false} is VALID [2018-11-23 12:21:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:21:45,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:45,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-23 12:21:45,037 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 12:21:45,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:45,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:21:45,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:45,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:21:45,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:21:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:21:45,135 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand 23 states. [2018-11-23 12:21:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:49,837 INFO L93 Difference]: Finished difference Result 293 states and 392 transitions. [2018-11-23 12:21:49,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:21:49,838 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 12:21:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:21:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2018-11-23 12:21:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:21:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2018-11-23 12:21:49,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 198 transitions. [2018-11-23 12:21:50,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:50,266 INFO L225 Difference]: With dead ends: 293 [2018-11-23 12:21:50,266 INFO L226 Difference]: Without dead ends: 291 [2018-11-23 12:21:50,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:21:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-23 12:21:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 176. [2018-11-23 12:21:51,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:51,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 176 states. [2018-11-23 12:21:51,367 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 176 states. [2018-11-23 12:21:51,367 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 176 states. [2018-11-23 12:21:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:51,378 INFO L93 Difference]: Finished difference Result 291 states and 390 transitions. [2018-11-23 12:21:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 390 transitions. [2018-11-23 12:21:51,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:51,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:51,380 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 291 states. [2018-11-23 12:21:51,380 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 291 states. [2018-11-23 12:21:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:51,389 INFO L93 Difference]: Finished difference Result 291 states and 390 transitions. [2018-11-23 12:21:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 390 transitions. [2018-11-23 12:21:51,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:51,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:51,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:51,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-23 12:21:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2018-11-23 12:21:51,396 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 53 [2018-11-23 12:21:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:51,397 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2018-11-23 12:21:51,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:21:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2018-11-23 12:21:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:21:51,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:51,398 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-23 12:21:51,398 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:51,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -501714799, now seen corresponding path program 1 times [2018-11-23 12:21:51,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:51,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:51,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:21:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:51,996 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-11-23 12:21:52,476 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2018-11-23 12:21:53,069 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-11-23 12:21:53,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {6859#true} call ULTIMATE.init(); {6859#true} is VALID [2018-11-23 12:21:53,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {6859#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6859#true} is VALID [2018-11-23 12:21:53,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {6859#true} assume true; {6859#true} is VALID [2018-11-23 12:21:53,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6859#true} {6859#true} #79#return; {6859#true} is VALID [2018-11-23 12:21:53,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {6859#true} call #t~ret8 := main(); {6859#true} is VALID [2018-11-23 12:21:53,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {6859#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6859#true} is VALID [2018-11-23 12:21:53,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {6859#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {6859#true} is VALID [2018-11-23 12:21:53,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {6859#true} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {6861#(= main_~i~0 1)} is VALID [2018-11-23 12:21:53,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {6861#(= main_~i~0 1)} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6861#(= main_~i~0 1)} is VALID [2018-11-23 12:21:53,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {6861#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {6861#(= main_~i~0 1)} is VALID [2018-11-23 12:21:53,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {6861#(= main_~i~0 1)} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6861#(= main_~i~0 1)} is VALID [2018-11-23 12:21:53,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {6861#(= main_~i~0 1)} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {6861#(= main_~i~0 1)} is VALID [2018-11-23 12:21:53,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {6861#(= main_~i~0 1)} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6861#(= main_~i~0 1)} is VALID [2018-11-23 12:21:53,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {6861#(= main_~i~0 1)} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {6862#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4))))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:53,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {6862#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4))))) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,270 INFO L273 TraceCheckUtils]: 20: Hoare triple {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {6863#(and (<= (+ (div (+ (- |main_~#a~0.offset|) (+ (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))) 4)) 12) 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} is VALID [2018-11-23 12:21:53,275 INFO L273 TraceCheckUtils]: 25: Hoare triple {6864#(and (not (= (* 12 main_~i~0) 12)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {6865#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} is VALID [2018-11-23 12:21:53,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {6865#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6865#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} is VALID [2018-11-23 12:21:53,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {6865#(not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 12 main_~i~0) (- 4)) main_~FIXEDVAL~0) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {6866#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} is VALID [2018-11-23 12:21:53,278 INFO L273 TraceCheckUtils]: 28: Hoare triple {6866#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6866#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} is VALID [2018-11-23 12:21:53,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {6866#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {6866#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} is VALID [2018-11-23 12:21:53,279 INFO L273 TraceCheckUtils]: 30: Hoare triple {6866#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4))))))} ~i~0 := 0; {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:53,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:53,280 INFO L256 TraceCheckUtils]: 32: Hoare triple {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {6859#true} is VALID [2018-11-23 12:21:53,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2018-11-23 12:21:53,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2018-11-23 12:21:53,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {6859#true} assume true; {6859#true} is VALID [2018-11-23 12:21:53,282 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {6859#true} {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} #83#return; {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:53,294 INFO L273 TraceCheckUtils]: 37: Hoare triple {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} havoc #t~mem7; {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:53,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {6867#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) (- 4)))))) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} is VALID [2018-11-23 12:21:53,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} is VALID [2018-11-23 12:21:53,296 INFO L256 TraceCheckUtils]: 40: Hoare triple {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {6859#true} is VALID [2018-11-23 12:21:53,296 INFO L273 TraceCheckUtils]: 41: Hoare triple {6859#true} ~cond := #in~cond; {6859#true} is VALID [2018-11-23 12:21:53,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {6859#true} assume !(0 == ~cond); {6859#true} is VALID [2018-11-23 12:21:53,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {6859#true} assume true; {6859#true} is VALID [2018-11-23 12:21:53,297 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6859#true} {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} #83#return; {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} is VALID [2018-11-23 12:21:53,297 INFO L273 TraceCheckUtils]: 45: Hoare triple {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} havoc #t~mem7; {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} is VALID [2018-11-23 12:21:53,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {6868#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) (- 4))))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6869#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))} is VALID [2018-11-23 12:21:53,298 INFO L273 TraceCheckUtils]: 47: Hoare triple {6869#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6870#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:21:53,299 INFO L256 TraceCheckUtils]: 48: Hoare triple {6870#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {6871#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:21:53,299 INFO L273 TraceCheckUtils]: 49: Hoare triple {6871#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6872#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:21:53,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {6872#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6860#false} is VALID [2018-11-23 12:21:53,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {6860#false} assume !false; {6860#false} is VALID [2018-11-23 12:21:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:21:53,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:53,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:53,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:53,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:53,433 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:21:53,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:21:53,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 12:21:53,460 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:53,460 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= main_~i~0 1) (= (store |v_#memory_int_36| |main_~#a~0.base| (store (select |v_#memory_int_36| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:53,461 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:53,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:21:53,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,617 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 22 treesize of output 34 [2018-11-23 12:21:53,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-23 12:21:53,645 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:53,646 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_37| |main_~#a~0.base|))) (and (= |#memory_int| (store |v_#memory_int_37| |main_~#a~0.base| (store .cse0 (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0))) (<= 2 main_~i~0) (not (= (select .cse0 (+ |main_~#a~0.offset| 8)) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:53,646 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:53,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:21:53,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,676 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 22 treesize of output 34 [2018-11-23 12:21:53,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 12:21:53,767 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 39 treesize of output 32 [2018-11-23 12:21:53,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,786 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 0 case distinctions, treesize of input 32 treesize of output 71 [2018-11-23 12:21:53,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2018-11-23 12:21:53,827 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:53,827 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_39| |main_~#a~0.base|)) (.cse1 (* 12 main_~i~0))) (and (= main_~FIXEDVAL~0 (select .cse0 (+ .cse1 |main_~#a~0.offset| (- 8)))) (<= 2 main_~i~0) (not (= (select .cse0 (+ |main_~#a~0.offset| 8)) main_~DEFAULTVAL~0)) (= (store |v_#memory_int_39| |main_~#a~0.base| (store .cse0 (+ .cse1 |main_~#a~0.offset| (- 4)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:53,828 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (= (select .cse0 (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:53,935 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 39 treesize of output 32 [2018-11-23 12:21:53,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:53,954 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 0 case distinctions, treesize of input 32 treesize of output 71 [2018-11-23 12:21:53,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:53,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:54,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:21:54,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-11-23 12:21:54,022 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:54,022 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, main_~value~0, v_main_~i~0_32]. (let ((.cse0 (select |v_#memory_int_40| |main_~#a~0.base|))) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (= (store |v_#memory_int_40| |main_~#a~0.base| (store .cse0 (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 12)) main_~value~0)) |#memory_int|) (= (select .cse0 (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:54,022 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_32]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= main_~FIXEDVAL~0 (select .cse0 (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:54,064 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 39 treesize of output 32 [2018-11-23 12:21:54,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,082 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 0 case distinctions, treesize of input 32 treesize of output 71 [2018-11-23 12:21:54,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:54,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:54,123 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:21:54,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-11-23 12:21:54,251 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 46 [2018-11-23 12:21:54,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:54,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 128 [2018-11-23 12:21:54,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:54,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:54,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:21:54,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-11-23 12:22:06,390 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 12:22:08,628 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 12:22:10,681 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|)) (.cse1 (* 12 v_prenex_1))) (let ((.cse2 (select .cse0 (+ .cse1 (- 8))))) (and (= (select .cse0 (+ .cse1 (- 4))) .cse2) (<= 2 v_main_~i~0_32) (= (select .cse0 (+ (* 12 v_main_~i~0_32) (- 8))) .cse2) (<= (+ v_main_~i~0_32 1) v_prenex_1))))) is different from true [2018-11-23 12:22:14,962 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 12:22:17,024 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|)) (.cse2 (* 12 v_prenex_1))) (let ((.cse1 (select .cse0 (+ .cse2 (- 8))))) (and (<= 2 v_main_~i~0_32) (= (select .cse0 (+ (* 12 v_main_~i~0_32) (- 8))) .cse1) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= .cse1 (select .cse0 (+ .cse2 (- 4)))))))) is different from true [2018-11-23 12:22:21,281 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 12:22:21,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 54 treesize of output 42 [2018-11-23 12:22:21,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 71 [2018-11-23 12:22:21,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:4 [2018-11-23 12:22:21,365 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:21,365 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, v_prenex_1, v_main_~i~0_32]. (let ((.cse3 (* 12 v_prenex_1)) (.cse2 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse2 8)) (.cse1 (select .cse2 (+ .cse3 (- 8))))) (and (<= 2 v_main_~i~0_32) (= .cse0 |main_#t~mem7|) (= .cse1 (select .cse2 (+ .cse3 (- 4)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (not (= main_~DEFAULTVAL~0 .cse0)) (= .cse1 (select .cse2 (+ (* 12 v_main_~i~0_32) (- 8))))))) [2018-11-23 12:22:21,365 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) [2018-11-23 12:22:21,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {6859#true} call ULTIMATE.init(); {6859#true} is VALID [2018-11-23 12:22:21,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {6859#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6859#true} is VALID [2018-11-23 12:22:21,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {6859#true} assume true; {6859#true} is VALID [2018-11-23 12:22:21,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6859#true} {6859#true} #79#return; {6859#true} is VALID [2018-11-23 12:22:21,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {6859#true} call #t~ret8 := main(); {6859#true} is VALID [2018-11-23 12:22:21,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {6859#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6859#true} is VALID [2018-11-23 12:22:21,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {6859#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~DEFAULTVAL~0 := 0;~FIXEDVAL~0 := 10; {6894#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:22:21,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {6894#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then ~SIZE~0 % 3 - 3 else ~SIZE~0 % 3) then 1 else 0);~i~0 := 1; {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {6898#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {6917#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {6917#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4))))) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,418 INFO L273 TraceCheckUtils]: 15: Hoare triple {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,419 INFO L273 TraceCheckUtils]: 16: Hoare triple {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {6921#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {6934#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {6934#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6934#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {6934#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {6934#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {6934#(and (<= 2 main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,427 INFO L273 TraceCheckUtils]: 22: Hoare triple {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3));call #t~ret3 := ReadFromPort();assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~value~0 := #t~ret3;havoc #t~ret3; {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume ~value~0 != ~DEFAULTVAL~0;call write~int(~value~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 3), 4); {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} call #t~ret4 := ReadFromPort();assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~value~0 := #t~ret4;havoc #t~ret4; {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {6944#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 2), 4); {6957#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,434 INFO L273 TraceCheckUtils]: 26: Hoare triple {6957#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} call #t~ret5 := ReadFromPort();assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~value~0 := #t~ret5;havoc #t~ret5; {6957#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,437 INFO L273 TraceCheckUtils]: 27: Hoare triple {6957#(and (exists ((v_main_~i~0_32 Int)) (and (= main_~FIXEDVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) main_~FIXEDVAL~0) (= |main_~#a~0.offset| 0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~int(~FIXEDVAL~0, ~#a~0.base, ~#a~0.offset + 4 * (3 * ~i~0 - 1), 4); {6964#(and (exists ((main_~i~0 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {6964#(and (exists ((main_~i~0 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6964#(and (exists ((main_~i~0 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,439 INFO L273 TraceCheckUtils]: 29: Hoare triple {6964#(and (exists ((main_~i~0 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 3 then 1 + ~SIZE~0 / 3 else ~SIZE~0 / 3)); {6964#(and (exists ((main_~i~0 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,440 INFO L273 TraceCheckUtils]: 30: Hoare triple {6964#(and (exists ((main_~i~0 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 main_~i~0) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,443 INFO L256 TraceCheckUtils]: 32: Hoare triple {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} is VALID [2018-11-23 12:22:21,444 INFO L273 TraceCheckUtils]: 33: Hoare triple {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} ~cond := #in~cond; {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} is VALID [2018-11-23 12:22:21,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} assume !(0 == ~cond); {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} is VALID [2018-11-23 12:22:21,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} assume true; {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} is VALID [2018-11-23 12:22:21,466 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {6981#(exists ((v_prenex_1 Int) (v_main_~i~0_32 Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1)))} {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #83#return; {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,467 INFO L273 TraceCheckUtils]: 37: Hoare triple {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,468 INFO L273 TraceCheckUtils]: 38: Hoare triple {6974#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,471 INFO L256 TraceCheckUtils]: 40: Hoare triple {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} is VALID [2018-11-23 12:22:21,471 INFO L273 TraceCheckUtils]: 41: Hoare triple {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} ~cond := #in~cond; {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} is VALID [2018-11-23 12:22:21,472 INFO L273 TraceCheckUtils]: 42: Hoare triple {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} assume !(0 == ~cond); {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} is VALID [2018-11-23 12:22:21,472 INFO L273 TraceCheckUtils]: 43: Hoare triple {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} assume true; {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} is VALID [2018-11-23 12:22:21,474 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {7007#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_main_~i~0_32) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8)))) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 8))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (+ (* 12 v_prenex_1) (- 4))))))} {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} #83#return; {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,475 INFO L273 TraceCheckUtils]: 45: Hoare triple {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} havoc #t~mem7; {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {7000#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 1) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7026#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:21,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {7026#(and (exists ((v_prenex_1 Int) (v_main_~i~0_32 Int)) (and (<= 2 v_main_~i~0_32) (<= (+ v_main_~i~0_32 1) v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_main_~i~0_32) |main_~#a~0.offset| (- 8)))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 12 v_prenex_1) |main_~#a~0.offset| (- 4)))))) (= main_~i~0 2) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6870#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-23 12:22:21,479 INFO L256 TraceCheckUtils]: 48: Hoare triple {6870#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1 else 0)); {7033#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:21,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {7033#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7037#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:21,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {7037#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6860#false} is VALID [2018-11-23 12:22:21,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {6860#false} assume !false; {6860#false} is VALID [2018-11-23 12:22:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-11-23 12:22:21,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:21,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 29 [2018-11-23 12:22:21,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2018-11-23 12:22:21,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:21,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:22:21,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:21,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:22:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:22:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=8, NotChecked=102, Total=812 [2018-11-23 12:22:21,658 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand 29 states.