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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:28:52,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:28:52,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:28:52,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:28:52,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:28:52,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:28:52,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:28:52,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:28:52,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:28:52,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:28:52,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:28:52,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:28:52,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:28:52,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:28:53,000 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:28:53,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:28:53,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:28:53,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:28:53,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:28:53,012 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:28:53,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:28:53,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:28:53,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:28:53,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:28:53,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:28:53,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:28:53,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:28:53,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:28:53,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:28:53,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:28:53,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:28:53,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:28:53,029 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:28:53,029 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:28:53,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:28:53,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:28:53,031 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:28:53,045 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:28:53,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:28:53,046 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:28:53,046 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:28:53,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:28:53,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:28:53,047 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:28:53,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:28:53,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:28:53,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:28:53,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:28:53,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:28:53,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:28:53,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:28:53,049 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:28:53,049 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:28:53,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:28:53,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:28:53,050 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:28:53,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:28:53,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:28:53,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:28:53,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:28:53,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:28:53,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:28:53,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:28:53,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:28:53,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:28:53,052 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:28:53,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:28:53,052 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:28:53,052 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:28:53,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:28:53,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:28:53,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:28:53,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:28:53,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:28:53,131 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:28:53,132 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr2_true-unreach-call.i [2018-11-23 10:28:53,209 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146902d64/ad59dee9d06f47499337df407263a28d/FLAGa84479d78 [2018-11-23 10:28:53,637 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:28:53,637 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr2_true-unreach-call.i [2018-11-23 10:28:53,643 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146902d64/ad59dee9d06f47499337df407263a28d/FLAGa84479d78 [2018-11-23 10:28:54,003 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146902d64/ad59dee9d06f47499337df407263a28d [2018-11-23 10:28:54,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:28:54,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:28:54,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:54,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:28:54,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:28:54,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef57ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54, skipping insertion in model container [2018-11-23 10:28:54,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:28:54,066 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:28:54,317 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:54,323 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:28:54,364 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:54,399 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:28:54,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54 WrapperNode [2018-11-23 10:28:54,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:54,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:54,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:28:54,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:28:54,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:54,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:28:54,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:28:54,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:28:54,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (1/1) ... [2018-11-23 10:28:54,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:28:54,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:28:54,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:28:54,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:28:54,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (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 10:28:54,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:28:54,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:28:54,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:28:54,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:28:54,594 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-23 10:28:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:28:54,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:28:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:28:54,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:28:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:28:54,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:28:54,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:28:54,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:28:55,259 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:28:55,260 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:28:55,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:55 BoogieIcfgContainer [2018-11-23 10:28:55,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:28:55,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:28:55,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:28:55,264 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:28:55,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:54" (1/3) ... [2018-11-23 10:28:55,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e3f97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:55, skipping insertion in model container [2018-11-23 10:28:55,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:54" (2/3) ... [2018-11-23 10:28:55,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e3f97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:55, skipping insertion in model container [2018-11-23 10:28:55,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:55" (3/3) ... [2018-11-23 10:28:55,267 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr2_true-unreach-call.i [2018-11-23 10:28:55,276 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:28:55,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:28:55,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:28:55,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:28:55,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:28:55,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:28:55,341 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:28:55,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:28:55,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:28:55,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:28:55,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:28:55,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:28:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 10:28:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:28:55,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:28:55,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:28:55,370 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:28:55,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:28:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1661916020, now seen corresponding path program 1 times [2018-11-23 10:28:55,381 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:28:55,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:28:55,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:28:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:55,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:28:55,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 10:28:55,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {33#true} is VALID [2018-11-23 10:28:55,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 10:28:55,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #72#return; {33#true} is VALID [2018-11-23 10:28:55,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2018-11-23 10:28:55,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2018-11-23 10:28:55,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {56#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:28:55,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {60#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:56,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {34#false} is VALID [2018-11-23 10:28:56,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0bv32; {34#false} is VALID [2018-11-23 10:28:56,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {34#false} is VALID [2018-11-23 10:28:56,009 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 10:28:56,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 10:28:56,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 10:28:56,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 10:28:56,014 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 10:28:56,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:28:56,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:28:56,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:28:56,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:28:56,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:28:56,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:28:56,168 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 10:28:56,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:28:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:28:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:28:56,180 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-11-23 10:28:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:28:57,038 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-23 10:28:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:28:57,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:28:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:28:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:28:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 10:28:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:28:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 10:28:57,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2018-11-23 10:28:57,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:28:57,642 INFO L225 Difference]: With dead ends: 57 [2018-11-23 10:28:57,643 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:28:57,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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 10:28:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:28:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-23 10:28:57,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:28:57,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2018-11-23 10:28:57,697 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2018-11-23 10:28:57,697 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2018-11-23 10:28:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:28:57,702 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 10:28:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 10:28:57,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:28:57,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:28:57,703 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2018-11-23 10:28:57,703 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2018-11-23 10:28:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:28:57,708 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 10:28:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 10:28:57,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:28:57,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:28:57,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:28:57,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:28:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:28:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 10:28:57,715 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-11-23 10:28:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:28:57,715 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 10:28:57,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:28:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:28:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:28:57,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:28:57,717 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] [2018-11-23 10:28:57,717 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:28:57,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:28:57,717 INFO L82 PathProgramCache]: Analyzing trace with hash 505215540, now seen corresponding path program 1 times [2018-11-23 10:28:57,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:28:57,718 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:28:57,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:28:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:57,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:28:58,021 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 10:28:58,033 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 10:28:58,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:58,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:28:58,146 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 10:28:58,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-23 10:28:58,161 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:28:58,162 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~value~0]. (and (= (store |v_#memory_int_12| |main_~#a~0.base| (store (select |v_#memory_int_12| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) main_~value~0)) |#memory_int|) (not (= main_~value~0 main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:28:58,162 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:28:58,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 22 treesize of output 17 [2018-11-23 10:28:58,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:58,270 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 10:28:58,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:58,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:28:58,301 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 10:28:58,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-11-23 10:28:58,322 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:28:58,323 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~FIXEDVAL~0]. (let ((.cse0 (select |v_#memory_int_13| |main_~#a~0.base|))) (and (not (= main_~DEFAULTVAL~0 (select .cse0 |main_~#a~0.offset|))) (= (store |v_#memory_int_13| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32)) main_~FIXEDVAL~0)) |#memory_int|) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:28:58,323 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| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:28:58,533 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 10:28:58,577 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 10:28:58,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:58,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:28:58,640 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 10:28:58,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-23 10:28:58,644 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:28:58,644 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv0 32)))) (and (= .cse0 |main_#t~mem6|) (not (= main_~DEFAULTVAL~0 .cse0)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:28:58,645 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:28:58,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2018-11-23 10:28:58,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {242#true} is VALID [2018-11-23 10:28:58,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2018-11-23 10:28:58,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #72#return; {242#true} is VALID [2018-11-23 10:28:58,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret7 := main(); {242#true} is VALID [2018-11-23 10:28:58,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {242#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {242#true} is VALID [2018-11-23 10:28:58,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {242#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {265#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:28:58,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {265#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:58,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:58,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {276#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:58,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {276#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {276#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:58,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {276#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {283#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:28:58,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {283#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {283#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:28:58,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {283#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {283#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:28:58,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {283#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {293#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:28:58,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {293#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {297#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:28:58,747 INFO L256 TraceCheckUtils]: 16: Hoare triple {297#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {301#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:58,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {301#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {305#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:58,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {305#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {243#false} is VALID [2018-11-23 10:28:58,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {243#false} assume !false; {243#false} is VALID [2018-11-23 10:28:58,753 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 10:28:58,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:28:59,198 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 14 [2018-11-23 10:28:59,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-23 10:28:59,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:59,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:28:59,293 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 10:28:59,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-23 10:28:59,299 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:28:59,299 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, main_~value~0]. (or (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) |main_~#a~0.offset|) main_~DEFAULTVAL~0)) (= main_~value~0 main_~DEFAULTVAL~0)) [2018-11-23 10:28:59,299 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) [2018-11-23 10:28:59,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {243#false} assume !false; {243#false} is VALID [2018-11-23 10:28:59,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {315#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {243#false} is VALID [2018-11-23 10:28:59,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {319#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {315#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:28:59,349 INFO L256 TraceCheckUtils]: 16: Hoare triple {323#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {319#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:28:59,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {327#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {323#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-23 10:28:59,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {327#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-23 10:28:59,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:28:59,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:28:59,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:28:59,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:28:59,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {347#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {331#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:28:59,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {347#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {347#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-23 10:28:59,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {242#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {347#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-23 10:28:59,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {242#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {242#true} is VALID [2018-11-23 10:28:59,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {242#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {242#true} is VALID [2018-11-23 10:28:59,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret7 := main(); {242#true} is VALID [2018-11-23 10:28:59,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #72#return; {242#true} is VALID [2018-11-23 10:28:59,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2018-11-23 10:28:59,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {242#true} is VALID [2018-11-23 10:28:59,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2018-11-23 10:28:59,365 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 10:28:59,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:28:59,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-23 10:28:59,380 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-23 10:28:59,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:28:59,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:28:59,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:28:59,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:28:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:28:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:28:59,495 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 16 states. [2018-11-23 10:29:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:02,264 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-23 10:29:02,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:29:02,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-23 10:29:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:29:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2018-11-23 10:29:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:29:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2018-11-23 10:29:02,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2018-11-23 10:29:02,478 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 10:29:02,483 INFO L225 Difference]: With dead ends: 58 [2018-11-23 10:29:02,483 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 10:29:02,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-23 10:29:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 10:29:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2018-11-23 10:29:02,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:02,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 37 states. [2018-11-23 10:29:02,543 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 37 states. [2018-11-23 10:29:02,543 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 37 states. [2018-11-23 10:29:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:02,549 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 10:29:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-23 10:29:02,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:02,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:02,551 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 56 states. [2018-11-23 10:29:02,551 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 56 states. [2018-11-23 10:29:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:02,557 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 10:29:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-23 10:29:02,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:02,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:02,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:02,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:29:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-23 10:29:02,562 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2018-11-23 10:29:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:02,562 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-23 10:29:02,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:29:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-23 10:29:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:29:02,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:02,564 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] [2018-11-23 10:29:02,564 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:02,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1206280118, now seen corresponding path program 1 times [2018-11-23 10:29:02,565 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:02,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:02,768 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 10:29:02,776 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 10:29:02,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 10:29:02,888 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 21 treesize of output 16 [2018-11-23 10:29:02,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:02,907 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 16 treesize of output 23 [2018-11-23 10:29:02,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 10:29:03,157 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 22 treesize of output 16 [2018-11-23 10:29:03,163 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 10:29:03,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,174 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 10:29:03,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:7 [2018-11-23 10:29:03,180 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:03,180 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (_ bv0 32)))) (and (= (_ bv10 32) .cse0) (= .cse0 |main_#t~mem6|) (= (_ bv10 32) (select .cse1 (_ bv4 32))) (= main_~DEFAULTVAL~0 (_ bv0 32))))) [2018-11-23 10:29:03,180 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:03,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2018-11-23 10:29:03,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {622#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {622#true} is VALID [2018-11-23 10:29:03,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2018-11-23 10:29:03,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #72#return; {622#true} is VALID [2018-11-23 10:29:03,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret7 := main(); {622#true} is VALID [2018-11-23 10:29:03,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {622#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {622#true} is VALID [2018-11-23 10:29:03,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {622#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {645#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {645#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {649#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {649#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {649#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {649#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {656#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {656#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {656#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {663#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {663#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {663#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {663#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {663#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {663#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {673#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {673#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {677#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,283 INFO L256 TraceCheckUtils]: 16: Hoare triple {677#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {681#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:03,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {681#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {685#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:03,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {685#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {623#false} is VALID [2018-11-23 10:29:03,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {623#false} assume !false; {623#false} is VALID [2018-11-23 10:29:03,307 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 10:29:03,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:03,497 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 14 [2018-11-23 10:29:03,535 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-23 10:29:03,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:29:03,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:29:03,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:10 [2018-11-23 10:29:03,563 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:03,563 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) main_~FIXEDVAL~0) |main_~#a~0.offset|))) [2018-11-23 10:29:03,564 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:29:03,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {623#false} assume !false; {623#false} is VALID [2018-11-23 10:29:03,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {695#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {623#false} is VALID [2018-11-23 10:29:03,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {699#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {695#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:03,638 INFO L256 TraceCheckUtils]: 16: Hoare triple {703#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {699#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:03,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {707#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {703#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-23 10:29:03,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {707#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-23 10:29:03,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {727#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {711#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {727#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {727#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:03,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {734#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {727#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:03,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {622#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {734#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:29:03,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {622#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {622#true} is VALID [2018-11-23 10:29:03,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret7 := main(); {622#true} is VALID [2018-11-23 10:29:03,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #72#return; {622#true} is VALID [2018-11-23 10:29:03,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2018-11-23 10:29:03,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {622#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {622#true} is VALID [2018-11-23 10:29:03,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2018-11-23 10:29:03,652 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 10:29:03,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:03,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 10:29:03,654 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-11-23 10:29:03,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:03,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 10:29:03,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:03,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 10:29:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 10:29:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-23 10:29:03,769 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 17 states. [2018-11-23 10:29:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:09,212 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-11-23 10:29:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 10:29:09,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-11-23 10:29:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 10:29:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 73 transitions. [2018-11-23 10:29:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 10:29:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 73 transitions. [2018-11-23 10:29:09,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 73 transitions. [2018-11-23 10:29:11,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:11,469 INFO L225 Difference]: With dead ends: 73 [2018-11-23 10:29:11,470 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 10:29:11,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2018-11-23 10:29:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 10:29:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2018-11-23 10:29:11,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:11,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 54 states. [2018-11-23 10:29:11,712 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 54 states. [2018-11-23 10:29:11,712 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 54 states. [2018-11-23 10:29:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:11,718 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-23 10:29:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-23 10:29:11,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:11,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:11,720 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 71 states. [2018-11-23 10:29:11,720 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 71 states. [2018-11-23 10:29:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:11,725 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-23 10:29:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-23 10:29:11,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:11,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:11,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:11,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 10:29:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-11-23 10:29:11,731 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 20 [2018-11-23 10:29:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:11,731 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-23 10:29:11,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 10:29:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 10:29:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:29:11,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:11,733 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] [2018-11-23 10:29:11,733 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:11,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:11,734 INFO L82 PathProgramCache]: Analyzing trace with hash -114237849, now seen corresponding path program 1 times [2018-11-23 10:29:11,734 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:11,734 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:11,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:11,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:11,927 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 10:29:11,933 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 10:29:11,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:11,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:11,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:11,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 10:29:12,139 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 10:29:12,145 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 10:29:12,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:12,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:12,156 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 10:29:12,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 10:29:12,160 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:12,160 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv4 32)))) (and (= |main_#t~mem6| .cse0) (= (_ bv10 32) .cse0) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:12,161 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:12,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {1093#true} call ULTIMATE.init(); {1093#true} is VALID [2018-11-23 10:29:12,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {1093#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1093#true} is VALID [2018-11-23 10:29:12,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2018-11-23 10:29:12,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #72#return; {1093#true} is VALID [2018-11-23 10:29:12,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {1093#true} call #t~ret7 := main(); {1093#true} is VALID [2018-11-23 10:29:12,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {1093#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1093#true} is VALID [2018-11-23 10:29:12,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {1093#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1116#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {1120#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {1133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {1133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {1133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {1133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {1133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,233 INFO L256 TraceCheckUtils]: 16: Hoare triple {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume !(0bv32 == ~cond); {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,237 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1150#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #76#return; {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {1143#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1169#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:12,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {1169#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1173#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:12,242 INFO L256 TraceCheckUtils]: 24: Hoare triple {1173#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1177#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:12,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {1177#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1181#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:12,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {1181#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1094#false} is VALID [2018-11-23 10:29:12,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2018-11-23 10:29:12,262 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 10:29:12,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:12,487 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 18 treesize of output 16 [2018-11-23 10:29:12,521 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 10:29:12,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:12,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:29:12,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:29:12,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-11-23 10:29:12,545 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:12,546 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967292 32)) main_~FIXEDVAL~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))) [2018-11-23 10:29:12,546 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:29:12,623 INFO L273 TraceCheckUtils]: 27: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2018-11-23 10:29:12,624 INFO L273 TraceCheckUtils]: 26: Hoare triple {1191#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1094#false} is VALID [2018-11-23 10:29:12,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {1195#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1191#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:12,627 INFO L256 TraceCheckUtils]: 24: Hoare triple {1199#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1195#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:12,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {1203#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1199#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-23 10:29:12,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1203#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-23 10:29:12,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem6; {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:12,848 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1093#true} {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #76#return; {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:12,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {1093#true} assume true; {1093#true} is VALID [2018-11-23 10:29:12,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {1093#true} assume !(0bv32 == ~cond); {1093#true} is VALID [2018-11-23 10:29:12,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#true} ~cond := #in~cond; {1093#true} is VALID [2018-11-23 10:29:12,849 INFO L256 TraceCheckUtils]: 16: Hoare triple {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1093#true} is VALID [2018-11-23 10:29:12,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:12,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {1232#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {1207#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:12,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {1232#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {1232#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:12,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {1232#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1232#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:12,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {1232#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:12,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:12,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:12,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:12,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {1255#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {1242#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:12,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {1093#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1255#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:29:12,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {1093#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1093#true} is VALID [2018-11-23 10:29:12,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {1093#true} call #t~ret7 := main(); {1093#true} is VALID [2018-11-23 10:29:12,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #72#return; {1093#true} is VALID [2018-11-23 10:29:12,866 INFO L273 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2018-11-23 10:29:12,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {1093#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1093#true} is VALID [2018-11-23 10:29:12,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {1093#true} call ULTIMATE.init(); {1093#true} is VALID [2018-11-23 10:29:12,868 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 10:29:12,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:12,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-23 10:29:12,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 10:29:12,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:12,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 10:29:13,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:13,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 10:29:13,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 10:29:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-11-23 10:29:13,257 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 19 states. [2018-11-23 10:29:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:25,359 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-11-23 10:29:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 10:29:25,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 10:29:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:29:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 83 transitions. [2018-11-23 10:29:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:29:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 83 transitions. [2018-11-23 10:29:25,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 83 transitions. [2018-11-23 10:29:29,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 81 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:29,670 INFO L225 Difference]: With dead ends: 124 [2018-11-23 10:29:29,671 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 10:29:29,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-11-23 10:29:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 10:29:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 39. [2018-11-23 10:29:29,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:29,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 39 states. [2018-11-23 10:29:29,842 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 39 states. [2018-11-23 10:29:29,842 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 39 states. [2018-11-23 10:29:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:29,849 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-11-23 10:29:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2018-11-23 10:29:29,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:29,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:29,851 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 122 states. [2018-11-23 10:29:29,851 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 122 states. [2018-11-23 10:29:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:29,857 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-11-23 10:29:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2018-11-23 10:29:29,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:29,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:29,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:29,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 10:29:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-23 10:29:29,861 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 28 [2018-11-23 10:29:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:29,862 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-23 10:29:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 10:29:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 10:29:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 10:29:29,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:29,863 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] [2018-11-23 10:29:29,863 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:29,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1916608614, now seen corresponding path program 2 times [2018-11-23 10:29:29,864 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:29,864 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:29,891 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:29:29,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:29:29,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:30,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:30,438 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 10:29:30,677 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 10:29:30,984 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 10:29:31,421 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 10:29:31,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {1766#true} call ULTIMATE.init(); {1766#true} is VALID [2018-11-23 10:29:31,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {1766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1766#true} is VALID [2018-11-23 10:29:31,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {1766#true} assume true; {1766#true} is VALID [2018-11-23 10:29:31,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1766#true} #72#return; {1766#true} is VALID [2018-11-23 10:29:31,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {1766#true} call #t~ret7 := main(); {1766#true} is VALID [2018-11-23 10:29:31,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {1766#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1766#true} is VALID [2018-11-23 10:29:31,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {1766#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1789#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:31,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {1789#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {1793#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:29:31,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {1809#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,495 INFO L256 TraceCheckUtils]: 16: Hoare triple {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,499 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #76#return; {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} havoc #t~mem6; {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {1817#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,504 INFO L256 TraceCheckUtils]: 24: Hoare triple {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:31,508 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1813#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #76#return; {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,509 INFO L273 TraceCheckUtils]: 29: Hoare triple {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem6; {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:31,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {1842#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1867#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:29:31,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {1867#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1767#false} is VALID [2018-11-23 10:29:31,531 INFO L256 TraceCheckUtils]: 32: Hoare triple {1767#false} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1767#false} is VALID [2018-11-23 10:29:31,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {1767#false} ~cond := #in~cond; {1767#false} is VALID [2018-11-23 10:29:31,531 INFO L273 TraceCheckUtils]: 34: Hoare triple {1767#false} assume 0bv32 == ~cond; {1767#false} is VALID [2018-11-23 10:29:31,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {1767#false} assume !false; {1767#false} is VALID [2018-11-23 10:29:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:29:31,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:32,684 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 10:29:33,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {1767#false} assume !false; {1767#false} is VALID [2018-11-23 10:29:33,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {1767#false} assume 0bv32 == ~cond; {1767#false} is VALID [2018-11-23 10:29:33,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {1767#false} ~cond := #in~cond; {1767#false} is VALID [2018-11-23 10:29:33,160 INFO L256 TraceCheckUtils]: 32: Hoare triple {1767#false} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1767#false} is VALID [2018-11-23 10:29:33,160 INFO L273 TraceCheckUtils]: 31: Hoare triple {1895#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1767#false} is VALID [2018-11-23 10:29:33,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1895#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-23 10:29:33,163 INFO L273 TraceCheckUtils]: 29: Hoare triple {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem6; {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,164 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1766#true} {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #76#return; {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {1766#true} assume true; {1766#true} is VALID [2018-11-23 10:29:33,164 INFO L273 TraceCheckUtils]: 26: Hoare triple {1766#true} assume !(0bv32 == ~cond); {1766#true} is VALID [2018-11-23 10:29:33,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {1766#true} ~cond := #in~cond; {1766#true} is VALID [2018-11-23 10:29:33,165 INFO L256 TraceCheckUtils]: 24: Hoare triple {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1766#true} is VALID [2018-11-23 10:29:33,166 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1899#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem6; {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,187 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1766#true} {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #76#return; {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {1766#true} assume true; {1766#true} is VALID [2018-11-23 10:29:33,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {1766#true} assume !(0bv32 == ~cond); {1766#true} is VALID [2018-11-23 10:29:33,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {1766#true} ~cond := #in~cond; {1766#true} is VALID [2018-11-23 10:29:33,188 INFO L256 TraceCheckUtils]: 16: Hoare triple {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1766#true} is VALID [2018-11-23 10:29:33,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {1949#(not (bvslt (_ bv2 32) ~SIZE~0))} ~i~0 := 0bv32; {1924#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:33,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {1953#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {1949#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:29:33,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1953#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32))))} is VALID [2018-11-23 10:29:33,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:29:33,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:29:33,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:29:33,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {1970#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)) (not (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32)))))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1957#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 10:29:33,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {1766#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {1970#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)) (not (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32)))))} is VALID [2018-11-23 10:29:33,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {1766#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1766#true} is VALID [2018-11-23 10:29:33,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {1766#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1766#true} is VALID [2018-11-23 10:29:33,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {1766#true} call #t~ret7 := main(); {1766#true} is VALID [2018-11-23 10:29:33,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1766#true} #72#return; {1766#true} is VALID [2018-11-23 10:29:33,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {1766#true} assume true; {1766#true} is VALID [2018-11-23 10:29:33,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {1766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1766#true} is VALID [2018-11-23 10:29:33,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {1766#true} call ULTIMATE.init(); {1766#true} is VALID [2018-11-23 10:29:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:29:33,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:33,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 10:29:33,237 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 10:29:33,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:33,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:29:33,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:33,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:29:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:29:33,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:29:33,715 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2018-11-23 10:29:38,259 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 10:29:38,653 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 10:29:39,397 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 10:29:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:42,938 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 10:29:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:29:42,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 10:29:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:29:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2018-11-23 10:29:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:29:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2018-11-23 10:29:42,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 77 transitions. [2018-11-23 10:29:43,600 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 10:29:43,601 INFO L225 Difference]: With dead ends: 78 [2018-11-23 10:29:43,601 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 10:29:43,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-11-23 10:29:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 10:29:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-11-23 10:29:43,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:43,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 44 states. [2018-11-23 10:29:43,678 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 44 states. [2018-11-23 10:29:43,678 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 44 states. [2018-11-23 10:29:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:43,681 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-23 10:29:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 10:29:43,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:43,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:43,682 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 50 states. [2018-11-23 10:29:43,683 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 50 states. [2018-11-23 10:29:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:43,685 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-23 10:29:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 10:29:43,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:43,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:43,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:43,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 10:29:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 10:29:43,687 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 36 [2018-11-23 10:29:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:43,688 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 10:29:43,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:29:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 10:29:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 10:29:43,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:43,689 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:43,689 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:43,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1672194802, now seen corresponding path program 3 times [2018-11-23 10:29:43,690 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:43,690 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:43,713 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:29:43,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 10:29:43,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:43,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:43,984 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 10:29:43,991 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 10:29:44,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:44,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:44,029 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 10:29:44,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-23 10:29:44,041 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:44,041 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|, main_~value~0]. (and (= (store |v_#memory_int_25| |main_~#a~0.base| (store (select |v_#memory_int_25| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) main_~value~0)) |#memory_int|) (not (= main_~value~0 main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:44,041 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:44,094 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 10:29:44,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:44,165 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 10:29:44,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:44,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:44,374 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 10:29:44,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-23 10:29:44,395 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:44,395 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, main_~FIXEDVAL~0]. (let ((.cse0 (select |v_#memory_int_26| |main_~#a~0.base|))) (and (not (= main_~DEFAULTVAL~0 (select .cse0 (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= (store |v_#memory_int_26| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)) main_~FIXEDVAL~0)) |#memory_int|) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:44,396 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:44,683 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 20 treesize of output 16 [2018-11-23 10:29:44,690 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 16 treesize of output 4 [2018-11-23 10:29:44,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:44,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:44,699 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 10:29:44,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2018-11-23 10:29:44,706 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:44,706 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (and (= |main_#t~mem6| .cse0) (not (= main_~DEFAULTVAL~0 .cse0)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:44,706 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:44,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {2267#true} call ULTIMATE.init(); {2267#true} is VALID [2018-11-23 10:29:44,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {2267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2267#true} is VALID [2018-11-23 10:29:44,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {2267#true} assume true; {2267#true} is VALID [2018-11-23 10:29:44,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2267#true} {2267#true} #72#return; {2267#true} is VALID [2018-11-23 10:29:44,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {2267#true} call #t~ret7 := main(); {2267#true} is VALID [2018-11-23 10:29:44,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {2267#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2267#true} is VALID [2018-11-23 10:29:44,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {2267#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {2290#(= main_~DEFAULTVAL~0 (_ bv0 32))} is VALID [2018-11-23 10:29:44,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {2290#(= main_~DEFAULTVAL~0 (_ bv0 32))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {2294#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2310#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {2310#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2310#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {2310#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {2317#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {2317#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2317#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {2317#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {2324#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {2324#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2324#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {2324#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {2324#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {2324#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,894 INFO L256 TraceCheckUtils]: 21: Hoare triple {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} ~cond := #in~cond; {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} assume !(0bv32 == ~cond); {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} assume true; {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,896 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #76#return; {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {2334#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,902 INFO L256 TraceCheckUtils]: 29: Hoare triple {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,903 INFO L273 TraceCheckUtils]: 30: Hoare triple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} ~cond := #in~cond; {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} assume !(0bv32 == ~cond); {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} assume true; {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} is VALID [2018-11-23 10:29:44,912 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2341#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_3| (_ bv8 32))))))} {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #76#return; {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,912 INFO L273 TraceCheckUtils]: 34: Hoare triple {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem6; {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:44,914 INFO L273 TraceCheckUtils]: 35: Hoare triple {2360#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2317#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {2317#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2388#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:44,916 INFO L256 TraceCheckUtils]: 37: Hoare triple {2388#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2392#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:44,916 INFO L273 TraceCheckUtils]: 38: Hoare triple {2392#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2396#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:44,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {2396#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2268#false} is VALID [2018-11-23 10:29:44,917 INFO L273 TraceCheckUtils]: 40: Hoare triple {2268#false} assume !false; {2268#false} is VALID [2018-11-23 10:29:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:29:44,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:45,421 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 18 treesize of output 16 [2018-11-23 10:29:45,518 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-11-23 10:29:45,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:45,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:45,539 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 10:29:45,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:5 [2018-11-23 10:29:45,546 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:45,546 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, main_~value~0]. (or (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~value~0 main_~DEFAULTVAL~0)) [2018-11-23 10:29:45,547 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) [2018-11-23 10:29:45,647 INFO L273 TraceCheckUtils]: 40: Hoare triple {2268#false} assume !false; {2268#false} is VALID [2018-11-23 10:29:45,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {2406#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2268#false} is VALID [2018-11-23 10:29:45,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {2410#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2406#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:45,650 INFO L256 TraceCheckUtils]: 37: Hoare triple {2414#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2410#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:45,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {2418#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2414#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-23 10:29:45,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2418#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-23 10:29:45,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem6; {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:45,844 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2267#true} {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #76#return; {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:45,844 INFO L273 TraceCheckUtils]: 32: Hoare triple {2267#true} assume true; {2267#true} is VALID [2018-11-23 10:29:45,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {2267#true} assume !(0bv32 == ~cond); {2267#true} is VALID [2018-11-23 10:29:45,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {2267#true} ~cond := #in~cond; {2267#true} is VALID [2018-11-23 10:29:45,845 INFO L256 TraceCheckUtils]: 29: Hoare triple {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2267#true} is VALID [2018-11-23 10:29:45,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:46,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2422#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:29:46,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} havoc #t~mem6; {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,136 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2267#true} {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #76#return; {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {2267#true} assume true; {2267#true} is VALID [2018-11-23 10:29:46,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {2267#true} assume !(0bv32 == ~cond); {2267#true} is VALID [2018-11-23 10:29:46,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {2267#true} ~cond := #in~cond; {2267#true} is VALID [2018-11-23 10:29:46,137 INFO L256 TraceCheckUtils]: 21: Hoare triple {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2267#true} is VALID [2018-11-23 10:29:46,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {2447#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {2488#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {2472#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:46,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {2488#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2488#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-23 10:29:46,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2488#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-23 10:29:46,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:46,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:46,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:46,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:46,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {2267#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {2495#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:46,153 INFO L273 TraceCheckUtils]: 6: Hoare triple {2267#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {2267#true} is VALID [2018-11-23 10:29:46,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {2267#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2267#true} is VALID [2018-11-23 10:29:46,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {2267#true} call #t~ret7 := main(); {2267#true} is VALID [2018-11-23 10:29:46,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2267#true} {2267#true} #72#return; {2267#true} is VALID [2018-11-23 10:29:46,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {2267#true} assume true; {2267#true} is VALID [2018-11-23 10:29:46,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {2267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2267#true} is VALID [2018-11-23 10:29:46,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {2267#true} call ULTIMATE.init(); {2267#true} is VALID [2018-11-23 10:29:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:29:46,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:46,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-23 10:29:46,161 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-11-23 10:29:46,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:46,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 10:29:46,904 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 10:29:46,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 10:29:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 10:29:46,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-23 10:29:46,905 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 22 states. [2018-11-23 10:31:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:28,810 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-11-23 10:31:28,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 10:31:28,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-11-23 10:31:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:31:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:31:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 105 transitions. [2018-11-23 10:31:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:31:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 105 transitions. [2018-11-23 10:31:28,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 105 transitions. [2018-11-23 10:31:29,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:31:29,436 INFO L225 Difference]: With dead ends: 108 [2018-11-23 10:31:29,436 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 10:31:29,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=144, Invalid=783, Unknown=3, NotChecked=0, Total=930 [2018-11-23 10:31:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 10:31:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2018-11-23 10:31:29,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:31:29,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 58 states. [2018-11-23 10:31:29,613 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 58 states. [2018-11-23 10:31:29,613 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 58 states. [2018-11-23 10:31:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:29,618 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-23 10:31:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-23 10:31:29,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:29,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:29,619 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 106 states. [2018-11-23 10:31:29,619 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 106 states. [2018-11-23 10:31:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:29,623 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-23 10:31:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-23 10:31:29,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:29,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:29,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:31:29,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:31:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 10:31:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-23 10:31:29,627 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 41 [2018-11-23 10:31:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:31:29,627 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-23 10:31:29,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 10:31:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-23 10:31:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 10:31:29,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:31:29,628 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:31:29,629 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:31:29,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:31:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash -699544460, now seen corresponding path program 1 times [2018-11-23 10:31:29,629 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:31:29,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:31:29,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:31:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:31:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:31:29,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:31:29,942 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 10:31:29,951 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 10:31:29,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:29,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:29,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:29,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 10:31:30,095 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 10:31:30,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:30,105 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 10:31:30,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:30,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:30,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:30,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 10:31:30,657 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 28 treesize of output 22 [2018-11-23 10:31:30,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:30,669 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-11-23 10:31:30,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:30,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:30,680 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 10:31:30,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-11-23 10:31:30,689 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:30,690 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (bvadd |main_~#a~0.offset| (_ bv8 32))))) (and (= (_ bv10 32) .cse0) (= (_ bv10 32) (select .cse1 (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_#t~mem6| .cse0) (= main_~DEFAULTVAL~0 (_ bv0 32))))) [2018-11-23 10:31:30,690 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:31:30,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2981#true} is VALID [2018-11-23 10:31:30,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {2981#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2981#true} is VALID [2018-11-23 10:31:30,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 10:31:30,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #72#return; {2981#true} is VALID [2018-11-23 10:31:30,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret7 := main(); {2981#true} is VALID [2018-11-23 10:31:30,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {2981#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2981#true} is VALID [2018-11-23 10:31:30,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {2981#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {3004#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:30,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {3004#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:30,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:30,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:30,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:30,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:30,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {3008#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3024#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:30,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {3024#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3024#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:30,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {3024#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3031#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:30,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {3031#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3031#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {3031#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~FIXEDVAL~0) (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3038#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {3038#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3038#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {3038#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {3038#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {3038#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,968 INFO L256 TraceCheckUtils]: 21: Hoare triple {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} ~cond := #in~cond; {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} assume !(0bv32 == ~cond); {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} assume true; {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,974 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #76#return; {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {3048#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:31,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:31,979 INFO L256 TraceCheckUtils]: 29: Hoare triple {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,979 INFO L273 TraceCheckUtils]: 30: Hoare triple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} ~cond := #in~cond; {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,980 INFO L273 TraceCheckUtils]: 31: Hoare triple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} assume !(0bv32 == ~cond); {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} assume true; {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} is VALID [2018-11-23 10:31:31,981 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3055#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv8 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_7| (_ bv12 32))))))} {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #76#return; {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:31,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem6; {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:31,983 INFO L273 TraceCheckUtils]: 35: Hoare triple {3074#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3099#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {3099#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3103#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:31,986 INFO L256 TraceCheckUtils]: 37: Hoare triple {3103#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3107#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:31:31,986 INFO L273 TraceCheckUtils]: 38: Hoare triple {3107#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3111#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:31:31,987 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2982#false} is VALID [2018-11-23 10:31:31,987 INFO L273 TraceCheckUtils]: 40: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2018-11-23 10:31:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:31:31,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:31:34,496 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 18 treesize of output 16 [2018-11-23 10:31:34,544 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-11-23 10:31:34,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:34,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:31:34,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:31:34,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2018-11-23 10:31:34,579 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:34,579 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) main_~FIXEDVAL~0) (bvadd |main_~#a~0.offset| (_ bv8 32))))) [2018-11-23 10:31:34,580 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:31:34,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2018-11-23 10:31:34,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {3121#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2982#false} is VALID [2018-11-23 10:31:34,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {3125#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3121#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:31:34,837 INFO L256 TraceCheckUtils]: 37: Hoare triple {3129#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3125#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:31:34,838 INFO L273 TraceCheckUtils]: 36: Hoare triple {3133#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3129#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-23 10:31:35,112 INFO L273 TraceCheckUtils]: 35: Hoare triple {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3133#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-23 10:31:35,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem6; {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:31:35,114 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2981#true} {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #76#return; {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:31:35,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 10:31:35,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {2981#true} assume !(0bv32 == ~cond); {2981#true} is VALID [2018-11-23 10:31:35,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {2981#true} ~cond := #in~cond; {2981#true} is VALID [2018-11-23 10:31:35,115 INFO L256 TraceCheckUtils]: 29: Hoare triple {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2981#true} is VALID [2018-11-23 10:31:35,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:31:35,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3137#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:31:35,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} havoc #t~mem6; {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,491 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2981#true} {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #76#return; {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 10:31:35,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {2981#true} assume !(0bv32 == ~cond); {2981#true} is VALID [2018-11-23 10:31:35,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {2981#true} ~cond := #in~cond; {2981#true} is VALID [2018-11-23 10:31:35,492 INFO L256 TraceCheckUtils]: 21: Hoare triple {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2981#true} is VALID [2018-11-23 10:31:35,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {3162#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {3203#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3187#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:31:35,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {3203#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3203#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:31:35,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3203#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:31:35,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:31:35,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:31:35,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:31:35,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:31:35,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {3226#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {3210#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:31:35,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {2981#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {3226#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:31:35,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {2981#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2981#true} is VALID [2018-11-23 10:31:35,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret7 := main(); {2981#true} is VALID [2018-11-23 10:31:35,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #72#return; {2981#true} is VALID [2018-11-23 10:31:35,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 10:31:35,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {2981#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2981#true} is VALID [2018-11-23 10:31:35,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2981#true} is VALID [2018-11-23 10:31:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:31:35,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:31:35,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-23 10:31:35,551 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-11-23 10:31:35,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:31:35,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:31:36,449 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 10:31:36,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:31:36,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:31:36,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:31:36,450 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 24 states. [2018-11-23 10:31:48,852 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-11-23 10:32:08,246 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-23 10:32:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:10,650 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2018-11-23 10:32:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 10:32:10,650 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-11-23 10:32:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:32:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:32:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 127 transitions. [2018-11-23 10:32:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:32:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 127 transitions. [2018-11-23 10:32:10,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 127 transitions. [2018-11-23 10:32:16,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 125 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 10:32:16,008 INFO L225 Difference]: With dead ends: 150 [2018-11-23 10:32:16,008 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 10:32:16,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=295, Invalid=1597, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 10:32:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 10:32:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 101. [2018-11-23 10:32:16,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:32:16,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 101 states. [2018-11-23 10:32:16,444 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 101 states. [2018-11-23 10:32:16,444 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 101 states. [2018-11-23 10:32:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:16,450 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-11-23 10:32:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-11-23 10:32:16,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:32:16,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:32:16,452 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 148 states. [2018-11-23 10:32:16,452 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 148 states. [2018-11-23 10:32:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:16,458 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-11-23 10:32:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-11-23 10:32:16,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:32:16,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:32:16,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:32:16,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:32:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 10:32:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-11-23 10:32:16,463 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 41 [2018-11-23 10:32:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:32:16,463 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-11-23 10:32:16,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:32:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-23 10:32:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 10:32:16,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:32:16,465 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:32:16,465 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:32:16,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:32:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash -405147355, now seen corresponding path program 4 times [2018-11-23 10:32:16,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:32:16,466 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:32:16,489 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:32:16,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:32:16,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:32:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:32:16,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:32:16,751 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 10:32:16,758 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 10:32:16,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:16,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:16,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:16,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 10:32:17,207 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 19 treesize of output 15 [2018-11-23 10:32:17,217 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 10:32:17,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:17,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:17,227 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 10:32:17,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-23 10:32:17,236 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:32:17,236 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (and (= (_ bv10 32) .cse0) (= |main_#t~mem6| .cse0) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:32:17,236 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:32:17,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {3922#true} call ULTIMATE.init(); {3922#true} is VALID [2018-11-23 10:32:17,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {3922#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3922#true} is VALID [2018-11-23 10:32:17,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {3922#true} assume true; {3922#true} is VALID [2018-11-23 10:32:17,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3922#true} {3922#true} #72#return; {3922#true} is VALID [2018-11-23 10:32:17,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {3922#true} call #t~ret7 := main(); {3922#true} is VALID [2018-11-23 10:32:17,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {3922#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3922#true} is VALID [2018-11-23 10:32:17,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {3922#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {3945#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {3945#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {3949#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {3965#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3978#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {3978#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3978#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {3978#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {3978#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {3978#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,318 INFO L256 TraceCheckUtils]: 21: Hoare triple {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,318 INFO L273 TraceCheckUtils]: 22: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} assume !(0bv32 == ~cond); {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,320 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #76#return; {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {3988#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,325 INFO L256 TraceCheckUtils]: 29: Hoare triple {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} assume !(0bv32 == ~cond); {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,327 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #76#return; {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem6; {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {4014#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,332 INFO L256 TraceCheckUtils]: 37: Hoare triple {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,334 INFO L273 TraceCheckUtils]: 39: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} assume !(0bv32 == ~cond); {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,334 INFO L273 TraceCheckUtils]: 40: Hoare triple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:17,335 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3995#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv12 32))) (_ bv4294967286 32)) (_ bv0 32)))} {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #76#return; {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,336 INFO L273 TraceCheckUtils]: 43: Hoare triple {4039#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4064#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,337 INFO L273 TraceCheckUtils]: 44: Hoare triple {4064#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4068#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:17,339 INFO L256 TraceCheckUtils]: 45: Hoare triple {4068#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4072#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:32:17,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {4072#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4076#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:32:17,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {4076#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3923#false} is VALID [2018-11-23 10:32:17,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {3923#false} assume !false; {3923#false} is VALID [2018-11-23 10:32:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 10:32:17,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:32:17,878 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 18 treesize of output 16 [2018-11-23 10:32:17,925 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-11-23 10:32:17,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:17,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:32:17,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:32:17,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2018-11-23 10:32:17,957 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:32:17,958 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967292 32)) main_~FIXEDVAL~0) (bvadd |main_~#a~0.offset| (_ bv12 32))))) [2018-11-23 10:32:17,958 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:32:18,121 INFO L273 TraceCheckUtils]: 48: Hoare triple {3923#false} assume !false; {3923#false} is VALID [2018-11-23 10:32:18,122 INFO L273 TraceCheckUtils]: 47: Hoare triple {4086#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3923#false} is VALID [2018-11-23 10:32:18,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {4090#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4086#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:32:18,125 INFO L256 TraceCheckUtils]: 45: Hoare triple {4094#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4090#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:32:18,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {4098#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4094#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-23 10:32:18,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4098#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-23 10:32:18,324 INFO L273 TraceCheckUtils]: 42: Hoare triple {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem6; {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:32:18,325 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3922#true} {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #76#return; {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:32:18,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {3922#true} assume true; {3922#true} is VALID [2018-11-23 10:32:18,326 INFO L273 TraceCheckUtils]: 39: Hoare triple {3922#true} assume !(0bv32 == ~cond); {3922#true} is VALID [2018-11-23 10:32:18,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {3922#true} ~cond := #in~cond; {3922#true} is VALID [2018-11-23 10:32:18,326 INFO L256 TraceCheckUtils]: 37: Hoare triple {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3922#true} is VALID [2018-11-23 10:32:18,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:32:18,609 INFO L273 TraceCheckUtils]: 35: Hoare triple {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4102#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-23 10:32:18,610 INFO L273 TraceCheckUtils]: 34: Hoare triple {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} havoc #t~mem6; {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:32:18,611 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3922#true} {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #76#return; {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:32:18,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {3922#true} assume true; {3922#true} is VALID [2018-11-23 10:32:18,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {3922#true} assume !(0bv32 == ~cond); {3922#true} is VALID [2018-11-23 10:32:18,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {3922#true} ~cond := #in~cond; {3922#true} is VALID [2018-11-23 10:32:18,612 INFO L256 TraceCheckUtils]: 29: Hoare triple {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3922#true} is VALID [2018-11-23 10:32:18,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:32:18,928 INFO L273 TraceCheckUtils]: 27: Hoare triple {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4127#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:32:18,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} havoc #t~mem6; {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:18,930 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3922#true} {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} #76#return; {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:18,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {3922#true} assume true; {3922#true} is VALID [2018-11-23 10:32:18,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {3922#true} assume !(0bv32 == ~cond); {3922#true} is VALID [2018-11-23 10:32:18,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {3922#true} ~cond := #in~cond; {3922#true} is VALID [2018-11-23 10:32:18,931 INFO L256 TraceCheckUtils]: 21: Hoare triple {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3922#true} is VALID [2018-11-23 10:32:18,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:18,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {4177#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} ~i~0 := 0bv32; {4152#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:18,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {4177#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {4177#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:32:18,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {4177#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4177#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:32:18,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {4177#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:32:18,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4187#(and (= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {4216#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {4200#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:18,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {3922#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {4216#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:32:18,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {3922#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3922#true} is VALID [2018-11-23 10:32:18,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {3922#true} call #t~ret7 := main(); {3922#true} is VALID [2018-11-23 10:32:18,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3922#true} {3922#true} #72#return; {3922#true} is VALID [2018-11-23 10:32:18,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {3922#true} assume true; {3922#true} is VALID [2018-11-23 10:32:18,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {3922#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3922#true} is VALID [2018-11-23 10:32:18,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {3922#true} call ULTIMATE.init(); {3922#true} is VALID [2018-11-23 10:32:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 10:32:18,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:32:18,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-23 10:32:18,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-11-23 10:32:18,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:32:18,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 10:32:20,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:32:20,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 10:32:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 10:32:20,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-11-23 10:32:20,185 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 25 states.