java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:21,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:21,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:21,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:21,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:21,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:21,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:21,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:21,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:21,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:21,804 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:21,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:21,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:21,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:21,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:21,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:21,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:21,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:21,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:21,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:21,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:21,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:21,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:21,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:21,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:21,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:21,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:21,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:21,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:21,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:21,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:21,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:21,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:21,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:21,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:21,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:21,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:21,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:21,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:21,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:21,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:21,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:21,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:21,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:21,881 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:21,882 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:21,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2019-08-05 11:01:21,883 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl' [2019-08-05 11:01:21,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:21,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:21,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:21,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:21,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:21,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:21,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:21,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:21,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:21,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:21,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:21,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:21,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:21,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:21,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:21,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:22,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:22,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/1) ... [2019-08-05 11:01:22,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:22,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:22,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:22,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:22,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:01:22,097 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:22,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:22,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:22,433 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:22,434 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:22,436 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:22 BoogieIcfgContainer [2019-08-05 11:01:22,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:22,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:22,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:22,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:22,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:21" (1/2) ... [2019-08-05 11:01:22,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7991da6a and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:22, skipping insertion in model container [2019-08-05 11:01:22,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:22" (2/2) ... [2019-08-05 11:01:22,445 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2019-08-05 11:01:22,471 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:22,486 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:22,518 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:22,556 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:22,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:22,557 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:22,557 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:22,557 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:22,558 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:22,558 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:22,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:22,558 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:01:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:01:22,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:22,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:01:22,593 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash 28695880, now seen corresponding path program 1 times [2019-08-05 11:01:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:22,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:01:22,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:22,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:01:22,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:01:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:01:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:22,847 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-05 11:01:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:22,927 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 11:01:22,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:01:22,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:01:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:22,939 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:01:22,939 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:01:22,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:01:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:01:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:01:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:01:22,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 11:01:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:22,972 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:01:22,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:01:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:01:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:01:22,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:22,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:01:22,974 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash 889625989, now seen corresponding path program 1 times [2019-08-05 11:01:22,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:23,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:23,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:01:23,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:23,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:23,145 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-05 11:01:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:23,259 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 11:01:23,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:23,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:01:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:23,261 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:01:23,261 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:01:23,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:01:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:01:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:01:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:01:23,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 11:01:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:23,277 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:01:23,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:01:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:01:23,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:23,278 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 11:01:23,279 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1808655592, now seen corresponding path program 2 times [2019-08-05 11:01:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:23,412 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_7|], 2=[|v_#valid_8|]} [2019-08-05 11:01:23,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:23,446 INFO L375 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 9 treesize of output 11 [2019-08-05 11:01:23,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:23,607 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:01:23,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:23,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:01:23,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:23,908 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-08-05 11:01:23,908 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:01:23,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:23,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:01:23,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:23,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:01:23,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:01:23,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:01:23,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:23,998 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-05 11:01:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:24,078 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 11:01:24,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:24,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:01:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:24,082 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:01:24,083 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:01:24,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:01:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-08-05 11:01:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:01:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:01:24,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2019-08-05 11:01:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:24,087 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:01:24,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:01:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:01:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:01:24,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:24,088 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1] [2019-08-05 11:01:24,088 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash -639911916, now seen corresponding path program 1 times [2019-08-05 11:01:24,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:24,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:01:24,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:01:24,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:24,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:01:24,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:24,390 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2019-08-05 11:01:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:24,578 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 11:01:24,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:24,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:01:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:24,580 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:01:24,580 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:01:24,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:01:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:01:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:01:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 11:01:24,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2019-08-05 11:01:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:24,584 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 11:01:24,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 11:01:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:01:24,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:24,585 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1] [2019-08-05 11:01:24,585 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1637620793, now seen corresponding path program 2 times [2019-08-05 11:01:24,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:24,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:01:24,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:24,831 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:24,832 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:01:24,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:24,893 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:01:24,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:24,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:24,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:21 [2019-08-05 11:01:24,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:25,026 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:01:25,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:25,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:25,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:25,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:25,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:01:25,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:25,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:01:25,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:25,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:25,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:25,296 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 5 states. [2019-08-05 11:01:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:25,528 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-08-05 11:01:25,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:01:25,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 11:01:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:25,529 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:01:25,529 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:01:25,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:01:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-08-05 11:01:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:01:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-08-05 11:01:25,534 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2019-08-05 11:01:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:25,534 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-08-05 11:01:25,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-08-05 11:01:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:01:25,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:25,535 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 1, 1, 1] [2019-08-05 11:01:25,536 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2021511882, now seen corresponding path program 3 times [2019-08-05 11:01:25,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:25,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:01:25,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:01:25,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:25,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:01:25,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:01:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:01:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:01:25,818 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2019-08-05 11:01:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:26,050 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-05 11:01:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:01:26,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-08-05 11:01:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:26,053 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:01:26,053 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:01:26,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:01:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:01:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:01:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:01:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 11:01:26,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2019-08-05 11:01:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:26,059 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 11:01:26,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:01:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 11:01:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:01:26,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:26,060 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 2, 1, 1, 1] [2019-08-05 11:01:26,061 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1757587389, now seen corresponding path program 4 times [2019-08-05 11:01:26,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:26,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:01:26,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:26,247 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_9|], 2=[|v_#valid_9|]} [2019-08-05 11:01:26,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:26,289 INFO L375 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 9 treesize of output 11 [2019-08-05 11:01:26,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:26,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:26,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:26,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:26,370 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:26,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:26,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:01:26,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:26,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:01:26,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:26,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:26,515 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 6 states. [2019-08-05 11:01:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:26,728 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-08-05 11:01:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:26,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-08-05 11:01:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:26,730 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:01:26,730 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:01:26,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:01:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-08-05 11:01:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:01:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-08-05 11:01:26,735 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-08-05 11:01:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:26,736 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-08-05 11:01:26,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-08-05 11:01:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:01:26,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:26,737 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 4, 3, 1, 1, 1] [2019-08-05 11:01:26,737 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:26,738 INFO L82 PathProgramCache]: Analyzing trace with hash -808690439, now seen corresponding path program 5 times [2019-08-05 11:01:26,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:26,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:01:26,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 59 proven. 70 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:01:27,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:27,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:01:27,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:01:27,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:01:27,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:01:27,028 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2019-08-05 11:01:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:27,234 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-08-05 11:01:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:01:27,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 11:01:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:27,236 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:01:27,236 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:01:27,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:01:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:01:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:01:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:01:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-08-05 11:01:27,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 27 [2019-08-05 11:01:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:27,241 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-08-05 11:01:27,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:01:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-08-05 11:01:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:01:27,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:27,242 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 4, 3, 1, 1, 1] [2019-08-05 11:01:27,243 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 700453876, now seen corresponding path program 6 times [2019-08-05 11:01:27,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:27,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:01:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:27,485 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_10|], 2=[|v_#valid_10|]} [2019-08-05 11:01:27,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:27,539 INFO L375 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 9 treesize of output 11 [2019-08-05 11:01:27,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:27,681 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:01:27,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:27,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:01:27,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:27,795 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:01:27,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:27,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:01:27,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:27,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:01:27,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:27,904 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2019-08-05 11:01:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:28,047 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-08-05 11:01:28,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:01:28,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-08-05 11:01:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:28,051 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:01:28,051 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:01:28,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:01:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2019-08-05 11:01:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:01:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-08-05 11:01:28,056 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2019-08-05 11:01:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:28,057 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-08-05 11:01:28,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-08-05 11:01:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:01:28,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:28,058 INFO L399 BasicCegarLoop]: trace histogram [19, 5, 5, 4, 1, 1, 1] [2019-08-05 11:01:28,058 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:28,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1700229467, now seen corresponding path program 7 times [2019-08-05 11:01:28,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:28,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:01:28,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 139 proven. 123 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:01:28,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:28,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:01:28,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:01:28,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:01:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:01:28,378 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2019-08-05 11:01:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:28,591 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-08-05 11:01:28,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:01:28,593 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-08-05 11:01:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:28,594 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:01:28,594 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:01:28,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:01:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:01:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:01:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:01:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-08-05 11:01:28,600 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2019-08-05 11:01:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:28,600 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-08-05 11:01:28,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:01:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-08-05 11:01:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:01:28,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:28,601 INFO L399 BasicCegarLoop]: trace histogram [20, 5, 5, 4, 1, 1, 1] [2019-08-05 11:01:28,602 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1167452216, now seen corresponding path program 8 times [2019-08-05 11:01:28,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:28,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:01:28,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:28,941 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 2=[|v_#valid_11|]} [2019-08-05 11:01:28,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:28,982 INFO L375 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 9 treesize of output 11 [2019-08-05 11:01:28,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:29,084 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:01:29,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:29,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:29,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:29,254 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 11:01:29,255 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:29,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:29,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:01:29,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:29,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:01:29,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:01:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:01:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:29,348 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2019-08-05 11:01:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:29,612 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-08-05 11:01:29,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:01:29,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-08-05 11:01:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:29,614 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:01:29,614 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:01:29,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:01:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:01:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-08-05 11:01:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:01:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-08-05 11:01:29,619 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 37 [2019-08-05 11:01:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:29,619 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-08-05 11:01:29,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:01:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-08-05 11:01:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:01:29,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:29,620 INFO L399 BasicCegarLoop]: trace histogram [26, 6, 6, 5, 1, 1, 1] [2019-08-05 11:01:29,621 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1915036276, now seen corresponding path program 9 times [2019-08-05 11:01:29,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:29,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:01:29,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 275 proven. 196 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:01:30,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:30,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:01:30,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:01:30,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:01:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:01:30,369 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 15 states. [2019-08-05 11:01:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:30,932 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-08-05 11:01:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:01:30,933 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-08-05 11:01:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:30,934 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:01:30,934 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:01:30,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:01:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:01:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:01:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:01:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-08-05 11:01:30,951 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 46 [2019-08-05 11:01:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:30,952 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-08-05 11:01:30,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:01:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-08-05 11:01:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:01:30,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:30,953 INFO L399 BasicCegarLoop]: trace histogram [27, 6, 6, 5, 1, 1, 1] [2019-08-05 11:01:30,953 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -763363879, now seen corresponding path program 10 times [2019-08-05 11:01:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:31,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:01:31,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:31,424 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_12|], 2=[|v_#valid_12|]} [2019-08-05 11:01:31,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:31,481 INFO L375 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 9 treesize of output 11 [2019-08-05 11:01:31,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:31,615 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:01:31,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:31,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:31,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:32,091 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 11:01:32,092 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:32,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:32,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-08-05 11:01:32,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:32,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:01:32,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:01:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:01:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:01:32,436 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2019-08-05 11:01:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:32,728 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-08-05 11:01:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:01:32,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-08-05 11:01:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:32,731 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:01:32,731 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:01:32,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:01:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2019-08-05 11:01:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:01:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2019-08-05 11:01:32,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 47 [2019-08-05 11:01:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:32,737 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2019-08-05 11:01:32,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:01:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2019-08-05 11:01:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:01:32,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:32,739 INFO L399 BasicCegarLoop]: trace histogram [34, 7, 7, 6, 1, 1, 1] [2019-08-05 11:01:32,739 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash -266452310, now seen corresponding path program 11 times [2019-08-05 11:01:32,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:32,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:01:32,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 487 proven. 292 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-08-05 11:01:33,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:33,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:01:33,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:01:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:01:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:01:33,909 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 17 states. [2019-08-05 11:01:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:34,196 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-08-05 11:01:34,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:01:34,196 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-08-05 11:01:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:34,198 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:01:34,198 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:01:34,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:01:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:01:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:01:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:01:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-08-05 11:01:34,203 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 57 [2019-08-05 11:01:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:34,203 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-08-05 11:01:34,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:01:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-08-05 11:01:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:01:34,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:34,205 INFO L399 BasicCegarLoop]: trace histogram [35, 7, 7, 6, 1, 1, 1] [2019-08-05 11:01:34,205 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash 329966691, now seen corresponding path program 12 times [2019-08-05 11:01:34,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:34,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:01:34,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:34,844 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_13|], 2=[|v_#valid_13|]} [2019-08-05 11:01:34,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:34,892 INFO L375 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 9 treesize of output 11 [2019-08-05 11:01:34,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:35,039 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:01:35,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:35,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:01:35,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:35,392 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-08-05 11:01:35,393 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:01:35,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:35,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-08-05 11:01:35,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:35,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:01:35,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:01:35,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:01:35,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:35,630 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 10 states. [2019-08-05 11:01:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:35,960 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-08-05 11:01:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:01:35,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-08-05 11:01:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:35,961 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:01:35,961 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:01:35,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:01:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:01:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2019-08-05 11:01:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:01:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2019-08-05 11:01:35,968 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 58 [2019-08-05 11:01:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:35,968 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2019-08-05 11:01:35,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:01:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2019-08-05 11:01:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:01:35,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:35,970 INFO L399 BasicCegarLoop]: trace histogram [43, 8, 8, 7, 1, 1, 1] [2019-08-05 11:01:35,970 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 345465753, now seen corresponding path program 13 times [2019-08-05 11:01:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:36,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:01:36,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 798 proven. 414 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-08-05 11:01:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:36,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:01:36,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:01:36,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:01:36,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:01:36,559 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 19 states. [2019-08-05 11:01:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:36,863 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2019-08-05 11:01:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:01:36,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-08-05 11:01:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:36,864 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:01:36,864 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:01:36,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=486, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:01:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:01:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:01:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:01:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-08-05 11:01:36,871 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 69 [2019-08-05 11:01:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:36,871 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-08-05 11:01:36,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:01:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-08-05 11:01:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:01:36,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:36,873 INFO L399 BasicCegarLoop]: trace histogram [44, 8, 8, 7, 1, 1, 1] [2019-08-05 11:01:36,873 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:36,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2119557460, now seen corresponding path program 14 times [2019-08-05 11:01:36,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:37,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:01:37,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:38,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:38,036 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:01:38,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:38,068 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:01:38,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:38,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:01:38,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 0 proven. 1224 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-08-05 11:01:38,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:38,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:01:38,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:01:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:01:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:01:38,358 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 13 states. [2019-08-05 11:01:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:38,901 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-08-05 11:01:38,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:01:38,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-08-05 11:01:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:38,903 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:01:38,903 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:01:38,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:01:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:01:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2019-08-05 11:01:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:01:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-08-05 11:01:38,909 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 70 [2019-08-05 11:01:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:38,910 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-08-05 11:01:38,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:01:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-08-05 11:01:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:01:38,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:38,911 INFO L399 BasicCegarLoop]: trace histogram [53, 9, 9, 8, 1, 1, 1] [2019-08-05 11:01:38,912 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:38,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1111491387, now seen corresponding path program 15 times [2019-08-05 11:01:38,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:39,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:01:39,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 1234 proven. 565 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-08-05 11:01:39,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:39,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:01:39,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:01:39,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:01:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:01:39,998 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 21 states. [2019-08-05 11:01:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:40,510 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-08-05 11:01:40,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:01:40,510 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2019-08-05 11:01:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:40,512 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:01:40,512 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:01:40,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=330, Invalid=600, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:01:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:01:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:01:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:01:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-08-05 11:01:40,516 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 82 [2019-08-05 11:01:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:40,517 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-08-05 11:01:40,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:01:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-08-05 11:01:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:01:40,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:40,518 INFO L399 BasicCegarLoop]: trace histogram [54, 9, 9, 8, 1, 1, 1] [2019-08-05 11:01:40,519 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash -96440920, now seen corresponding path program 16 times [2019-08-05 11:01:40,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:41,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:01:41,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:41,844 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_15|], 2=[|v_#valid_14|]} [2019-08-05 11:01:41,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:41,885 INFO L375 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 9 treesize of output 11 [2019-08-05 11:01:41,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:41,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:41,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:01:41,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:41,954 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:01:41,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:41,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:01:42,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:42,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:01:42,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:01:42,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:01:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:01:42,090 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 12 states. [2019-08-05 11:01:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:42,484 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-08-05 11:01:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:01:42,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-08-05 11:01:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:42,485 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:01:42,486 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:01:42,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:01:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:01:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2019-08-05 11:01:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:01:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-08-05 11:01:42,490 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 83 [2019-08-05 11:01:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:42,490 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-08-05 11:01:42,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:01:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-08-05 11:01:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:01:42,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:42,492 INFO L399 BasicCegarLoop]: trace histogram [64, 10, 10, 9, 1, 1, 1] [2019-08-05 11:01:42,492 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash 295668180, now seen corresponding path program 17 times [2019-08-05 11:01:42,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:42,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:01:42,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 1824 proven. 748 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:01:42,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:42,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:01:42,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:01:42,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:01:42,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:01:42,959 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 23 states. [2019-08-05 11:01:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:43,509 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2019-08-05 11:01:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:01:43,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2019-08-05 11:01:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:43,511 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:01:43,511 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:01:43,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:01:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:01:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:01:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:01:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-08-05 11:01:43,515 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 96 [2019-08-05 11:01:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:43,516 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-08-05 11:01:43,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:01:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-08-05 11:01:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:01:43,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:43,517 INFO L399 BasicCegarLoop]: trace histogram [65, 10, 10, 9, 1, 1, 1] [2019-08-05 11:01:43,517 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 575832697, now seen corresponding path program 18 times [2019-08-05 11:01:43,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:45,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:01:45,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:45,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:45,997 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:01:45,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:45,998 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:01:45,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,355 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-08-05 11:01:46,355 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:01:46,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:01:46,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:46,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2865 backedges. 0 proven. 2626 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-08-05 11:01:46,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:46,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:01:46,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:01:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:01:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:01:46,828 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 18 states. [2019-08-05 11:01:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:47,694 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2019-08-05 11:01:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:01:47,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-08-05 11:01:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:47,696 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:01:47,696 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:01:47,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:01:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:01:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2019-08-05 11:01:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:01:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2019-08-05 11:01:47,700 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 97 [2019-08-05 11:01:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:47,700 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2019-08-05 11:01:47,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:01:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2019-08-05 11:01:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:01:47,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:47,702 INFO L399 BasicCegarLoop]: trace histogram [76, 11, 11, 10, 1, 1, 1] [2019-08-05 11:01:47,702 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1129534858, now seen corresponding path program 19 times [2019-08-05 11:01:47,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:47,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:01:47,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 2600 proven. 966 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-08-05 11:01:48,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:48,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:01:48,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:01:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:01:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:01:48,366 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 25 states. [2019-08-05 11:01:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:48,720 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2019-08-05 11:01:48,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:01:48,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 111 [2019-08-05 11:01:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:48,724 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:01:48,724 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:01:48,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:01:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:01:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:01:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:01:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2019-08-05 11:01:48,727 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 111 [2019-08-05 11:01:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:48,728 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2019-08-05 11:01:48,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:01:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2019-08-05 11:01:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:01:48,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:48,729 INFO L399 BasicCegarLoop]: trace histogram [77, 11, 11, 10, 1, 1, 1] [2019-08-05 11:01:48,729 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash 655895939, now seen corresponding path program 20 times [2019-08-05 11:01:48,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:51,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:01:51,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:51,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:51,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:51,186 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:01:51,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,209 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:01:51,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:01:51,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:51,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3938 backedges. 0 proven. 3585 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-08-05 11:01:51,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:51,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:01:51,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:01:51,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:01:51,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:01:51,724 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand 17 states. [2019-08-05 11:01:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:52,667 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2019-08-05 11:01:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:01:52,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2019-08-05 11:01:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:52,669 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:01:52,669 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 11:01:52,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:01:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 11:01:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2019-08-05 11:01:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:01:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2019-08-05 11:01:52,673 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 112 [2019-08-05 11:01:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:52,673 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2019-08-05 11:01:52,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:01:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2019-08-05 11:01:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:01:52,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:52,674 INFO L399 BasicCegarLoop]: trace histogram [89, 12, 12, 11, 1, 1, 1] [2019-08-05 11:01:52,674 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1634087623, now seen corresponding path program 21 times [2019-08-05 11:01:52,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:52,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:01:52,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5182 backedges. 3597 proven. 1222 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-08-05 11:01:53,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:53,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:01:53,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:01:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:01:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:01:53,581 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand 27 states. [2019-08-05 11:01:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:54,256 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2019-08-05 11:01:54,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:01:54,256 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2019-08-05 11:01:54,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:54,258 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:01:54,258 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:01:54,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=546, Invalid=1014, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:01:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:01:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 11:01:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:01:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2019-08-05 11:01:54,263 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 127 [2019-08-05 11:01:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:54,264 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2019-08-05 11:01:54,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:01:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2019-08-05 11:01:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 11:01:54,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:54,265 INFO L399 BasicCegarLoop]: trace histogram [90, 12, 12, 11, 1, 1, 1] [2019-08-05 11:01:54,265 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:54,265 INFO L82 PathProgramCache]: Analyzing trace with hash 882944948, now seen corresponding path program 22 times [2019-08-05 11:01:54,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:57,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 2124 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:01:57,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:58,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:58,052 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:58,053 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:01:58,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:58,081 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:01:58,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:58,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:01:58,591 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:01:58,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:58,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5283 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-08-05 11:01:59,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:59,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:01:59,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:01:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:01:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:01:59,037 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand 18 states. [2019-08-05 11:02:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:01,072 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2019-08-05 11:02:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:02:01,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 128 [2019-08-05 11:02:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:01,076 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:02:01,076 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 11:02:01,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 11:02:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2019-08-05 11:02:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:02:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2019-08-05 11:02:01,080 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 128 [2019-08-05 11:02:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:01,080 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2019-08-05 11:02:01,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:02:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2019-08-05 11:02:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 11:02:01,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:01,081 INFO L399 BasicCegarLoop]: trace histogram [103, 13, 13, 12, 1, 1, 1] [2019-08-05 11:02:01,082 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1039181797, now seen corresponding path program 23 times [2019-08-05 11:02:01,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:01,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 2398 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:02:01,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6826 backedges. 4853 proven. 1519 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2019-08-05 11:02:01,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:01,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:02:01,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:02:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:02:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:02:01,704 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 29 states. [2019-08-05 11:02:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:02,215 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2019-08-05 11:02:02,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:02:02,216 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-08-05 11:02:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:02,217 INFO L225 Difference]: With dead ends: 146 [2019-08-05 11:02:02,217 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 11:02:02,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=1176, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:02:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 11:02:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 11:02:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:02:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2019-08-05 11:02:02,221 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 144 [2019-08-05 11:02:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:02,222 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2019-08-05 11:02:02,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:02:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2019-08-05 11:02:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:02:02,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:02,222 INFO L399 BasicCegarLoop]: trace histogram [104, 13, 13, 12, 1, 1, 1] [2019-08-05 11:02:02,223 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:02,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2145048952, now seen corresponding path program 24 times [2019-08-05 11:02:02,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:05,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 2416 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:02:05,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:05,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:05,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:05,813 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:02:05,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:05,847 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:02:05,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:05,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:02:06,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:06,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6942 backedges. 0 proven. 6439 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2019-08-05 11:02:06,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:06,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:02:06,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:02:06,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:02:06,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:02:06,632 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 23 states. [2019-08-05 11:02:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:07,683 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2019-08-05 11:02:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:02:07,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2019-08-05 11:02:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:07,685 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:02:07,685 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:02:07,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:02:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:02:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2019-08-05 11:02:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 11:02:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2019-08-05 11:02:07,690 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 145 [2019-08-05 11:02:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:07,690 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2019-08-05 11:02:07,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:02:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2019-08-05 11:02:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 11:02:07,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:07,692 INFO L399 BasicCegarLoop]: trace histogram [118, 14, 14, 13, 1, 1, 1] [2019-08-05 11:02:07,692 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2075340340, now seen corresponding path program 25 times [2019-08-05 11:02:07,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:07,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:02:07,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8828 backedges. 6409 proven. 1860 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-08-05 11:02:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:02:08,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:02:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:02:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:02:08,274 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand 31 states. [2019-08-05 11:02:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:09,244 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2019-08-05 11:02:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:02:09,245 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 162 [2019-08-05 11:02:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:09,246 INFO L225 Difference]: With dead ends: 164 [2019-08-05 11:02:09,246 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 11:02:09,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:02:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 11:02:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 11:02:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:02:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2019-08-05 11:02:09,251 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 162 [2019-08-05 11:02:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:09,251 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2019-08-05 11:02:09,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:02:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2019-08-05 11:02:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:02:09,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:09,252 INFO L399 BasicCegarLoop]: trace histogram [119, 14, 14, 13, 1, 1, 1] [2019-08-05 11:02:09,252 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash -88905191, now seen corresponding path program 26 times [2019-08-05 11:02:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:16,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 2726 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:02:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:16,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:16,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:16,477 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:02:16,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:16,504 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:02:16,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:16,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:02:16,742 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:02:16,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:17,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8960 backedges. 0 proven. 8297 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-08-05 11:02:17,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:17,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:02:17,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:02:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:02:17,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:02:17,610 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand 20 states. [2019-08-05 11:02:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:18,813 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2019-08-05 11:02:18,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:02:18,813 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 163 [2019-08-05 11:02:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:18,815 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:02:18,815 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:02:18,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:02:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:02:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2019-08-05 11:02:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:02:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2019-08-05 11:02:18,820 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 163 [2019-08-05 11:02:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:18,820 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2019-08-05 11:02:18,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:02:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2019-08-05 11:02:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:02:18,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:18,822 INFO L399 BasicCegarLoop]: trace histogram [134, 15, 15, 14, 1, 1, 1] [2019-08-05 11:02:18,822 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:18,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:18,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1121471338, now seen corresponding path program 27 times [2019-08-05 11:02:18,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:19,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:02:19,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 8309 proven. 2248 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2019-08-05 11:02:19,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:19,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:02:19,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:02:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:02:19,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:02:19,594 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand 33 states. [2019-08-05 11:02:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:20,359 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2019-08-05 11:02:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:02:20,359 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 181 [2019-08-05 11:02:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:20,361 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:02:20,361 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:02:20,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=816, Invalid=1536, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:02:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:02:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-08-05 11:02:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 11:02:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2019-08-05 11:02:20,367 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 181 [2019-08-05 11:02:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:20,367 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2019-08-05 11:02:20,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:02:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2019-08-05 11:02:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-08-05 11:02:20,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:20,368 INFO L399 BasicCegarLoop]: trace histogram [135, 15, 15, 14, 1, 1, 1] [2019-08-05 11:02:20,369 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash 405926819, now seen corresponding path program 28 times [2019-08-05 11:02:20,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:28,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 3054 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:02:28,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:28,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:28,389 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:02:28,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,413 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:02:28,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:02:28,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:29,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11385 backedges. 0 proven. 10598 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2019-08-05 11:02:29,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:29,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:02:29,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:02:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:02:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:02:29,421 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand 22 states. [2019-08-05 11:02:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:30,665 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2019-08-05 11:02:30,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:02:30,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 182 [2019-08-05 11:02:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:30,667 INFO L225 Difference]: With dead ends: 220 [2019-08-05 11:02:30,667 INFO L226 Difference]: Without dead ends: 220 [2019-08-05 11:02:30,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:02:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-08-05 11:02:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 202. [2019-08-05 11:02:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:02:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 218 transitions. [2019-08-05 11:02:30,672 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 218 transitions. Word has length 182 [2019-08-05 11:02:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:30,673 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 218 transitions. [2019-08-05 11:02:30,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:02:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 218 transitions. [2019-08-05 11:02:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:02:30,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:30,674 INFO L399 BasicCegarLoop]: trace histogram [151, 16, 16, 15, 1, 1, 1] [2019-08-05 11:02:30,674 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash -689284647, now seen corresponding path program 29 times [2019-08-05 11:02:30,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 3382 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:02:31,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14101 backedges. 10600 proven. 2686 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-08-05 11:02:32,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:32,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:02:32,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:02:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:02:32,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:02:32,004 INFO L87 Difference]: Start difference. First operand 202 states and 218 transitions. Second operand 35 states. [2019-08-05 11:02:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:33,247 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-08-05 11:02:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:02:33,248 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 201 [2019-08-05 11:02:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:33,250 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:02:33,250 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:02:33,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=918, Invalid=1734, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:02:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:02:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-05 11:02:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 11:02:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2019-08-05 11:02:33,255 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 201 [2019-08-05 11:02:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:33,256 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2019-08-05 11:02:33,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:02:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2019-08-05 11:02:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-05 11:02:33,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:33,257 INFO L399 BasicCegarLoop]: trace histogram [152, 16, 16, 15, 1, 1, 1] [2019-08-05 11:02:33,257 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 107066132, now seen corresponding path program 30 times [2019-08-05 11:02:33,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:44,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 3400 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:02:44,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:44,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:44,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:44,500 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:02:44,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:44,546 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:02:44,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:44,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:02:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14268 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2019-08-05 11:02:45,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:45,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:02:45,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:02:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:02:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:02:45,187 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand 22 states. [2019-08-05 11:02:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:46,726 INFO L93 Difference]: Finished difference Result 242 states and 260 transitions. [2019-08-05 11:02:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:02:46,726 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 202 [2019-08-05 11:02:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:46,728 INFO L225 Difference]: With dead ends: 242 [2019-08-05 11:02:46,728 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 11:02:46,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:02:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 11:02:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 223. [2019-08-05 11:02:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 11:02:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 240 transitions. [2019-08-05 11:02:46,734 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 240 transitions. Word has length 202 [2019-08-05 11:02:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:46,734 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 240 transitions. [2019-08-05 11:02:46,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:02:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 240 transitions. [2019-08-05 11:02:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-08-05 11:02:46,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:46,736 INFO L399 BasicCegarLoop]: trace histogram [169, 17, 17, 16, 1, 1, 1] [2019-08-05 11:02:46,736 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1245687803, now seen corresponding path program 31 times [2019-08-05 11:02:46,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:47,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 3746 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:02:47,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17477 backedges. 13332 proven. 3177 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-08-05 11:02:49,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:49,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:02:49,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:02:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:02:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:02:49,019 INFO L87 Difference]: Start difference. First operand 223 states and 240 transitions. Second operand 37 states. [2019-08-05 11:02:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:50,194 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2019-08-05 11:02:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:02:50,194 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 222 [2019-08-05 11:02:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:50,197 INFO L225 Difference]: With dead ends: 224 [2019-08-05 11:02:50,197 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 11:02:50,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1944, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:02:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 11:02:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-08-05 11:02:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 11:02:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 241 transitions. [2019-08-05 11:02:50,202 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 241 transitions. Word has length 222 [2019-08-05 11:02:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:50,203 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 241 transitions. [2019-08-05 11:02:50,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:02:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 241 transitions. [2019-08-05 11:02:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 11:02:50,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:50,204 INFO L399 BasicCegarLoop]: trace histogram [170, 17, 17, 16, 1, 1, 1] [2019-08-05 11:02:50,205 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash 38437480, now seen corresponding path program 32 times [2019-08-05 11:02:50,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:09,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 3764 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:03:09,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:09,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:09,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:09,768 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:03:09,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:09,792 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:03:09,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:09,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:03:10,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:03:10,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:03:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17663 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2019-08-05 11:03:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:10,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:03:10,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:03:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:03:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:10,699 INFO L87 Difference]: Start difference. First operand 224 states and 241 transitions. Second operand 23 states. [2019-08-05 11:03:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:12,574 INFO L93 Difference]: Finished difference Result 265 states and 284 transitions. [2019-08-05 11:03:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:03:12,575 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 223 [2019-08-05 11:03:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:12,577 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:03:12,577 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:03:12,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:03:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:03:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 245. [2019-08-05 11:03:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-05 11:03:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-08-05 11:03:12,581 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 223 [2019-08-05 11:03:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:12,582 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-08-05 11:03:12,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:03:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-08-05 11:03:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-08-05 11:03:12,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:12,583 INFO L399 BasicCegarLoop]: trace histogram [188, 18, 18, 17, 1, 1, 1] [2019-08-05 11:03:12,584 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1294618516, now seen corresponding path program 33 times [2019-08-05 11:03:12,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:13,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 4128 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:03:13,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21421 backedges. 16558 proven. 3724 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-08-05 11:03:13,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:13,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:03:13,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:03:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:03:13,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:03:13,843 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 39 states. [2019-08-05 11:03:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:14,629 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2019-08-05 11:03:14,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:03:14,630 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 244 [2019-08-05 11:03:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:14,632 INFO L225 Difference]: With dead ends: 246 [2019-08-05 11:03:14,632 INFO L226 Difference]: Without dead ends: 246 [2019-08-05 11:03:14,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1140, Invalid=2166, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:03:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-08-05 11:03:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2019-08-05 11:03:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-08-05 11:03:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 264 transitions. [2019-08-05 11:03:14,638 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 264 transitions. Word has length 244 [2019-08-05 11:03:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:14,638 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 264 transitions. [2019-08-05 11:03:14,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:03:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 264 transitions. [2019-08-05 11:03:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-08-05 11:03:14,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:14,640 INFO L399 BasicCegarLoop]: trace histogram [189, 18, 18, 17, 1, 1, 1] [2019-08-05 11:03:14,640 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1478522041, now seen corresponding path program 34 times [2019-08-05 11:03:14,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:38,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 4146 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:03:38,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:39,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:39,054 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:39,055 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:03:39,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:39,080 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:03:39,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:39,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:03:39,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:03:39,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:03:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21627 backedges. 0 proven. 20339 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2019-08-05 11:03:40,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:40,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:03:40,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:03:40,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:03:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:03:40,169 INFO L87 Difference]: Start difference. First operand 246 states and 264 transitions. Second operand 26 states. [2019-08-05 11:03:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:42,143 INFO L93 Difference]: Finished difference Result 289 states and 309 transitions. [2019-08-05 11:03:42,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:03:42,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 245 [2019-08-05 11:03:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:42,146 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:03:42,146 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:03:42,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:03:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:03:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 268. [2019-08-05 11:03:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 11:03:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 287 transitions. [2019-08-05 11:03:42,150 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 287 transitions. Word has length 245 [2019-08-05 11:03:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:42,151 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 287 transitions. [2019-08-05 11:03:42,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:03:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 287 transitions. [2019-08-05 11:03:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 11:03:42,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:42,153 INFO L399 BasicCegarLoop]: trace histogram [208, 19, 19, 18, 1, 1, 1] [2019-08-05 11:03:42,153 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:42,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:42,153 INFO L82 PathProgramCache]: Analyzing trace with hash -859413430, now seen corresponding path program 35 times [2019-08-05 11:03:42,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:42,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 4528 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:03:42,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 20334 proven. 4330 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2019-08-05 11:03:43,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:43,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:03:43,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:03:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:03:43,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:03:43,956 INFO L87 Difference]: Start difference. First operand 268 states and 287 transitions. Second operand 41 states. [2019-08-05 11:03:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:44,784 INFO L93 Difference]: Finished difference Result 269 states and 288 transitions. [2019-08-05 11:03:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:03:44,785 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 267 [2019-08-05 11:03:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:44,787 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:03:44,787 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:03:44,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1260, Invalid=2400, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:03:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:03:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-08-05 11:03:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-08-05 11:03:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 288 transitions. [2019-08-05 11:03:44,792 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 288 transitions. Word has length 267 [2019-08-05 11:03:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:44,793 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 288 transitions. [2019-08-05 11:03:44,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:03:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 288 transitions. [2019-08-05 11:03:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-08-05 11:03:44,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:44,794 INFO L399 BasicCegarLoop]: trace histogram [209, 19, 19, 18, 1, 1, 1] [2019-08-05 11:03:44,794 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash -871958845, now seen corresponding path program 36 times [2019-08-05 11:03:44,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:08,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 4546 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:04:08,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:08,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:08,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:08,723 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:04:08,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:08,746 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:04:08,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:08,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:04:09,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:09,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 24743 refuted. 0 times theorem prover too weak. 1477 trivial. 0 not checked. [2019-08-05 11:04:09,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:09,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:04:09,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:04:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:04:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:09,935 INFO L87 Difference]: Start difference. First operand 269 states and 288 transitions. Second operand 28 states. [2019-08-05 11:04:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:11,932 INFO L93 Difference]: Finished difference Result 314 states and 335 transitions. [2019-08-05 11:04:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:04:11,932 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 268 [2019-08-05 11:04:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:11,934 INFO L225 Difference]: With dead ends: 314 [2019-08-05 11:04:11,934 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 11:04:11,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 11:04:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 292. [2019-08-05 11:04:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 11:04:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 312 transitions. [2019-08-05 11:04:11,939 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 312 transitions. Word has length 268 [2019-08-05 11:04:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:11,939 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 312 transitions. [2019-08-05 11:04:11,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:04:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 312 transitions. [2019-08-05 11:04:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-08-05 11:04:11,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:11,941 INFO L399 BasicCegarLoop]: trace histogram [229, 20, 20, 19, 1, 1, 1] [2019-08-05 11:04:11,942 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:11,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash -134362759, now seen corresponding path program 37 times [2019-08-05 11:04:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:12,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 4946 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:04:12,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 31256 backedges. 24719 proven. 4998 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2019-08-05 11:04:13,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:13,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:04:13,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:04:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:04:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:04:13,628 INFO L87 Difference]: Start difference. First operand 292 states and 312 transitions. Second operand 43 states. [2019-08-05 11:04:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:14,369 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2019-08-05 11:04:14,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:04:14,370 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 291 [2019-08-05 11:04:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:14,371 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:04:14,372 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:04:14,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1386, Invalid=2646, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:04:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:04:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-08-05 11:04:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-08-05 11:04:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 313 transitions. [2019-08-05 11:04:14,377 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 313 transitions. Word has length 291 [2019-08-05 11:04:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:14,377 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 313 transitions. [2019-08-05 11:04:14,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:04:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 313 transitions. [2019-08-05 11:04:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-08-05 11:04:14,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:14,378 INFO L399 BasicCegarLoop]: trace histogram [230, 20, 20, 19, 1, 1, 1] [2019-08-05 11:04:14,378 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash 129775476, now seen corresponding path program 38 times [2019-08-05 11:04:14,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:57,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 4964 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:04:57,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:57,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:57,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:57,832 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:04:57,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:57,858 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:04:57,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:57,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2019-08-05 11:04:57,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:58,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 31505 backedges. 0 proven. 29744 refuted. 0 times theorem prover too weak. 1761 trivial. 0 not checked. [2019-08-05 11:04:58,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:58,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:04:58,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:04:58,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:04:58,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=598, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:58,909 INFO L87 Difference]: Start difference. First operand 293 states and 313 transitions. Second operand 26 states. [2019-08-05 11:05:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:01,099 INFO L93 Difference]: Finished difference Result 340 states and 362 transitions. [2019-08-05 11:05:01,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:01,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 292 [2019-08-05 11:05:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:01,107 INFO L225 Difference]: With dead ends: 340 [2019-08-05 11:05:01,107 INFO L226 Difference]: Without dead ends: 340 [2019-08-05 11:05:01,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-08-05 11:05:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 317. [2019-08-05 11:05:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-08-05 11:05:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 338 transitions. [2019-08-05 11:05:01,112 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 338 transitions. Word has length 292 [2019-08-05 11:05:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:01,112 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 338 transitions. [2019-08-05 11:05:01,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 338 transitions. [2019-08-05 11:05:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-08-05 11:05:01,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:01,114 INFO L399 BasicCegarLoop]: trace histogram [251, 21, 21, 20, 1, 1, 1] [2019-08-05 11:05:01,114 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash 756462885, now seen corresponding path program 39 times [2019-08-05 11:05:01,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:01,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 5382 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:05:01,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 37276 backedges. 29775 proven. 5731 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-08-05 11:05:02,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:02,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:05:02,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:05:02,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:05:02,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:02,687 INFO L87 Difference]: Start difference. First operand 317 states and 338 transitions. Second operand 45 states. [2019-08-05 11:05:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:04,252 INFO L93 Difference]: Finished difference Result 318 states and 339 transitions. [2019-08-05 11:05:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:05:04,252 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 316 [2019-08-05 11:05:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:04,254 INFO L225 Difference]: With dead ends: 318 [2019-08-05 11:05:04,254 INFO L226 Difference]: Without dead ends: 318 [2019-08-05 11:05:04,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1518, Invalid=2904, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:05:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-08-05 11:05:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-08-05 11:05:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-08-05 11:05:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 339 transitions. [2019-08-05 11:05:04,260 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 339 transitions. Word has length 316 [2019-08-05 11:05:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:04,261 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 339 transitions. [2019-08-05 11:05:04,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:05:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 339 transitions. [2019-08-05 11:05:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-08-05 11:05:04,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:04,263 INFO L399 BasicCegarLoop]: trace histogram [252, 21, 21, 20, 1, 1, 1] [2019-08-05 11:05:04,263 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1975566664, now seen corresponding path program 40 times [2019-08-05 11:05:04,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-05 11:05:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-08-05 11:05:38,252 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 11:05:38,253 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:05:38,344 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 11:05:38,344 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:05:38 BoogieIcfgContainer [2019-08-05 11:05:38,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:05:38,346 INFO L168 Benchmark]: Toolchain (without parser) took 256415.67 ms. Allocated memory was 140.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 109.7 MB in the beginning and 732.7 MB in the end (delta: -623.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-08-05 11:05:38,346 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:05:38,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 140.5 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:38,347 INFO L168 Benchmark]: Boogie Preprocessor took 40.83 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:38,348 INFO L168 Benchmark]: RCFGBuilder took 424.44 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 93.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:38,348 INFO L168 Benchmark]: TraceAbstraction took 255906.79 ms. Allocated memory was 140.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.4 MB in the beginning and 732.7 MB in the end (delta: -639.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-08-05 11:05:38,351 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 140.5 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.83 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.44 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 93.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255906.79 ms. Allocated memory was 140.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.4 MB in the beginning and 732.7 MB in the end (delta: -639.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 138]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L52] #NULL.offset, #NULL.base := 0, 0; [L53] #valid := #valid[0 := 0]; [L54] main_old_#valid := #valid; [L55] havoc main_#res; [L56] havoc main_#t~post2, main_~#b~0.base, main_~#mask~0.base, main_~#mask~0.offset, main_~i~1, main_~#b~0.offset, main_#t~mem5, main_#t~ret3, main_#t~post4; [L57] havoc main_~i~1; [L58] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L59] #Ultimate.alloc_~size := 128; [L60] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L61] havoc #valid, #length; [L62] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L63] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1] == #valid; [L64] assume #Ultimate.alloc_#res.offset == 0; [L65] assume !(0 == #Ultimate.alloc_#res.base); [L66] assume #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size] == #length; [L67] main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L68] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L69] #Ultimate.alloc_~size := 32; [L70] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L71] havoc #valid, #length; [L72] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L73] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L74] assume #Ultimate.alloc_#res.offset == 0; [L75] assume !(0 == #Ultimate.alloc_#res.base); [L76] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L77] main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L78] main_~i~1 := 0; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] havoc main_#t~ret3; [L133] main_#t~post2 := main_~i~1; [L134] main_~i~1 := main_#t~post2 + 1; [L135] havoc main_#t~post2; [L81] assume main_~i~1 < 32; [L82] foo_#in~b.offset, foo_#in~size, foo_#in~b.base := main_~#mask~0.offset, main_~i~1, main_~#mask~0.base; [L83] havoc foo_#res; [L84] havoc foo_#t~post0, foo_#t~mem1, foo_~i~0, foo_~b.offset, foo_~b.base, foo_~size, foo_~a~0; [L85] foo_~b.offset, foo_~b.base := foo_#in~b.offset, foo_#in~b.base; [L86] foo_~size := foo_#in~size; [L87] havoc foo_~a~0; [L88] havoc foo_~i~0; [L89] foo_~i~0 := 0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L105] assume foo_~i~0 <= foo_~size + 1; [L106] assume foo_~i~0 < 33 && 0 <= foo_~i~0; [L107] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := foo_~b.base, foo_~i~0 + foo_~b.offset, 1; [L108] assume 1 == #valid[read~int_#ptr.base]; [L109] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L110] assume #valid[read~int_#ptr.base] == 1; [L111] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L112] havoc read~int_#value; [L113] assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value; [L114] foo_#t~mem1 := read~int_#value; [L115] foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1]; [L116] havoc foo_#t~mem1; [L117] foo_#t~post0 := foo_~i~0; [L118] foo_~i~0 := foo_#t~post0 + 1; [L119] havoc foo_#t~post0; [L96] assume !(foo_~i~0 <= foo_~size + 1); [L97] foo_#res := foo_~i~0; [L98] main_#t~ret3 := foo_#res; [L99] assume 0 <= main_#t~ret3 + 2147483648 && main_#t~ret3 <= 2147483647; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~#b~0.base, main_#t~ret3, main_~#b~0.offset + 4 * main_~i~1; [L102] assume 1 == #valid[write~int_#ptr.base]; [L124] assume !(write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]) || !(0 <= write~int_#ptr.offset); [L138] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNKNOWN Result, 255.7s OverallTime, 43 OverallIterations, 252 TraceHistogramMax, 32.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 376 SDtfs, 343 SDslu, 1151 SDs, 0 SdLazy, 23945 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5390 GetRequests, 4333 SyntacticMatches, 4 SemanticMatches, 1053 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5424 ImplicationChecksByTransitivity, 26.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 270 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 191.7s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 5458 NumberOfCodeBlocks, 5458 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5099 ConstructedInterpolants, 1020 QuantifiedInterpolants, 10916656 SizeOfPredicates, 466 NumberOfNonLiveVariables, 85846 ConjunctsInSsa, 1533 ConjunctsInUnsatCore, 42 InterpolantComputations, 2 PerfectInterpolantSequences, 166788/347550 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Completed graceful shutdown