java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:22:12,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:22:12,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:22:12,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:22:12,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:22:12,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:22:12,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:22:12,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:22:12,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:22:12,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:22:12,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:22:12,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:22:12,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:22:12,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:22:12,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:22:12,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:22:12,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:22:12,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:22:12,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:22:12,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:22:12,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:22:12,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:22:12,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:22:12,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:22:12,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:22:12,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:22:12,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:22:12,651 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:22:12,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:22:12,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:22:12,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:22:12,652 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:22:12,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:22:12,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:22:12,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:22:12,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:22:12,664 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:22:12,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:22:12,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:22:12,664 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:22:12,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:22:12,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:22:12,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:22:12,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:22:12,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:22:12,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:22:12,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:22:12,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:22:12,703 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:22:12,706 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:22:12,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:22:12,707 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:22:12,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-02-02 20:22:12,840 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:22:12,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:22:12,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:22:12,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:22:12,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:22:12,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:22:12" (1/1) ... [2018-02-02 20:22:12,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a441b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:12, skipping insertion in model container [2018-02-02 20:22:12,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:22:12" (1/1) ... [2018-02-02 20:22:12,867 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:22:12,904 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:22:12,994 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:22:13,010 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:22:13,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13 WrapperNode [2018-02-02 20:22:13,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:22:13,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:22:13,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:22:13,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:22:13,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... [2018-02-02 20:22:13,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... [2018-02-02 20:22:13,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... [2018-02-02 20:22:13,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... [2018-02-02 20:22:13,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... [2018-02-02 20:22:13,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... [2018-02-02 20:22:13,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... [2018-02-02 20:22:13,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:22:13,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:22:13,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:22:13,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:22:13,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:22:13,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:22:13,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:22:13,087 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:22:13,087 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:22:13,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:22:13,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:22:13,496 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:22:13,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:22:13 BoogieIcfgContainer [2018-02-02 20:22:13,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:22:13,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:22:13,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:22:13,500 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:22:13,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:22:12" (1/3) ... [2018-02-02 20:22:13,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e26792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:22:13, skipping insertion in model container [2018-02-02 20:22:13,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:22:13" (2/3) ... [2018-02-02 20:22:13,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e26792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:22:13, skipping insertion in model container [2018-02-02 20:22:13,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:22:13" (3/3) ... [2018-02-02 20:22:13,503 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-02-02 20:22:13,508 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:22:13,517 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-02 20:22:13,543 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:22:13,543 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:22:13,544 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:22:13,544 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:22:13,544 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:22:13,544 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:22:13,544 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:22:13,544 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:22:13,545 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:22:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-02-02 20:22:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 20:22:13,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:13,567 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:13,567 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1366809009, now seen corresponding path program 1 times [2018-02-02 20:22:13,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:13,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:13,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:13,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:22:13,659 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:13,660 INFO L182 omatonBuilderFactory]: Interpolants [158#true, 159#false] [2018-02-02 20:22:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:13,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:22:13,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:22:13,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:22:13,672 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 2 states. [2018-02-02 20:22:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:13,743 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2018-02-02 20:22:13,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:22:13,744 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 20:22:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:13,752 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:22:13,753 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 20:22:13,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:22:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 20:22:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 20:22:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 20:22:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2018-02-02 20:22:13,785 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 9 [2018-02-02 20:22:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:13,786 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2018-02-02 20:22:13,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:22:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2018-02-02 20:22:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 20:22:13,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:13,786 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:13,786 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -26359990, now seen corresponding path program 1 times [2018-02-02 20:22:13,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:13,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:13,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:13,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:22:13,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:13,827 INFO L182 omatonBuilderFactory]: Interpolants [467#true, 468#false, 469#(= |#valid| |old(#valid)|)] [2018-02-02 20:22:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:13,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:22:13,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:22:13,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:22:13,830 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand 3 states. [2018-02-02 20:22:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:14,026 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2018-02-02 20:22:14,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:22:14,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 20:22:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:14,029 INFO L225 Difference]: With dead ends: 196 [2018-02-02 20:22:14,029 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 20:22:14,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:22:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 20:22:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2018-02-02 20:22:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 20:22:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-02-02 20:22:14,036 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 12 [2018-02-02 20:22:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:14,036 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-02-02 20:22:14,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:22:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-02-02 20:22:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:22:14,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:14,037 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:14,037 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -817163438, now seen corresponding path program 1 times [2018-02-02 20:22:14,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:14,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:14,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:22:14,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,083 INFO L182 omatonBuilderFactory]: Interpolants [823#true, 824#false, 825#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))] [2018-02-02 20:22:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:22:14,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:22:14,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:22:14,084 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 3 states. [2018-02-02 20:22:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:14,132 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-02-02 20:22:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:22:14,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 20:22:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:14,134 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:22:14,134 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 20:22:14,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:22:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 20:22:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2018-02-02 20:22:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 20:22:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-02-02 20:22:14,141 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 13 [2018-02-02 20:22:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:14,141 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-02-02 20:22:14,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:22:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-02-02 20:22:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:22:14,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:14,142 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:14,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 437426512, now seen corresponding path program 1 times [2018-02-02 20:22:14,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:14,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:14,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:22:14,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,177 INFO L182 omatonBuilderFactory]: Interpolants [1175#true, 1176#false, 1177#(= 1 (select |#valid| |main_#t~malloc3.base|)), 1178#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 20:22:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:22:14,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:22:14,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:14,178 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-02-02 20:22:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:14,321 INFO L93 Difference]: Finished difference Result 239 states and 265 transitions. [2018-02-02 20:22:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:22:14,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 20:22:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:14,322 INFO L225 Difference]: With dead ends: 239 [2018-02-02 20:22:14,322 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 20:22:14,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 20:22:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 169. [2018-02-02 20:22:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 20:22:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-02-02 20:22:14,331 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 14 [2018-02-02 20:22:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:14,331 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-02-02 20:22:14,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:22:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-02-02 20:22:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:22:14,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:14,332 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:14,332 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 437426513, now seen corresponding path program 1 times [2018-02-02 20:22:14,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:14,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:14,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:22:14,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,393 INFO L182 omatonBuilderFactory]: Interpolants [1589#true, 1590#false, 1591#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1592#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 20:22:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:22:14,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:22:14,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:14,394 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-02-02 20:22:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:14,483 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2018-02-02 20:22:14,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:22:14,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 20:22:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:14,484 INFO L225 Difference]: With dead ends: 165 [2018-02-02 20:22:14,484 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 20:22:14,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 20:22:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-02 20:22:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:22:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2018-02-02 20:22:14,490 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 14 [2018-02-02 20:22:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:14,491 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2018-02-02 20:22:14,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:22:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2018-02-02 20:22:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 20:22:14,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:14,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:14,492 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash 809095649, now seen corresponding path program 1 times [2018-02-02 20:22:14,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:14,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:14,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:22:14,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,532 INFO L182 omatonBuilderFactory]: Interpolants [1925#true, 1926#false, 1927#(or (not |main_#t~short1|) (<= main_~c1~0 4)), 1928#(<= main_~c1~0 4), 1929#(<= main_~c1~0 5)] [2018-02-02 20:22:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:22:14,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:22:14,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:14,533 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand 5 states. [2018-02-02 20:22:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:14,562 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2018-02-02 20:22:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:22:14,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 20:22:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:14,568 INFO L225 Difference]: With dead ends: 306 [2018-02-02 20:22:14,568 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 20:22:14,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:22:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 20:22:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 165. [2018-02-02 20:22:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:22:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-02-02 20:22:14,575 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 21 [2018-02-02 20:22:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:14,575 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-02-02 20:22:14,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:22:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-02-02 20:22:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:22:14,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:14,576 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:14,576 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash -836569732, now seen corresponding path program 1 times [2018-02-02 20:22:14,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:14,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:14,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:22:14,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,608 INFO L182 omatonBuilderFactory]: Interpolants [2403#true, 2404#false, 2405#(= 1 (select |#valid| |main_#t~malloc8.base|)), 2406#(= 1 (select |#valid| main_~lItem~0.base))] [2018-02-02 20:22:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:22:14,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:22:14,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:14,609 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 4 states. [2018-02-02 20:22:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:14,739 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-02-02 20:22:14,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:22:14,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 20:22:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:14,740 INFO L225 Difference]: With dead ends: 199 [2018-02-02 20:22:14,740 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 20:22:14,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 20:22:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2018-02-02 20:22:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:22:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-02-02 20:22:14,745 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 22 [2018-02-02 20:22:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:14,745 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-02-02 20:22:14,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:22:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-02-02 20:22:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:22:14,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:14,745 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:14,745 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash -836569731, now seen corresponding path program 1 times [2018-02-02 20:22:14,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:14,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:14,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:22:14,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,789 INFO L182 omatonBuilderFactory]: Interpolants [2769#true, 2770#false, 2771#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 2772#(and (= main_~lItem~0.offset 0) (= (select |#length| main_~lItem~0.base) 8))] [2018-02-02 20:22:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:22:14,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:22:14,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:14,790 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 4 states. [2018-02-02 20:22:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:14,869 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2018-02-02 20:22:14,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:22:14,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 20:22:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:14,870 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:22:14,870 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 20:22:14,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 20:22:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 20:22:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 20:22:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-02-02 20:22:14,872 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 22 [2018-02-02 20:22:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:14,872 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-02-02 20:22:14,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:22:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-02-02 20:22:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:22:14,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:14,873 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:14,873 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:14,873 INFO L82 PathProgramCache]: Analyzing trace with hash 261861212, now seen corresponding path program 1 times [2018-02-02 20:22:14,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:14,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:14,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:22:14,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,923 INFO L182 omatonBuilderFactory]: Interpolants [3091#true, 3092#false, 3093#(not (= 0 |main_#t~malloc8.base|)), 3094#(not (= 0 main_~lItem~0.base)), 3095#(not (= 0 main_~data~0.base))] [2018-02-02 20:22:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:14,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:22:14,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:22:14,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:14,924 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 5 states. [2018-02-02 20:22:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:15,004 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2018-02-02 20:22:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:22:15,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 20:22:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:15,006 INFO L225 Difference]: With dead ends: 262 [2018-02-02 20:22:15,006 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 20:22:15,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:22:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 20:22:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 158. [2018-02-02 20:22:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 20:22:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-02-02 20:22:15,012 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 31 [2018-02-02 20:22:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:15,012 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-02-02 20:22:15,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:22:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-02-02 20:22:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:22:15,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:15,013 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:15,013 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash -472240768, now seen corresponding path program 1 times [2018-02-02 20:22:15,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:15,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:15,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:22:15,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,086 INFO L182 omatonBuilderFactory]: Interpolants [3523#true, 3524#false, 3525#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 3526#(and (= 8 (select |#length| main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 3527#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 20:22:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:22:15,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:22:15,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:15,087 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 5 states. [2018-02-02 20:22:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:15,270 INFO L93 Difference]: Finished difference Result 253 states and 282 transitions. [2018-02-02 20:22:15,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:22:15,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 20:22:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:15,271 INFO L225 Difference]: With dead ends: 253 [2018-02-02 20:22:15,272 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 20:22:15,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:22:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 20:22:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 200. [2018-02-02 20:22:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 20:22:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2018-02-02 20:22:15,275 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 32 [2018-02-02 20:22:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:15,275 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2018-02-02 20:22:15,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:22:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2018-02-02 20:22:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:22:15,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:15,276 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:15,276 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash -472240769, now seen corresponding path program 1 times [2018-02-02 20:22:15,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:15,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:15,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:22:15,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,314 INFO L182 omatonBuilderFactory]: Interpolants [3988#true, 3989#false, 3990#(= (select |#valid| main_~lItem~0.base) 1), 3991#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.base main_~lItem~0.base)), 3992#(= 1 (select |#valid| main_~data~0.base))] [2018-02-02 20:22:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:22:15,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:22:15,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:15,314 INFO L87 Difference]: Start difference. First operand 200 states and 257 transitions. Second operand 5 states. [2018-02-02 20:22:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:15,407 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2018-02-02 20:22:15,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:22:15,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 20:22:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:15,408 INFO L225 Difference]: With dead ends: 194 [2018-02-02 20:22:15,409 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 20:22:15,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:22:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 20:22:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-02-02 20:22:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:22:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2018-02-02 20:22:15,413 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 32 [2018-02-02 20:22:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:15,413 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2018-02-02 20:22:15,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:22:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2018-02-02 20:22:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:22:15,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:15,415 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:15,415 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash 456903790, now seen corresponding path program 1 times [2018-02-02 20:22:15,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:15,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:15,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:22:15,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,445 INFO L182 omatonBuilderFactory]: Interpolants [4384#(<= main_~c1~0 1), 4381#true, 4382#false, 4383#(= main_~c1~0 0)] [2018-02-02 20:22:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:22:15,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:22:15,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:15,446 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand 4 states. [2018-02-02 20:22:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:15,463 INFO L93 Difference]: Finished difference Result 353 states and 446 transitions. [2018-02-02 20:22:15,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:22:15,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-02 20:22:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:15,464 INFO L225 Difference]: With dead ends: 353 [2018-02-02 20:22:15,464 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 20:22:15,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 20:22:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 193. [2018-02-02 20:22:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:22:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2018-02-02 20:22:15,468 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 37 [2018-02-02 20:22:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:15,468 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2018-02-02 20:22:15,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:22:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2018-02-02 20:22:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:22:15,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:15,478 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:15,478 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:15,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1168751179, now seen corresponding path program 1 times [2018-02-02 20:22:15,479 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:15,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:15,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:22:15,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,604 INFO L182 omatonBuilderFactory]: Interpolants [4931#true, 4932#false, 4933#(and (= main_~lItem~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset) main_~lItem~0.base)), 4934#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 4935#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 4936#(and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset))] [2018-02-02 20:22:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:22:15,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:22:15,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:22:15,605 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand 6 states. [2018-02-02 20:22:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:15,729 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2018-02-02 20:22:15,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:22:15,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 20:22:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:15,730 INFO L225 Difference]: With dead ends: 232 [2018-02-02 20:22:15,730 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:22:15,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:22:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:22:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 203. [2018-02-02 20:22:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 20:22:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2018-02-02 20:22:15,734 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 39 [2018-02-02 20:22:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:15,735 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2018-02-02 20:22:15,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:22:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2018-02-02 20:22:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:22:15,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:15,736 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:15,736 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408649, now seen corresponding path program 1 times [2018-02-02 20:22:15,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:15,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:15,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:22:15,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,980 INFO L182 omatonBuilderFactory]: Interpolants [5376#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 5377#(and (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 5378#(and (not (= 0 |main_#t~malloc8.base|)) (= 1 (select (store |#valid| |main_#t~malloc8.base| 0) main_~item~0.base)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 5379#(and (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 5380#(and (= 1 (select (store |#valid| main_~data~0.base 0) main_~item~0.base)) (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 5381#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= 1 (select (store |#valid| main_~data~0.base 0) (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))), 5382#(and (= main_~data~0.offset 0) (not (= main_~data~0.base 0)) (= 1 (select (store |#valid| main_~data~0.base 0) |main_#t~mem31.base|))), 5383#(and (= 1 (select (store |#valid| main_~data~0.base 0) main_~item~0.base)) (= main_~data~0.offset 0) (not (= main_~data~0.base 0))), 5384#(= 1 (select |#valid| main_~item~0.base)), 5374#true, 5375#false] [2018-02-02 20:22:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:15,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:22:15,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:22:15,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:22:15,981 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand 11 states. [2018-02-02 20:22:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:16,541 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2018-02-02 20:22:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:22:16,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 20:22:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:16,542 INFO L225 Difference]: With dead ends: 288 [2018-02-02 20:22:16,542 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 20:22:16,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:22:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 20:22:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 209. [2018-02-02 20:22:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:22:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 261 transitions. [2018-02-02 20:22:16,547 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 261 transitions. Word has length 41 [2018-02-02 20:22:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:16,547 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 261 transitions. [2018-02-02 20:22:16,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:22:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2018-02-02 20:22:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:22:16,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:16,548 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:16,548 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408648, now seen corresponding path program 1 times [2018-02-02 20:22:16,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:16,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:16,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:16,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:22:16,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:16,834 INFO L182 omatonBuilderFactory]: Interpolants [5907#true, 5908#false, 5909#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 5910#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)), 5911#(and (<= 8 (select |#length| main_~item~0.base)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 5912#(and (<= 8 (select |#length| main_~item~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 5913#(and (= main_~data~0.offset 0) (<= 8 (select |#length| main_~item~0.base)) (= main_~lItem~0.offset 0) (= main_~lItem~0.base main_~data~0.base) (= main_~item~0.offset 0)), 5914#(and (= main_~data~0.offset 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 5915#(and (= 0 |main_#t~mem31.offset|) (= main_~data~0.offset 0) (<= 8 (select |#length| |main_#t~mem31.base|))), 5916#(and (= main_~data~0.offset 0) (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)), 5917#(and (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0))] [2018-02-02 20:22:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:16,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:22:16,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:22:16,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:22:16,834 INFO L87 Difference]: Start difference. First operand 209 states and 261 transitions. Second operand 11 states. [2018-02-02 20:22:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:17,321 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2018-02-02 20:22:17,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:22:17,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 20:22:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:17,323 INFO L225 Difference]: With dead ends: 258 [2018-02-02 20:22:17,323 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 20:22:17,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:22:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 20:22:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 209. [2018-02-02 20:22:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:22:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2018-02-02 20:22:17,327 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 41 [2018-02-02 20:22:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:17,327 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 260 transitions. [2018-02-02 20:22:17,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:22:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2018-02-02 20:22:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:22:17,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:17,328 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:17,328 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash -310930527, now seen corresponding path program 1 times [2018-02-02 20:22:17,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:17,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:17,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:17,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:22:17,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:17,499 INFO L182 omatonBuilderFactory]: Interpolants [6416#(and (= main_~item~0.offset main_~lItem~0.offset) (= main_~item~0.offset main_~data~0.offset) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 6417#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))), 6418#(not (= 0 |main_#t~mem31.base|)), 6419#(not (= 0 main_~item~0.base)), 6410#true, 6411#false, 6412#(and (not (= 0 |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 6413#(and (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 6414#(and (= 0 |main_#t~malloc8.offset|) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 6415#(and (= main_~item~0.offset main_~lItem~0.offset) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0))] [2018-02-02 20:22:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:17,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:22:17,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:22:17,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:22:17,499 INFO L87 Difference]: Start difference. First operand 209 states and 260 transitions. Second operand 10 states. [2018-02-02 20:22:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:17,711 INFO L93 Difference]: Finished difference Result 236 states and 288 transitions. [2018-02-02 20:22:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:22:17,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 20:22:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:17,712 INFO L225 Difference]: With dead ends: 236 [2018-02-02 20:22:17,712 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 20:22:17,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:22:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 20:22:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2018-02-02 20:22:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:22:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 259 transitions. [2018-02-02 20:22:17,715 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 259 transitions. Word has length 42 [2018-02-02 20:22:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:17,715 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 259 transitions. [2018-02-02 20:22:17,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:22:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2018-02-02 20:22:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:22:17,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:17,716 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:17,716 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881672, now seen corresponding path program 1 times [2018-02-02 20:22:17,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:17,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:22:17,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:17,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:22:17,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:17,739 INFO L182 omatonBuilderFactory]: Interpolants [6884#true, 6885#false, 6886#(= main_~item2~0.base main_~item~0.base), 6887#(= 1 (select |#valid| main_~item2~0.base))] [2018-02-02 20:22:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:22:17,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:22:17,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:22:17,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:17,740 INFO L87 Difference]: Start difference. First operand 209 states and 259 transitions. Second operand 4 states. [2018-02-02 20:22:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:17,848 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2018-02-02 20:22:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:22:17,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 20:22:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:17,850 INFO L225 Difference]: With dead ends: 265 [2018-02-02 20:22:17,850 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 20:22:17,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:22:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 20:22:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 213. [2018-02-02 20:22:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 20:22:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 270 transitions. [2018-02-02 20:22:17,853 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 270 transitions. Word has length 43 [2018-02-02 20:22:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:17,853 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 270 transitions. [2018-02-02 20:22:17,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:22:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 270 transitions. [2018-02-02 20:22:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:22:17,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:17,854 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:17,854 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881671, now seen corresponding path program 1 times [2018-02-02 20:22:17,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:17,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:18,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:18,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:22:18,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:18,134 INFO L182 omatonBuilderFactory]: Interpolants [7368#true, 7369#false, 7370#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 7371#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)), 7372#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0) (or (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base |main_#t~malloc8.base|))), 7373#(and (= main_~lItem~0.offset 0) (or (not (= main_~item~0.base main_~lItem~0.base)) (not (= 0 main_~lItem~0.base))) (or (= main_~item~0.base main_~lItem~0.base) (<= 8 (select |#length| main_~item~0.base))) (= main_~item~0.offset 0)), 7374#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (not (= main_~item~0.base main_~lItem~0.base)) (and (not (= 0 main_~data~0.base)) (= main_~data~0.base main_~lItem~0.base))) (= main_~item~0.offset 0) (or (= main_~item~0.base main_~lItem~0.base) (and (<= 8 (select |#length| main_~item~0.base)) (= main_~data~0.base main_~lItem~0.base)))), 7375#(and (= main_~data~0.offset 0) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base))))), 7376#(and (= main_~data~0.offset 0) (or (and (= 0 |main_#t~mem31.offset|) (<= 8 (select |#length| |main_#t~mem31.base|))) (and (not (= main_~data~0.base 0)) (= main_~data~0.base |main_#t~mem31.base|)))), 7377#(and (= main_~data~0.offset 0) (or (and (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)) (and (= main_~data~0.base main_~item~0.base) (not (= main_~data~0.base 0))))), 7378#(or (and (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)) (= 0 (select |#valid| main_~item~0.base))), 7379#(and (or (= 0 (select |#valid| main_~item~0.base)) (and (= (select |#length| main_~item~0.base) (select |#length| main_~item2~0.base)) (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0))) (= main_~item~0.offset main_~item2~0.offset)), 7380#(and (<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base)) (<= 0 main_~item2~0.offset))] [2018-02-02 20:22:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:18,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:22:18,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:22:18,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:22:18,134 INFO L87 Difference]: Start difference. First operand 213 states and 270 transitions. Second operand 13 states. [2018-02-02 20:22:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:18,857 INFO L93 Difference]: Finished difference Result 269 states and 332 transitions. [2018-02-02 20:22:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:22:18,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 20:22:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:18,858 INFO L225 Difference]: With dead ends: 269 [2018-02-02 20:22:18,858 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 20:22:18,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:22:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 20:22:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-02-02 20:22:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:22:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 276 transitions. [2018-02-02 20:22:18,861 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 276 transitions. Word has length 43 [2018-02-02 20:22:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:18,861 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 276 transitions. [2018-02-02 20:22:18,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:22:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 276 transitions. [2018-02-02 20:22:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:22:18,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:18,861 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:18,861 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:18,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1204415842, now seen corresponding path program 1 times [2018-02-02 20:22:18,862 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:18,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:22:18,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:18,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:22:18,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:18,878 INFO L182 omatonBuilderFactory]: Interpolants [7901#true, 7902#false, 7903#(not |main_#t~short35|)] [2018-02-02 20:22:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:22:18,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:22:18,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:22:18,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:22:18,879 INFO L87 Difference]: Start difference. First operand 218 states and 276 transitions. Second operand 3 states. [2018-02-02 20:22:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:18,883 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2018-02-02 20:22:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:22:18,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-02-02 20:22:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:18,884 INFO L225 Difference]: With dead ends: 219 [2018-02-02 20:22:18,884 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 20:22:18,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:22:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 20:22:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-02 20:22:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:22:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 277 transitions. [2018-02-02 20:22:18,886 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 277 transitions. Word has length 47 [2018-02-02 20:22:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:18,887 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 277 transitions. [2018-02-02 20:22:18,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:22:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2018-02-02 20:22:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:22:18,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:18,887 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:18,887 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2091612127, now seen corresponding path program 1 times [2018-02-02 20:22:18,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:18,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:19,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:19,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:22:19,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:19,093 INFO L182 omatonBuilderFactory]: Interpolants [8352#(and (= main_~item~0.offset main_~item2~0.offset) (= main_~item~0.offset 0)), 8353#(and (<= main_~item2~0.offset 0) (<= 0 main_~item2~0.offset)), 8342#true, 8343#false, 8344#(= 0 |main_#t~malloc3.offset|), 8345#(= 0 main_~item~0.offset), 8346#(and (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 8347#(and (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 8348#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (= main_~lItem~0.base main_~data~0.base) (= main_~item~0.offset 0)), 8349#(and (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 8350#(and (= 0 |main_#t~mem31.offset|) (= main_~data~0.offset 0)), 8351#(and (= main_~data~0.offset 0) (= main_~item~0.offset 0))] [2018-02-02 20:22:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:19,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:22:19,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:22:19,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:22:19,093 INFO L87 Difference]: Start difference. First operand 219 states and 277 transitions. Second operand 12 states. [2018-02-02 20:22:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:19,372 INFO L93 Difference]: Finished difference Result 289 states and 354 transitions. [2018-02-02 20:22:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:22:19,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-02-02 20:22:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:19,373 INFO L225 Difference]: With dead ends: 289 [2018-02-02 20:22:19,373 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 20:22:19,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:22:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 20:22:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 222. [2018-02-02 20:22:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 20:22:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 281 transitions. [2018-02-02 20:22:19,377 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 281 transitions. Word has length 49 [2018-02-02 20:22:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:19,378 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 281 transitions. [2018-02-02 20:22:19,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:22:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2018-02-02 20:22:19,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:22:19,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:19,378 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:19,378 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:19,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2097549474, now seen corresponding path program 1 times [2018-02-02 20:22:19,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:19,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:19,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:19,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:22:19,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:19,885 INFO L182 omatonBuilderFactory]: Interpolants [8897#true, 8898#false, 8899#(= main_~c1~0 0), 8900#(<= 1 main_~c1~0), 8901#(and (<= 1 main_~c1~0) (= 0 |main_#t~malloc3.offset|)), 8902#(and (<= 1 main_~c1~0) (= main_~item~0.offset 0)), 8903#(and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0) (= main_~item~0.offset 0)), 8904#(and (or (and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0)) (= main_~item~0.base |main_#t~malloc8.base|)) (or (not (= 0 |main_#t~malloc8.base|)) (not (= main_~item~0.base |main_#t~malloc8.base|))) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 8905#(and (or (and (not (= main_~item~0.base main_~lItem~0.base)) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0)) (and (= main_~lItem~0.base main_~item~0.base) (not (= 0 main_~lItem~0.base)))) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 8906#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (and (not (= main_~item~0.base main_~lItem~0.base)) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0) (= main_~data~0.base main_~lItem~0.base)) (and (= main_~data~0.base main_~item~0.base) (not (= 0 main_~data~0.base)) (= main_~data~0.base main_~lItem~0.base))) (= main_~item~0.offset 0)), 8907#(and (= main_~data~0.offset 0) (or (and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4))) (<= 1 main_~c1~0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base))))), 8908#(and (= main_~data~0.offset 0) (or (and (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base))))), 8909#(and (= main_~data~0.offset 0) (or (and (<= 6 (select (select |#memory_int| |main_#t~mem31.base|) (+ 0 4))) (= 0 |main_#t~mem31.offset|)) (and (not (= main_~data~0.base 0)) (= main_~data~0.base |main_#t~mem31.base|)))), 8910#(and (= main_~data~0.offset 0) (or (and (= main_~item~0.offset 0) (<= 6 (select (select |#memory_int| main_~item~0.base) (+ 0 4)))) (and (= main_~data~0.base main_~item~0.base) (not (= main_~data~0.base 0))))), 8911#(or (= 0 (select |#valid| main_~item~0.base)) (and (= main_~item~0.offset 0) (<= 6 (select (select |#memory_int| main_~item~0.base) (+ 0 4))))), 8912#(or (<= 6 (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4))) (= 0 (select |#valid| main_~item~0.base))), 8913#(<= 6 (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4))), 8914#(<= 2 |main_#t~mem33|), 8915#|main_#t~short35|] [2018-02-02 20:22:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:19,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:22:19,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:22:19,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:22:19,886 INFO L87 Difference]: Start difference. First operand 222 states and 281 transitions. Second operand 19 states. [2018-02-02 20:22:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:21,104 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2018-02-02 20:22:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:22:21,105 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 20:22:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:21,105 INFO L225 Difference]: With dead ends: 266 [2018-02-02 20:22:21,105 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 20:22:21,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:22:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 20:22:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 222. [2018-02-02 20:22:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 20:22:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 280 transitions. [2018-02-02 20:22:21,108 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 280 transitions. Word has length 49 [2018-02-02 20:22:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:21,108 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 280 transitions. [2018-02-02 20:22:21,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:22:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 280 transitions. [2018-02-02 20:22:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:22:21,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:21,109 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:21,109 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash -5312545, now seen corresponding path program 1 times [2018-02-02 20:22:21,109 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:21,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:21,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:21,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:22:21,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:21,490 INFO L182 omatonBuilderFactory]: Interpolants [9452#true, 9453#false, 9454#(= 0 |main_#t~malloc3.offset|), 9455#(= main_~item~0.offset 0), 9456#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset 0)), 9457#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= 0 |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 9458#(and (or (= main_~item~0.base main_~lItem~0.base) (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset main_~lItem~0.base)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)))) (= 0 main_~lItem~0.offset) (or (not (= main_~item~0.base main_~lItem~0.base)) (not (= 0 main_~lItem~0.base))) (= main_~item~0.offset 0)), 9459#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (= main_~item~0.base main_~lItem~0.base) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset)) (= main_~data~0.base main_~lItem~0.base))) (or (not (= main_~item~0.base main_~lItem~0.base)) (and (not (= 0 main_~data~0.base)) (= main_~data~0.base main_~lItem~0.base))) (= main_~item~0.offset 0)), 9460#(and (= main_~data~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) 0))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 9461#(and (= 0 |main_#t~mem31.offset|) (= main_~data~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) 0))) (and (not (= main_~data~0.base 0)) (= main_~data~0.base |main_#t~mem31.base|)))), 9462#(and (= main_~data~0.offset 0) (or (and (= main_~data~0.base main_~item~0.base) (not (= main_~data~0.base 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~item~0.offset 0)), 9463#(and (= main_~item~0.offset 0) (or (= 0 (select |#valid| main_~item~0.base)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 9464#(or (= 0 (select |#valid| main_~item~0.base)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 9465#(and (= 0 |main_#t~mem32.offset|) (= 0 |main_#t~mem32.base|)), 9466#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0))] [2018-02-02 20:22:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:21,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:22:21,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:22:21,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:22:21,491 INFO L87 Difference]: Start difference. First operand 222 states and 280 transitions. Second operand 15 states. [2018-02-02 20:22:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:22,151 INFO L93 Difference]: Finished difference Result 246 states and 305 transitions. [2018-02-02 20:22:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:22:22,175 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-02-02 20:22:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:22,176 INFO L225 Difference]: With dead ends: 246 [2018-02-02 20:22:22,176 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 20:22:22,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:22:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 20:22:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 224. [2018-02-02 20:22:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 20:22:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 282 transitions. [2018-02-02 20:22:22,180 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 282 transitions. Word has length 51 [2018-02-02 20:22:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:22,180 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 282 transitions. [2018-02-02 20:22:22,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:22:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 282 transitions. [2018-02-02 20:22:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:22:22,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:22,181 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:22,181 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash -164689671, now seen corresponding path program 1 times [2018-02-02 20:22:22,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:22,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:22,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:22,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 20:22:22,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:22,600 INFO L182 omatonBuilderFactory]: Interpolants [9984#(and (= main_~data~0.offset 0) (or (and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4))) (<= main_~c1~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base))), 9985#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (or (and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4)) 6) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))), 9986#(and (not (= main_~data~0.base 0)) (= main_~data~0.offset 0) (or (and (= 0 |main_#t~mem31.offset|) (<= (select (select |#memory_int| |main_#t~mem31.base|) (+ 0 4)) 6)) (= main_~data~0.base |main_#t~mem31.base|))), 9987#(and (or (= main_~data~0.base main_~item~0.base) (and (<= (select (select |#memory_int| main_~item~0.base) (+ 0 4)) 6) (= main_~item~0.offset 0))) (= main_~data~0.offset 0) (not (= main_~data~0.base 0))), 9988#(or (= 0 (select |#valid| main_~item~0.base)) (and (<= (select (select |#memory_int| main_~item~0.base) (+ 0 4)) 6) (= main_~item~0.offset 0))), 9989#(or (= 0 (select |#valid| main_~item~0.base)) (<= (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4)) 6)), 9990#(<= (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4)) 6), 9991#(and (= |main_#t~mem33| (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4))) (<= |main_#t~mem33| 14)), 9992#(<= (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4)) 14), 9993#(<= |main_#t~mem34| 14), 9994#|main_#t~short35|, 9975#true, 9976#false, 9977#(= 0 |main_#t~malloc3.offset|), 9978#(= 0 main_~item~0.offset), 9979#(and (<= main_~c1~0 1) (= main_~item~0.offset 0)), 9980#(and (<= main_~c1~0 1) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (= main_~item~0.offset 0)), 9981#(and (<= main_~c1~0 1) (not (= 0 |main_#t~malloc8.base|)) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 9982#(and (not (= 0 main_~lItem~0.base)) (or (= main_~item~0.base main_~lItem~0.base) (and (<= main_~c1~0 1) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))))) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 9983#(and (= main_~data~0.offset 0) (or (= main_~item~0.base main_~lItem~0.base) (and (<= main_~c1~0 1) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))))) (= main_~lItem~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base))] [2018-02-02 20:22:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:22,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:22:22,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:22:22,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:22:22,600 INFO L87 Difference]: Start difference. First operand 224 states and 282 transitions. Second operand 20 states. [2018-02-02 20:22:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:23,633 INFO L93 Difference]: Finished difference Result 274 states and 335 transitions. [2018-02-02 20:22:23,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:22:23,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 20:22:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:23,633 INFO L225 Difference]: With dead ends: 274 [2018-02-02 20:22:23,633 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 20:22:23,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:22:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 20:22:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2018-02-02 20:22:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 20:22:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2018-02-02 20:22:23,636 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 52 [2018-02-02 20:22:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:23,637 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2018-02-02 20:22:23,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:22:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2018-02-02 20:22:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:22:23,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:23,637 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:23,637 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:23,637 INFO L82 PathProgramCache]: Analyzing trace with hash -927850364, now seen corresponding path program 1 times [2018-02-02 20:22:23,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:23,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:23,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:23,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:22:23,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:23,935 INFO L182 omatonBuilderFactory]: Interpolants [10560#(and (not (= main_~data~0.base 0)) (= |old(#valid)| (store (store |#valid| main_~data~0.base 0) |main_#t~mem31.base| 0))), 10561#(and (= (store (store |#valid| main_~data~0.base 0) main_~item~0.base 0) |old(#valid)|) (not (= main_~data~0.base 0))), 10562#(= (store |#valid| main_~item~0.base 0) |old(#valid)|), 10563#(and (or (not (= 0 main_~item2~0.base)) (not (= 0 main_~item2~0.offset))) (= (store |#valid| main_~item2~0.base 0) |old(#valid)|)), 10551#true, 10552#false, 10553#(= |#valid| |old(#valid)|), 10554#(and (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= 0 |main_#t~malloc3.offset|)), 10555#(and (= (store |#valid| main_~item~0.base 0) |old(#valid)|) (= main_~item~0.offset 0)), 10556#(and (= (store (store |#valid| |main_#t~malloc8.base| 0) main_~item~0.base 0) |old(#valid)|) (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 10557#(and (= main_~item~0.offset main_~lItem~0.offset) (not (= 0 main_~lItem~0.base)) (= main_~item~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~lItem~0.base 0) main_~item~0.base 0))), 10558#(and (= (store (store |#valid| main_~data~0.base 0) main_~item~0.base 0) |old(#valid)|) (= main_~item~0.offset main_~lItem~0.offset) (= main_~item~0.offset main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 10559#(and (= (store (store |#valid| main_~data~0.base 0) (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) 0) |old(#valid)|) (not (= 0 main_~data~0.base)))] [2018-02-02 20:22:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:23,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:22:23,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:22:23,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:22:23,936 INFO L87 Difference]: Start difference. First operand 224 states and 281 transitions. Second operand 13 states. [2018-02-02 20:22:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:24,385 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2018-02-02 20:22:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:22:24,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 20:22:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:24,386 INFO L225 Difference]: With dead ends: 227 [2018-02-02 20:22:24,386 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 20:22:24,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:22:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 20:22:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-02-02 20:22:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:22:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2018-02-02 20:22:24,388 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 53 [2018-02-02 20:22:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:24,388 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2018-02-02 20:22:24,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:22:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2018-02-02 20:22:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:22:24,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:24,389 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:24,389 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:24,389 INFO L82 PathProgramCache]: Analyzing trace with hash -62214646, now seen corresponding path program 1 times [2018-02-02 20:22:24,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:24,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:24,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:24,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:22:24,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:24,423 INFO L182 omatonBuilderFactory]: Interpolants [11015#true, 11016#false, 11017#(<= main_~c1~0 1), 11018#(<= main_~c1~0 2)] [2018-02-02 20:22:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:24,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:22:24,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:22:24,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:24,423 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand 4 states. [2018-02-02 20:22:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:24,440 INFO L93 Difference]: Finished difference Result 540 states and 701 transitions. [2018-02-02 20:22:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:22:24,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-02 20:22:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:24,442 INFO L225 Difference]: With dead ends: 540 [2018-02-02 20:22:24,442 INFO L226 Difference]: Without dead ends: 540 [2018-02-02 20:22:24,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:22:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-02-02 20:22:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 226. [2018-02-02 20:22:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 20:22:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2018-02-02 20:22:24,446 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 60 [2018-02-02 20:22:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:24,446 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2018-02-02 20:22:24,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:22:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2018-02-02 20:22:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:22:24,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:24,446 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:24,446 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1528276162, now seen corresponding path program 1 times [2018-02-02 20:22:24,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:24,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:24,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:24,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:22:24,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:24,633 INFO L182 omatonBuilderFactory]: Interpolants [11792#(or (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (= 1 (select |#valid| main_~data~0.base))) (not (= main_~lItem~0.base main_~data~0.base))), 11793#(and (= 1 (select |#valid| main_~lItem~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))))), 11794#(and (= 1 (select |#valid| main_~lItem~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4)))) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))), 11795#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 11796#(= 1 (select |#valid| |main_#t~mem16.base|)), 11785#true, 11786#false, 11787#(= 0 |main_#t~malloc8.offset|), 11788#(= 0 main_~lItem~0.offset), 11789#(= 0 main_~data~0.offset), 11790#(and (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)), 11791#(or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))))] [2018-02-02 20:22:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:24,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:22:24,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:22:24,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:22:24,634 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand 12 states. [2018-02-02 20:22:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:24,884 INFO L93 Difference]: Finished difference Result 252 states and 289 transitions. [2018-02-02 20:22:24,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:22:24,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-02-02 20:22:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:24,885 INFO L225 Difference]: With dead ends: 252 [2018-02-02 20:22:24,885 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 20:22:24,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:22:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 20:22:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 226. [2018-02-02 20:22:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 20:22:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 284 transitions. [2018-02-02 20:22:24,888 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 284 transitions. Word has length 61 [2018-02-02 20:22:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:24,888 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 284 transitions. [2018-02-02 20:22:24,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:22:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 284 transitions. [2018-02-02 20:22:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:22:24,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:24,888 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:24,888 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1528276161, now seen corresponding path program 1 times [2018-02-02 20:22:24,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:24,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:25,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:25,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:22:25,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:25,144 INFO L182 omatonBuilderFactory]: Interpolants [12304#(= 0 main_~lItem~0.offset), 12305#(= main_~data~0.offset 0), 12306#(and (= main_~data~0.offset |main_#t~malloc8.offset|) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 12307#(and (or (and (= 8 (select |#length| main_~lItem~0.base)) (= 0 main_~lItem~0.offset)) (= main_~lItem~0.base main_~data~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset))), 12308#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)))) (or (= main_~lItem~0.base main_~data~0.base) (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))))), 12309#(or (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 12310#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset))), 12311#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 12312#(and (= |main_#t~mem16.offset| 0) (= 8 (select |#length| |main_#t~mem16.base|))), 12301#true, 12302#false, 12303#(= 0 |main_#t~malloc8.offset|)] [2018-02-02 20:22:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:25,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:22:25,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:22:25,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:22:25,145 INFO L87 Difference]: Start difference. First operand 226 states and 284 transitions. Second operand 12 states. [2018-02-02 20:22:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:25,588 INFO L93 Difference]: Finished difference Result 271 states and 310 transitions. [2018-02-02 20:22:25,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:22:25,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-02-02 20:22:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:25,589 INFO L225 Difference]: With dead ends: 271 [2018-02-02 20:22:25,589 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 20:22:25,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:22:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 20:22:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 226. [2018-02-02 20:22:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 20:22:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 283 transitions. [2018-02-02 20:22:25,592 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 283 transitions. Word has length 61 [2018-02-02 20:22:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:25,592 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 283 transitions. [2018-02-02 20:22:25,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:22:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2018-02-02 20:22:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:22:25,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:25,592 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:25,593 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1270433664, now seen corresponding path program 1 times [2018-02-02 20:22:25,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:25,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:25,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:25,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:22:25,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:25,690 INFO L182 omatonBuilderFactory]: Interpolants [12832#true, 12833#false, 12834#(= (select |#valid| main_~lItem~0.base) 1), 12835#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.base main_~lItem~0.base)), 12836#(= (select |#valid| main_~data~0.base) 1), 12837#(or (= main_~data~0.base |main_#t~malloc3.base|) (= (select |#valid| main_~data~0.base) 1)), 12838#(or (= main_~item~0.base main_~data~0.base) (= (select |#valid| main_~data~0.base) 1)), 12839#(and (= (select |#valid| main_~item~0.base) 1) (= (select |#valid| main_~data~0.base) 1)), 12840#(not (= main_~data~0.base |main_#t~malloc8.base|)), 12841#(not (= main_~lItem~0.base main_~data~0.base)), 12842#(and (not (= main_~lItem~0.base main_~data~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset) main_~lItem~0.base)), 12843#(not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) main_~data~0.base)), 12844#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) main_~data~0.base)))] [2018-02-02 20:22:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:25,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:22:25,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:22:25,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:22:25,691 INFO L87 Difference]: Start difference. First operand 226 states and 283 transitions. Second operand 13 states. [2018-02-02 20:22:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:25,967 INFO L93 Difference]: Finished difference Result 260 states and 297 transitions. [2018-02-02 20:22:25,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:22:25,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-02 20:22:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:25,968 INFO L225 Difference]: With dead ends: 260 [2018-02-02 20:22:25,968 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 20:22:25,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:22:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 20:22:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 223. [2018-02-02 20:22:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 20:22:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2018-02-02 20:22:25,972 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 63 [2018-02-02 20:22:25,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:25,972 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2018-02-02 20:22:25,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:22:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2018-02-02 20:22:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:22:25,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:25,973 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:25,973 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash -153938688, now seen corresponding path program 1 times [2018-02-02 20:22:25,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:25,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:26,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:26,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:22:26,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:26,029 INFO L182 omatonBuilderFactory]: Interpolants [13360#(= 1 (select |#valid| main_~lItem~0.base)), 13355#true, 13356#false, 13357#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)), 13358#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 13359#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 20:22:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:26,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:22:26,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:22:26,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:22:26,030 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand 6 states. [2018-02-02 20:22:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:26,159 INFO L93 Difference]: Finished difference Result 222 states and 277 transitions. [2018-02-02 20:22:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:22:26,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-02-02 20:22:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:26,160 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:22:26,160 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 20:22:26,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:22:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 20:22:26,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-02 20:22:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 20:22:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2018-02-02 20:22:26,163 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 65 [2018-02-02 20:22:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:26,163 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2018-02-02 20:22:26,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:22:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2018-02-02 20:22:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:22:26,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:26,163 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:26,163 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash -153938687, now seen corresponding path program 1 times [2018-02-02 20:22:26,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:26,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:26,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:26,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:22:26,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:26,354 INFO L182 omatonBuilderFactory]: Interpolants [13824#(and (<= (+ |main_#t~mem18.offset| 8) (select |#length| |main_#t~mem18.base|)) (<= 0 |main_#t~mem18.offset|)), 13825#(and (<= 0 main_~lItem~0.offset) (<= (+ main_~lItem~0.offset 8) (select |#length| main_~lItem~0.base))), 13812#true, 13813#false, 13814#(= 0 |main_#t~malloc8.offset|), 13815#(= 0 main_~lItem~0.offset), 13816#(and (= 0 main_~data~0.offset) (= main_~data~0.base main_~lItem~0.base)), 13817#(= 0 main_~data~0.offset), 13818#(and (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)), 13819#(or (and (= 0 main_~lItem~0.offset) (<= main_~data~0.offset main_~lItem~0.offset)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 0 main_~lItem~0.offset))), 13820#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)))), 13821#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 13822#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem16.offset| 0)), 13823#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))] [2018-02-02 20:22:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:26,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:22:26,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:22:26,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:22:26,354 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand 14 states. [2018-02-02 20:22:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:26,917 INFO L93 Difference]: Finished difference Result 293 states and 333 transitions. [2018-02-02 20:22:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:22:26,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-02-02 20:22:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:26,918 INFO L225 Difference]: With dead ends: 293 [2018-02-02 20:22:26,918 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 20:22:26,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:22:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 20:22:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 222. [2018-02-02 20:22:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 20:22:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 276 transitions. [2018-02-02 20:22:26,920 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 276 transitions. Word has length 65 [2018-02-02 20:22:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:26,921 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 276 transitions. [2018-02-02 20:22:26,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:22:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 276 transitions. [2018-02-02 20:22:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:22:26,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:26,921 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:26,921 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1037707387, now seen corresponding path program 1 times [2018-02-02 20:22:26,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:26,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:27,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:27,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:22:27,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:27,169 INFO L182 omatonBuilderFactory]: Interpolants [14371#true, 14372#false, 14373#(= 0 |main_#t~malloc8.offset|), 14374#(= 0 main_~lItem~0.offset), 14375#(= 0 main_~data~0.offset), 14376#(and (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)), 14377#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4)))) (= 0 main_~lItem~0.offset)), 14378#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))), 14379#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 14380#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem16.offset| 0)), 14381#(<= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0), 14382#(<= |main_#t~mem18.offset| 0), 14383#(<= main_~lItem~0.offset 0)] [2018-02-02 20:22:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:27,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:22:27,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:22:27,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:22:27,170 INFO L87 Difference]: Start difference. First operand 222 states and 276 transitions. Second operand 13 states. [2018-02-02 20:22:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:27,470 INFO L93 Difference]: Finished difference Result 250 states and 287 transitions. [2018-02-02 20:22:27,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:22:27,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-02-02 20:22:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:27,471 INFO L225 Difference]: With dead ends: 250 [2018-02-02 20:22:27,471 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:22:27,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:22:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:22:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 222. [2018-02-02 20:22:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 20:22:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 275 transitions. [2018-02-02 20:22:27,474 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 275 transitions. Word has length 68 [2018-02-02 20:22:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:27,474 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 275 transitions. [2018-02-02 20:22:27,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:22:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 275 transitions. [2018-02-02 20:22:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:22:27,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:27,474 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:27,474 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash -75951232, now seen corresponding path program 1 times [2018-02-02 20:22:27,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:27,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:28,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:28,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:22:28,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:28,626 INFO L182 omatonBuilderFactory]: Interpolants [14870#true, 14871#false, 14872#(= 0 |main_#t~malloc3.offset|), 14873#(= main_~item~0.offset 0), 14874#(and (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 14875#(and (not (= 0 |main_#t~malloc8.base|)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 14876#(and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.offset 0) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 14877#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 14878#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= 0 main_~data~0.offset) (= 1 (select |#valid| main_~item~0.base)) (= main_~data~0.base main_~lItem~0.base) (= main_~item~0.offset 0)), 14879#(and (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1)), 14880#(and (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= main_~data~0.base |main_#t~malloc3.base|)) (not (= 0 main_~data~0.base))), 14881#(and (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base))), 14882#(and (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base))), 14883#(and (= main_~data~0.offset 0) (not (= 0 |main_#t~malloc8.base|)) (= (select |#valid| |main_#t~malloc8.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 14884#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))) (= main_~data~0.base main_~lItem~0.base))), 14885#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (or (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) 1) (not (= (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))))))), 14886#(and (= main_~data~0.offset 0) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 14887#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset 0) (or (= main_~data~0.base |main_#t~mem14.base|) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))))), 14888#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 14889#(or (and (= 1 (select |#valid| |main_#t~mem15.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~data~0.offset 0) (not (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 14890#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~data~0.offset 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 14891#(or (and (= main_~data~0.offset 0) (not (= 0 |main_#t~mem18.base|)) (not (= main_~item~0.base |main_#t~mem18.base|)) (= (select |#valid| |main_#t~mem18.base|) 1) (= 1 (select |#valid| main_~item~0.base))) (not (= |main_#t~mem18.offset| 0))), 14892#(or (not (= 0 main_~lItem~0.offset)) (and (= main_~data~0.offset 0) (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1))), 14893#(and (= main_~data~0.offset 0) (= 1 (select |#valid| main_~item~0.base))), 14894#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 20:22:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:28,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:22:28,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:22:28,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:22:28,628 INFO L87 Difference]: Start difference. First operand 222 states and 275 transitions. Second operand 25 states. [2018-02-02 20:22:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:30,512 INFO L93 Difference]: Finished difference Result 321 states and 385 transitions. [2018-02-02 20:22:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:22:30,512 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-02-02 20:22:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:30,513 INFO L225 Difference]: With dead ends: 321 [2018-02-02 20:22:30,513 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 20:22:30,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=534, Invalid=2328, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:22:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 20:22:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 219. [2018-02-02 20:22:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:22:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2018-02-02 20:22:30,516 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 72 [2018-02-02 20:22:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:30,516 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2018-02-02 20:22:30,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:22:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2018-02-02 20:22:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:22:30,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:30,517 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:30,517 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash -75951231, now seen corresponding path program 1 times [2018-02-02 20:22:30,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:30,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:31,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:31,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:22:31,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:31,372 INFO L182 omatonBuilderFactory]: Interpolants [15495#true, 15496#false, 15497#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 15498#(and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)), 15499#(and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 15500#(and (or (= 8 (select |#length| |main_#t~malloc8.base|)) (not (= main_~item~0.base |main_#t~malloc8.base|))) (or (and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1)) (= main_~item~0.base |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 15501#(and (or (and (= 8 (select |#length| main_~lItem~0.base)) (= main_~lItem~0.base main_~item~0.base)) (and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1))) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 15502#(and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= (select |#valid| main_~lItem~0.base) (select |#valid| main_~item~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 15503#(and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~lItem~0.base) (select |#valid| main_~item~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= 0 main_~data~0.offset) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 15504#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (= (select |#valid| main_~data~0.base) 1)), 15505#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= main_~data~0.base |main_#t~malloc3.base|))), 15506#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base))), 15507#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 15508#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (= 0 |main_#t~malloc8.offset|)) (and (= main_~data~0.base |main_#t~malloc8.base|) (= 0 |main_#t~malloc8.offset|))) (= 0 main_~data~0.offset)), 15509#(and (or (and (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))))) (= 0 main_~data~0.offset)), 15510#(and (= main_~data~0.offset 0) (or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) (+ main_~data~0.offset 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))))))), 15511#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 15512#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset)))), 15513#(and (= main_~data~0.offset 0) (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 15514#(and (= main_~data~0.offset 0) (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 20:22:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:31,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:22:31,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:22:31,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:22:31,373 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand 20 states. [2018-02-02 20:22:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:32,945 INFO L93 Difference]: Finished difference Result 341 states and 405 transitions. [2018-02-02 20:22:32,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:22:32,945 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-02-02 20:22:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:32,946 INFO L225 Difference]: With dead ends: 341 [2018-02-02 20:22:32,946 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 20:22:32,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=445, Invalid=1361, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:22:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 20:22:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 231. [2018-02-02 20:22:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 20:22:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 292 transitions. [2018-02-02 20:22:32,948 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 292 transitions. Word has length 72 [2018-02-02 20:22:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:32,949 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 292 transitions. [2018-02-02 20:22:32,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:22:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 292 transitions. [2018-02-02 20:22:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:22:32,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:32,949 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:32,949 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1940478412, now seen corresponding path program 1 times [2018-02-02 20:22:32,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:32,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:22:33,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:33,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:22:33,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:33,038 INFO L182 omatonBuilderFactory]: Interpolants [16135#true, 16136#false, 16137#(= 0 |main_#t~malloc8.offset|), 16138#(= 0 main_~lItem~0.offset), 16139#(= 0 main_~data~0.offset), 16140#(and (= main_~data~0.offset 0) (<= (+ main_~data~0.offset 8) (select |#length| main_~data~0.base))), 16141#(and (<= 4 main_~dst~0.offset) (<= (+ main_~dst~0.offset 4) (select |#length| main_~dst~0.base)))] [2018-02-02 20:22:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:22:33,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:22:33,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:22:33,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:22:33,039 INFO L87 Difference]: Start difference. First operand 231 states and 292 transitions. Second operand 7 states. [2018-02-02 20:22:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:33,191 INFO L93 Difference]: Finished difference Result 279 states and 328 transitions. [2018-02-02 20:22:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:22:33,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-02-02 20:22:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:33,192 INFO L225 Difference]: With dead ends: 279 [2018-02-02 20:22:33,192 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 20:22:33,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:22:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 20:22:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 248. [2018-02-02 20:22:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 20:22:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2018-02-02 20:22:33,194 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 73 [2018-02-02 20:22:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:33,195 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2018-02-02 20:22:33,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:22:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2018-02-02 20:22:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:22:33,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:33,195 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:33,195 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:33,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1940478411, now seen corresponding path program 1 times [2018-02-02 20:22:33,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:33,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:33,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:33,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:22:33,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:33,539 INFO L182 omatonBuilderFactory]: Interpolants [16682#true, 16683#false, 16684#(= 0 |main_#t~malloc8.offset|), 16685#(= 0 main_~lItem~0.offset), 16686#(and (= main_~data~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 16687#(= main_~data~0.offset 0), 16688#(and (= main_~data~0.offset |main_#t~malloc8.offset|) (= 0 |main_#t~malloc8.offset|)), 16689#(= main_~data~0.offset main_~lItem~0.offset), 16690#(and (= 1 (select |#valid| main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset)), 16691#(and (= 1 (select |#valid| main_~data~0.base)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (or (not (= main_~lItem~0.base main_~data~0.base)) (<= main_~data~0.offset main_~lItem~0.offset))), 16692#(and (= 1 (select |#valid| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 16693#(and (= 1 (select |#valid| main_~data~0.base)) (= |main_#t~mem14.offset| main_~data~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 16694#(and (= 1 (select |#valid| main_~data~0.base)) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 16695#(and (not (= main_~data~0.base |main_#t~mem18.base|)) (= 1 (select |#valid| main_~data~0.base))), 16696#(and (= 1 (select |#valid| main_~data~0.base)) (not (= main_~data~0.base main_~lItem~0.base))), 16697#(= 1 (select |#valid| main_~data~0.base)), 16698#(= 1 (select |#valid| main_~dst~0.base))] [2018-02-02 20:22:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:33,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:22:33,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:22:33,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:22:33,539 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand 17 states. [2018-02-02 20:22:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:34,068 INFO L93 Difference]: Finished difference Result 277 states and 324 transitions. [2018-02-02 20:22:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:22:34,068 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-02-02 20:22:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:34,069 INFO L225 Difference]: With dead ends: 277 [2018-02-02 20:22:34,069 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 20:22:34,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:22:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 20:22:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 247. [2018-02-02 20:22:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 20:22:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2018-02-02 20:22:34,072 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 73 [2018-02-02 20:22:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:34,072 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2018-02-02 20:22:34,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:22:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2018-02-02 20:22:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:22:34,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:34,073 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:34,073 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:34,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1940479215, now seen corresponding path program 1 times [2018-02-02 20:22:34,074 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:34,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:34,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:34,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:22:34,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:34,780 INFO L182 omatonBuilderFactory]: Interpolants [17257#true, 17258#false, 17259#(= 0 |main_#t~malloc3.offset|), 17260#(= main_~item~0.offset 0), 17261#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 17262#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 17263#(and (= main_~data~0.offset 0) (not (= 0 main_~lItem~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 17264#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base))), 17265#(and (= main_~data~0.offset 0) (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= 0 main_~data~0.base))), 17266#(and (= main_~data~0.offset 0) (= 1 (select |#valid| main_~item~0.base)) (not (= 0 main_~data~0.base))), 17267#(and (= main_~data~0.offset 0) (not (= 0 |main_#t~malloc8.base|)) (= (select |#valid| |main_#t~malloc8.base|) 1) (= 1 (select (store |#valid| |main_#t~malloc8.base| 0) main_~item~0.base)) (not (= 0 main_~data~0.base)) (= 0 |main_#t~malloc8.offset|)), 17268#(and (or (and (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1)) (= main_~lItem~0.base main_~data~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0)) (= main_~lItem~0.offset 0) (<= main_~data~0.offset main_~lItem~0.offset)), 17269#(and (or (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset) 0) main_~item~0.base))) (= main_~lItem~0.base main_~data~0.base)) (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)))) (<= main_~data~0.offset main_~lItem~0.offset)), 17270#(or (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= main_~data~0.offset 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 17271#(or (and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset 0) (= main_~data~0.base |main_#t~mem14.base|)) (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 17272#(or (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 17273#(and (or (= |main_#t~mem16.offset| 0) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) |main_#t~mem16.offset|)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ |main_#t~mem16.offset| 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)))), 17274#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) |main_#t~mem17.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 17275#(or (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)) (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) main_~item2~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 17276#(or (and (not (= 0 |main_#t~mem18.base|)) (= (select |#valid| |main_#t~mem18.base|) 1) (= 1 (select (store |#valid| |main_#t~mem18.base| 0) main_~item2~0.base))) (not (= |main_#t~mem18.offset| 0))), 17277#(or (not (= 0 main_~lItem~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item2~0.base)))), 17278#(= 1 (select |#valid| main_~item2~0.base))] [2018-02-02 20:22:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:34,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:22:34,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:22:34,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:22:34,781 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand 22 states. [2018-02-02 20:22:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:36,256 INFO L93 Difference]: Finished difference Result 329 states and 374 transitions. [2018-02-02 20:22:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:22:36,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-02 20:22:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:36,257 INFO L225 Difference]: With dead ends: 329 [2018-02-02 20:22:36,257 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 20:22:36,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:22:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 20:22:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 247. [2018-02-02 20:22:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 20:22:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2018-02-02 20:22:36,260 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 73 [2018-02-02 20:22:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:36,261 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2018-02-02 20:22:36,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:22:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2018-02-02 20:22:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:22:36,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:36,261 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:36,262 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1940479216, now seen corresponding path program 1 times [2018-02-02 20:22:36,262 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:36,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:36,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:36,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:22:36,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:36,872 INFO L182 omatonBuilderFactory]: Interpolants [17920#false, 17921#(= 0 |main_#t~malloc3.offset|), 17922#(= main_~item~0.offset 0), 17923#(and (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 17924#(and (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 17925#(and (= main_~data~0.offset 0) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 17926#(= main_~data~0.offset 0), 17927#(and (= main_~data~0.offset 0) (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 17928#(and (= 0 main_~item~0.offset) (= main_~data~0.offset 0) (= (select |#length| main_~item~0.base) 8)), 17929#(and (= 0 main_~item~0.offset) (= main_~data~0.offset |main_#t~malloc8.offset|) (<= 8 (select |#length| main_~item~0.base)) (= 0 |main_#t~malloc8.offset|)), 17930#(and (or (and (= 0 main_~item~0.offset) (<= 8 (select |#length| main_~item~0.base))) (= main_~lItem~0.base main_~data~0.base)) (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset))), 17931#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)))) (= main_~lItem~0.offset 0) (or (and (= 0 main_~item~0.offset) (<= 8 (select |#length| main_~item~0.base)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base))), 17932#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 17933#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset))), 17934#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 17935#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4))) (= |main_#t~mem16.offset| 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4))))), 17936#(and (= 0 |main_#t~mem17.offset|) (<= 8 (select |#length| |main_#t~mem17.base|))), 17937#(and (= main_~item2~0.offset 0) (<= 8 (select |#length| main_~item2~0.base))), 17919#true] [2018-02-02 20:22:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:36,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:22:36,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:22:36,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:22:36,873 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 19 states. [2018-02-02 20:22:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:37,668 INFO L93 Difference]: Finished difference Result 325 states and 375 transitions. [2018-02-02 20:22:37,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:22:37,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-02-02 20:22:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:37,669 INFO L225 Difference]: With dead ends: 325 [2018-02-02 20:22:37,669 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 20:22:37,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:22:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 20:22:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 259. [2018-02-02 20:22:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 20:22:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 329 transitions. [2018-02-02 20:22:37,672 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 329 transitions. Word has length 73 [2018-02-02 20:22:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:37,672 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 329 transitions. [2018-02-02 20:22:37,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:22:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 329 transitions. [2018-02-02 20:22:37,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:22:37,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:37,672 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:37,672 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash 101816595, now seen corresponding path program 1 times [2018-02-02 20:22:37,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:37,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:38,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:38,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:22:38,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:38,272 INFO L182 omatonBuilderFactory]: Interpolants [18570#true, 18571#false, 18572#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 18573#(and (= 8 (select |#length| main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 18574#(and (= 8 (select |#length| main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 18575#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 18576#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 18577#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 18578#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 18579#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 18580#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 18581#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (= 0 |main_#t~mem10.offset|)), 18582#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))), 18583#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))), 18584#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 18585#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 18586#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))), 18587#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base |main_#t~mem20.base|)), 18588#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 18589#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|))), 18590#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 20:22:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:38,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:22:38,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:22:38,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:22:38,273 INFO L87 Difference]: Start difference. First operand 259 states and 329 transitions. Second operand 21 states. [2018-02-02 20:22:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:39,445 INFO L93 Difference]: Finished difference Result 427 states and 520 transitions. [2018-02-02 20:22:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:22:39,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-02-02 20:22:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:39,447 INFO L225 Difference]: With dead ends: 427 [2018-02-02 20:22:39,447 INFO L226 Difference]: Without dead ends: 427 [2018-02-02 20:22:39,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:22:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-02 20:22:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 370. [2018-02-02 20:22:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 20:22:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 481 transitions. [2018-02-02 20:22:39,451 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 481 transitions. Word has length 78 [2018-02-02 20:22:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:39,451 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 481 transitions. [2018-02-02 20:22:39,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:22:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 481 transitions. [2018-02-02 20:22:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:22:39,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:39,452 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:39,452 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 101816594, now seen corresponding path program 1 times [2018-02-02 20:22:39,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:39,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:39,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:39,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:22:39,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:39,959 INFO L182 omatonBuilderFactory]: Interpolants [19456#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))), 19457#(= 1 (select |#valid| |main_#t~mem30.base|)), 19458#(= 1 (select |#valid| main_~data~0.base)), 19436#true, 19437#false, 19438#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 19439#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 19440#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (= (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset) main_~lItem~0.base)), 19441#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~data~0.offset) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 19442#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 19443#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 19444#(and (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 19445#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 19446#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|)), 19447#(or (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base))), 19448#(or (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|))), 19449#(or (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))) (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base))), 19450#(or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)))), 19451#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 19452#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))), 19453#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 19454#(or (= main_~data~0.base |main_#t~mem20.base|) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 19455#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))] [2018-02-02 20:22:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:39,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:22:39,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:22:39,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:22:39,960 INFO L87 Difference]: Start difference. First operand 370 states and 481 transitions. Second operand 23 states. [2018-02-02 20:22:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:40,827 INFO L93 Difference]: Finished difference Result 385 states and 496 transitions. [2018-02-02 20:22:40,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:22:40,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-02-02 20:22:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:40,829 INFO L225 Difference]: With dead ends: 385 [2018-02-02 20:22:40,829 INFO L226 Difference]: Without dead ends: 385 [2018-02-02 20:22:40,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:22:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-02 20:22:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 370. [2018-02-02 20:22:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 20:22:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 480 transitions. [2018-02-02 20:22:40,832 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 480 transitions. Word has length 78 [2018-02-02 20:22:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:40,832 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 480 transitions. [2018-02-02 20:22:40,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:22:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 480 transitions. [2018-02-02 20:22:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:22:40,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:40,832 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:40,832 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1376143518, now seen corresponding path program 1 times [2018-02-02 20:22:40,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:40,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:41,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:41,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:22:41,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:41,842 INFO L182 omatonBuilderFactory]: Interpolants [20258#true, 20259#false, 20260#(and (not (= 0 |main_#t~malloc8.base|)) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 20261#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 20262#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 20263#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~data~0.offset) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 20264#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 20265#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 20266#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 20267#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 20268#(or (and (= main_~data~0.base |main_#t~malloc8.base|) (not (= 0 |main_#t~malloc8.base|)) (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)) (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|))), 20269#(or (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 main_~lItem~0.offset) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base))), 20270#(or (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (= main_~lItem~0.offset 0) (= 0 |main_#t~mem10.offset|))), 20271#(or (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base))), 20272#(or (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (= main_~data~0.base main_~lItem~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)))), 20273#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 20274#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= |main_#t~mem16.offset| 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))), 20275#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 20276#(or (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|)) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)))), 20277#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 20278#(or (and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base |main_#t~mem20.base|)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 20279#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 20280#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 20281#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base main_~dst~0.base) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 20282#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|))), 20283#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 20:22:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:41,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:22:41,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:22:41,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:22:41,843 INFO L87 Difference]: Start difference. First operand 370 states and 480 transitions. Second operand 26 states. [2018-02-02 20:22:43,677 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 67 DAG size of output 59 [2018-02-02 20:22:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:44,396 INFO L93 Difference]: Finished difference Result 519 states and 654 transitions. [2018-02-02 20:22:44,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:22:44,396 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-02-02 20:22:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:44,397 INFO L225 Difference]: With dead ends: 519 [2018-02-02 20:22:44,397 INFO L226 Difference]: Without dead ends: 519 [2018-02-02 20:22:44,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=421, Invalid=2129, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:22:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-02-02 20:22:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 398. [2018-02-02 20:22:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 20:22:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 514 transitions. [2018-02-02 20:22:44,402 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 514 transitions. Word has length 79 [2018-02-02 20:22:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:44,402 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 514 transitions. [2018-02-02 20:22:44,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:22:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2018-02-02 20:22:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:22:44,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:44,402 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:44,402 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1376143517, now seen corresponding path program 1 times [2018-02-02 20:22:44,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:44,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:45,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:45,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:22:45,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:45,362 INFO L182 omatonBuilderFactory]: Interpolants [21255#true, 21256#false, 21257#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 21258#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 21259#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 21260#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (not (= 0 main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 21261#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 21262#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 21263#(and (= main_~data~0.offset 0) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 21264#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 21265#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|)), 21266#(and (= main_~data~0.offset 0) (or (= main_~lItem~0.base main_~data~0.base) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 main_~lItem~0.offset) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)))), 21267#(and (= main_~data~0.offset 0) (or (= main_~data~0.base |main_#t~mem10.base|) (= main_~lItem~0.base main_~data~0.base)) (= 0 main_~lItem~0.offset) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)))), 21268#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)))), 21269#(and (or (and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base)) (or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)))) (not (= main_~lItem~0.base main_~data~0.base))) (<= main_~data~0.offset main_~lItem~0.offset)), 21270#(or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 21271#(or (and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= main_~data~0.base |main_#t~mem14.base|))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 21272#(or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 21273#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= |main_#t~mem16.offset| 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))), 21274#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 21275#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))), 21276#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 21277#(or (= main_~data~0.base |main_#t~mem20.base|) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 21278#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 21279#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))), 21280#(or (and (= main_~data~0.base main_~dst~0.base) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 21281#(= 1 (select |#valid| |main_#t~mem30.base|)), 21282#(= 1 (select |#valid| main_~data~0.base))] [2018-02-02 20:22:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:45,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:22:45,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:22:45,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:22:45,362 INFO L87 Difference]: Start difference. First operand 398 states and 514 transitions. Second operand 28 states. [2018-02-02 20:22:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:46,671 INFO L93 Difference]: Finished difference Result 431 states and 552 transitions. [2018-02-02 20:22:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:22:46,672 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-02-02 20:22:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:46,673 INFO L225 Difference]: With dead ends: 431 [2018-02-02 20:22:46,673 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 20:22:46,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=454, Invalid=2408, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:22:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 20:22:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 393. [2018-02-02 20:22:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 20:22:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 508 transitions. [2018-02-02 20:22:46,676 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 508 transitions. Word has length 79 [2018-02-02 20:22:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:46,676 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 508 transitions. [2018-02-02 20:22:46,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:22:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 508 transitions. [2018-02-02 20:22:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:22:46,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:46,676 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:46,676 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1577747984, now seen corresponding path program 1 times [2018-02-02 20:22:46,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:46,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:48,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:48,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:22:48,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:48,156 INFO L182 omatonBuilderFactory]: Interpolants [22163#true, 22164#false, 22165#(= 0 |main_#t~malloc3.offset|), 22166#(= main_~item~0.offset 0), 22167#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset 0)), 22168#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= 0 |main_#t~malloc8.base|)) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 22169#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset main_~lItem~0.base)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.offset 0) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 22170#(and (not (= main_~item~0.base main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= (select |#valid| main_~lItem~0.base) (select |#valid| main_~item~0.base)) (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset 0)), 22171#(and (= (select |#valid| main_~lItem~0.base) 1) (= (select |#valid| main_~lItem~0.base) (select |#valid| main_~item~0.base)) (= main_~lItem~0.offset 0) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (= main_~lItem~0.base main_~data~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset)) (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0)), 22172#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) 1) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))), 22173#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) |main_#t~malloc3.base|)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (not (= 0 main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))), 22174#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4))) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4))) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4)) main_~data~0.base)) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4))))), 22175#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))), 22176#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) |main_#t~malloc8.base|)) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))) (and (not (= 0 |main_#t~malloc8.base|)) (= (select |#valid| |main_#t~malloc8.base|) 1) (not (= 0 main_~data~0.base)) (= |main_#t~malloc8.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (= 0 |main_#t~malloc8.offset|))) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= 0 main_~data~0.offset)), 22177#(and (not (= main_~lItem~0.base main_~data~0.base)) (or (and (= main_~lItem~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (<= main_~data~0.offset main_~lItem~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= main_~lItem~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))))) (= 0 main_~data~0.offset)), 22178#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) |main_#t~mem10.offset|) (or (and (not (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.base|)) main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.base|)) main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.offset|)) (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.base|)) main_~data~0.base) (+ main_~data~0.offset 4))) (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.offset|)) main_~data~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.base|)) (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.base|)) main_~data~0.base) (+ main_~data~0.offset 4))) (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.offset|)) main_~data~0.base) (+ 0 4))))) (and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset |main_#t~mem10.base|)) main_~data~0.base) (+ main_~data~0.offset 4))) (<= main_~data~0.offset main_~lItem~0.offset)))), 22179#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))) (select (store (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))) (select (store (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (+ 0 4)))) (not (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))))) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) 1) (= (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset) (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))) (<= main_~data~0.offset main_~lItem~0.offset))) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))), 22180#(and (= main_~data~0.offset 0) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (select (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (+ 0 4)))) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))))), 22181#(and (= main_~data~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)) |main_#t~mem15.offset|) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) |main_#t~mem15.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (select (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) (select (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (+ 0 4)))) (not (= |main_#t~mem15.base| main_~data~0.base))))), 22182#(and (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~data~0.base)))) (= main_~data~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)) main_~item~0.offset)), 22183#(and (= main_~data~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~data~0.base))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 |main_#t~mem18.base|)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)) main_~item~0.offset)), 22184#(and (= main_~data~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~data~0.base))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~lItem~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~lItem~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)) main_~item~0.offset)), 22185#(and (= main_~data~0.offset 0) (= main_~item~0.offset (select (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (+ main_~data~0.offset 4))) (or (and (= main_~lItem~0.base main_~item~0.base) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~data~0.base))))), 22186#(and (= main_~data~0.offset 0) (= main_~item~0.offset (select (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (+ main_~data~0.offset 4))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~data~0.base))) (not (= 1 (select |#valid| main_~item~0.base))))), 22187#(or (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~item~0.base) main_~item~0.offset))) (not (= 1 (select |#valid| main_~item~0.base)))), 22188#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~item~0.base) main_~item~0.offset))), 22189#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 22190#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 22191#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0))] [2018-02-02 20:22:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:48,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:22:48,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:22:48,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:22:48,157 INFO L87 Difference]: Start difference. First operand 393 states and 508 transitions. Second operand 29 states. [2018-02-02 20:22:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:50,390 INFO L93 Difference]: Finished difference Result 406 states and 520 transitions. [2018-02-02 20:22:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:22:50,390 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-02-02 20:22:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:50,392 INFO L225 Difference]: With dead ends: 406 [2018-02-02 20:22:50,392 INFO L226 Difference]: Without dead ends: 406 [2018-02-02 20:22:50,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=497, Invalid=3535, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:22:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-02 20:22:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 394. [2018-02-02 20:22:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-02 20:22:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 508 transitions. [2018-02-02 20:22:50,396 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 508 transitions. Word has length 82 [2018-02-02 20:22:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:50,397 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 508 transitions. [2018-02-02 20:22:50,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:22:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2018-02-02 20:22:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:22:50,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:50,397 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:50,397 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1422369979, now seen corresponding path program 1 times [2018-02-02 20:22:50,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:50,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:50,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:50,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:22:50,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:50,877 INFO L182 omatonBuilderFactory]: Interpolants [23072#(and (not (= main_~data~0.base |main_#t~malloc8.base|)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 23073#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 23074#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (= main_~data~0.offset |main_#t~mem10.offset|)), 23075#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))), 23076#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset))), 23077#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 23078#(and (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 23079#(and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))), 23080#(and (= main_~data~0.offset |main_#t~mem20.offset|) (= main_~data~0.base |main_#t~mem20.base|)), 23081#(= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 23082#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem30.base|) |main_#t~mem30.offset|))), 23083#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 23084#(= 1 (select |#valid| |main_#t~mem16.base|)), 23065#true, 23066#false, 23067#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 23068#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 23069#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 23070#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 23071#(and (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)))] [2018-02-02 20:22:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:50,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:22:50,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:22:50,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:22:50,878 INFO L87 Difference]: Start difference. First operand 394 states and 508 transitions. Second operand 20 states. [2018-02-02 20:22:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:51,571 INFO L93 Difference]: Finished difference Result 422 states and 537 transitions. [2018-02-02 20:22:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:22:51,571 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-02-02 20:22:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:51,572 INFO L225 Difference]: With dead ends: 422 [2018-02-02 20:22:51,572 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 20:22:51,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:22:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 20:22:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 404. [2018-02-02 20:22:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-02 20:22:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 520 transitions. [2018-02-02 20:22:51,577 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 520 transitions. Word has length 83 [2018-02-02 20:22:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:51,577 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 520 transitions. [2018-02-02 20:22:51,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:22:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 520 transitions. [2018-02-02 20:22:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:22:51,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:51,578 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:51,578 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1422369980, now seen corresponding path program 1 times [2018-02-02 20:22:51,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:51,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:52,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:52,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:22:52,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:52,352 INFO L182 omatonBuilderFactory]: Interpolants [23968#(or (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 23969#(and (= (select (select |#memory_$Pointer$.base| |main_#t~mem30.base|) |main_#t~mem30.offset|) |main_#t~mem30.base|) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem30.base|) |main_#t~mem30.offset|))), 23970#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 23971#(and (= |main_#t~mem14.offset| main_~data~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 23948#true, 23949#false, 23950#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 23951#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 23952#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (= (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset) main_~lItem~0.base)), 23953#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= 0 main_~data~0.offset) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 23954#(and (= 0 main_~data~0.offset) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 23955#(and (= 0 main_~data~0.offset) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 23956#(and (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 23957#(and (= 0 main_~data~0.offset) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 23958#(and (= 0 main_~data~0.offset) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|)), 23959#(or (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base))), 23960#(or (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (= main_~data~0.offset |main_#t~mem10.offset|))), 23961#(or (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))) (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base))), 23962#(or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)))), 23963#(or (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 23964#(or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))), 23965#(or (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset)))), 23966#(or (and (= main_~data~0.offset |main_#t~mem20.offset|) (= main_~data~0.base |main_#t~mem20.base|)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 23967#(or (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))] [2018-02-02 20:22:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:52,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:22:52,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:22:52,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:22:52,353 INFO L87 Difference]: Start difference. First operand 404 states and 520 transitions. Second operand 24 states. [2018-02-02 20:22:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:53,227 INFO L93 Difference]: Finished difference Result 431 states and 547 transitions. [2018-02-02 20:22:53,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:22:53,256 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 83 [2018-02-02 20:22:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:53,257 INFO L225 Difference]: With dead ends: 431 [2018-02-02 20:22:53,257 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 20:22:53,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:22:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 20:22:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 400. [2018-02-02 20:22:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-02 20:22:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 514 transitions. [2018-02-02 20:22:53,260 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 514 transitions. Word has length 83 [2018-02-02 20:22:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:53,260 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 514 transitions. [2018-02-02 20:22:53,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:22:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 514 transitions. [2018-02-02 20:22:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:22:53,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:53,261 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:53,261 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:53,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1287273604, now seen corresponding path program 1 times [2018-02-02 20:22:53,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:53,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:53,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:53,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:22:53,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:53,317 INFO L182 omatonBuilderFactory]: Interpolants [24848#(<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base)), 24849#(and (= main_~item2~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)) (= main_~item2~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base))), 24850#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset))), 24851#(and (<= 0 |main_#t~mem27.offset|) (<= (+ |main_#t~mem27.offset| 8) (select |#length| |main_#t~mem27.base|))), 24852#(and (<= (+ main_~dst~0.offset 8) (select |#length| main_~dst~0.base)) (<= 0 main_~dst~0.offset)), 24846#true, 24847#false] [2018-02-02 20:22:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:53,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:22:53,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:22:53,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:22:53,317 INFO L87 Difference]: Start difference. First operand 400 states and 514 transitions. Second operand 7 states. [2018-02-02 20:22:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:53,639 INFO L93 Difference]: Finished difference Result 537 states and 680 transitions. [2018-02-02 20:22:53,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:22:53,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-02-02 20:22:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:53,641 INFO L225 Difference]: With dead ends: 537 [2018-02-02 20:22:53,641 INFO L226 Difference]: Without dead ends: 537 [2018-02-02 20:22:53,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:22:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-02-02 20:22:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 440. [2018-02-02 20:22:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 20:22:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 583 transitions. [2018-02-02 20:22:53,645 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 583 transitions. Word has length 83 [2018-02-02 20:22:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:53,645 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 583 transitions. [2018-02-02 20:22:53,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:22:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 583 transitions. [2018-02-02 20:22:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:22:53,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:53,646 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:53,646 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1287273605, now seen corresponding path program 1 times [2018-02-02 20:22:53,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:53,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:53,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:53,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:22:53,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:53,687 INFO L182 omatonBuilderFactory]: Interpolants [25844#true, 25845#false, 25846#(= 1 (select |#valid| main_~item2~0.base)), 25847#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset))), 25848#(= 1 (select |#valid| |main_#t~mem27.base|)), 25849#(= 1 (select |#valid| main_~dst~0.base))] [2018-02-02 20:22:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:53,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:22:53,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:22:53,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:22:53,687 INFO L87 Difference]: Start difference. First operand 440 states and 583 transitions. Second operand 6 states. [2018-02-02 20:22:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:53,854 INFO L93 Difference]: Finished difference Result 521 states and 656 transitions. [2018-02-02 20:22:53,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:22:53,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-02 20:22:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:53,855 INFO L225 Difference]: With dead ends: 521 [2018-02-02 20:22:53,855 INFO L226 Difference]: Without dead ends: 521 [2018-02-02 20:22:53,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:22:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-02 20:22:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 436. [2018-02-02 20:22:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 20:22:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 563 transitions. [2018-02-02 20:22:53,859 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 563 transitions. Word has length 83 [2018-02-02 20:22:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:53,859 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 563 transitions. [2018-02-02 20:22:53,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:22:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 563 transitions. [2018-02-02 20:22:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:22:53,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:53,860 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:53,860 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1287272801, now seen corresponding path program 1 times [2018-02-02 20:22:53,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:53,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:54,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:54,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:22:54,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:54,608 INFO L182 omatonBuilderFactory]: Interpolants [26816#false, 26817#(= 0 |main_#t~malloc3.offset|), 26818#(= main_~item~0.offset 0), 26819#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~item~0.offset 0)), 26820#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.base main_~data~0.base) (= main_~item~0.offset 0)), 26821#(= (select |#valid| main_~data~0.base) 1), 26822#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= (select |#valid| main_~data~0.base) 1)), 26823#(and (not (= main_~item~0.base main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (= main_~item~0.offset 0)), 26824#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (= main_~item~0.offset 0)), 26825#(and (= 0 main_~item~0.offset) (not (= main_~data~0.base |main_#t~malloc8.base|)) (not (= main_~item~0.base main_~data~0.base)) (or (not (= 0 |main_#t~malloc8.base|)) (not (= main_~item~0.base |main_#t~malloc8.base|))) (= 0 |main_#t~malloc8.offset|) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base |main_#t~malloc8.base|))), 26826#(and (= 0 main_~item~0.offset) (not (= main_~lItem~0.base main_~data~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~lItem~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (and (= main_~lItem~0.base main_~item~0.base) (not (= 0 main_~lItem~0.base)))) (not (= main_~item~0.base main_~data~0.base)) (= 0 main_~lItem~0.offset)), 26827#(and (= 0 main_~item~0.offset) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~lItem~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (or (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset) main_~item~0.base) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (and (not (= main_~item~0.base main_~lItem~0.base)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))))), 26828#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (or (and (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) 0)) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 26829#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4))) (= |main_#t~mem16.offset| 0) (or (and (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ |main_#t~mem16.offset| 4))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4))) 0)) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4))) 0))))), 26830#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) |main_#t~mem17.base|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) 0)) (not (= main_~data~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem17.base|) 0)))) (= 0 |main_#t~mem17.offset|)), 26831#(and (= main_~item2~0.offset 0) (or (and (= main_~item2~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset)) (not (= main_~data~0.base main_~item2~0.base))))), 26832#(and (= main_~item2~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset)) (not (= main_~data~0.base main_~item2~0.base))) (and (not (= 0 |main_#t~mem18.base|)) (= main_~item2~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 26833#(and (= main_~item2~0.offset 0) (or (and (= main_~lItem~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~item2~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~lItem~0.base))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset)) (not (= main_~data~0.base main_~item2~0.base))))), 26834#(and (= main_~item2~0.offset 0) (or (and (= main_~lItem~0.base main_~item2~0.base) (not (= 0 main_~lItem~0.base))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset)) (not (= main_~data~0.base main_~item2~0.base))))), 26835#(and (= main_~item2~0.offset 0) (or (not (= 1 (select |#valid| main_~item2~0.base))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset)) (not (= main_~data~0.base main_~item2~0.base))))), 26836#(and (= main_~item2~0.offset 0) (or (not (= 1 (select |#valid| main_~item2~0.base))) (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base)) main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset)) main_~item2~0.base) main_~item2~0.offset))))), 26837#(or (not (= 1 (select |#valid| main_~item2~0.base))) (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base)) main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset)) main_~item2~0.base) main_~item2~0.offset)))), 26838#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base)) main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset)) main_~item2~0.base) main_~item2~0.offset))), 26839#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item2~0.base) main_~item2~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset))), 26840#(and (= 0 |main_#t~mem26.base|) (= 0 |main_#t~mem26.offset|)), 26841#(and (= main_~item2~0.offset 0) (= main_~item2~0.base 0)), 26815#true] [2018-02-02 20:22:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:54,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:22:54,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:22:54,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:22:54,608 INFO L87 Difference]: Start difference. First operand 436 states and 563 transitions. Second operand 27 states. [2018-02-02 20:22:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:56,654 INFO L93 Difference]: Finished difference Result 546 states and 676 transitions. [2018-02-02 20:22:56,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 20:22:56,655 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-02-02 20:22:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:56,656 INFO L225 Difference]: With dead ends: 546 [2018-02-02 20:22:56,656 INFO L226 Difference]: Without dead ends: 546 [2018-02-02 20:22:56,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=695, Invalid=4707, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 20:22:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-02 20:22:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 431. [2018-02-02 20:22:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-02 20:22:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 552 transitions. [2018-02-02 20:22:56,660 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 552 transitions. Word has length 83 [2018-02-02 20:22:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:56,660 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 552 transitions. [2018-02-02 20:22:56,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:22:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 552 transitions. [2018-02-02 20:22:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:22:56,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:56,660 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:56,660 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash -291900400, now seen corresponding path program 1 times [2018-02-02 20:22:56,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:56,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:57,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:22:57,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:22:57,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:57,637 INFO L182 omatonBuilderFactory]: Interpolants [27915#true, 27916#false, 27917#(and (not (= 0 |main_#t~malloc8.base|)) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 27918#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 27919#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 27920#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 27921#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 27922#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 27923#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 27924#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 27925#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (or (= main_~data~0.base |main_#t~malloc8.base|) (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= 0 |main_#t~malloc8.offset|)), 27926#(and (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 main_~lItem~0.offset) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~data~0.base))))), 27927#(and (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (= 0 main_~lItem~0.offset) (= 0 |main_#t~mem10.offset|) (= main_~data~0.offset |main_#t~mem10.offset|)) (= main_~lItem~0.base main_~data~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~data~0.base))))), 27928#(and (or (= main_~lItem~0.base main_~data~0.base) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset))) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~data~0.base))))), 27929#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))))) (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base))), 27930#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 27931#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= |main_#t~mem16.offset| 0) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 27932#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 27933#(or (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|)) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)))), 27934#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 27935#(or (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)) (and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset |main_#t~mem20.offset|) (= main_~data~0.base |main_#t~mem20.base|))), 27936#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 27937#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 27938#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base main_~dst~0.base) (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (= (+ main_~data~0.offset 4) main_~dst~0.offset)) (= 0 (select |#valid| main_~data~0.base))), 27939#(or (and (= 8 (select |#length| main_~data~0.base)) (or (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 27940#(and (= 8 (select |#length| |main_#t~mem30.base|)) (or (and (= (select (select |#memory_$Pointer$.base| |main_#t~mem30.base|) |main_#t~mem30.offset|) |main_#t~mem30.base|) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem30.base|) |main_#t~mem30.offset|))) (not (= 0 |main_#t~mem30.offset|)))), 27941#(and (or (not (= main_~data~0.offset 0)) (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= (select |#length| main_~data~0.base) 8)), 27942#(and (or (and (= |main_#t~mem14.offset| main_~data~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= main_~data~0.offset 0)) (<= 0 main_~data~0.offset))) (= (select |#length| main_~data~0.base) 8)), 27943#(and (not (= main_~data~0.offset 0)) (<= 0 main_~data~0.offset) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 20:22:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:57,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:22:57,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:22:57,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:22:57,637 INFO L87 Difference]: Start difference. First operand 431 states and 552 transitions. Second operand 29 states. [2018-02-02 20:22:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:59,689 INFO L93 Difference]: Finished difference Result 409 states and 493 transitions. [2018-02-02 20:22:59,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:22:59,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-02-02 20:22:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:59,690 INFO L225 Difference]: With dead ends: 409 [2018-02-02 20:22:59,690 INFO L226 Difference]: Without dead ends: 408 [2018-02-02 20:22:59,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:22:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-02-02 20:22:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 369. [2018-02-02 20:22:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-02 20:22:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 451 transitions. [2018-02-02 20:22:59,694 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 451 transitions. Word has length 84 [2018-02-02 20:22:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:59,694 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 451 transitions. [2018-02-02 20:22:59,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:22:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 451 transitions. [2018-02-02 20:22:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:22:59,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:59,695 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:59,695 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 92341820, now seen corresponding path program 1 times [2018-02-02 20:22:59,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:59,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:59,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:59,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:22:59,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:59,736 INFO L182 omatonBuilderFactory]: Interpolants [28784#(= 1 (select |#valid| main_~dst~0.base)), 28779#true, 28780#false, 28781#(= 1 (select |#valid| main_~item~0.base)), 28782#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset))), 28783#(= 1 (select |#valid| |main_#t~mem27.base|))] [2018-02-02 20:22:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:59,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:22:59,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:22:59,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:22:59,737 INFO L87 Difference]: Start difference. First operand 369 states and 451 transitions. Second operand 6 states. [2018-02-02 20:22:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:59,872 INFO L93 Difference]: Finished difference Result 426 states and 503 transitions. [2018-02-02 20:22:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:22:59,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-02-02 20:22:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:59,873 INFO L225 Difference]: With dead ends: 426 [2018-02-02 20:22:59,873 INFO L226 Difference]: Without dead ends: 426 [2018-02-02 20:22:59,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:22:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-02 20:22:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 376. [2018-02-02 20:22:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-02 20:22:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 459 transitions. [2018-02-02 20:22:59,876 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 459 transitions. Word has length 84 [2018-02-02 20:22:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:59,876 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 459 transitions. [2018-02-02 20:22:59,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:22:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 459 transitions. [2018-02-02 20:22:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:22:59,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:22:59,876 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:22:59,876 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:22:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash 92341821, now seen corresponding path program 1 times [2018-02-02 20:22:59,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:22:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:22:59,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:22:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:59,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:22:59,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:22:59,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:22:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:22:59,943 INFO L182 omatonBuilderFactory]: Interpolants [29600#(and (<= 0 |main_#t~mem27.offset|) (<= (+ |main_#t~mem27.offset| 8) (select |#length| |main_#t~mem27.base|))), 29601#(and (<= (+ main_~dst~0.offset 8) (select |#length| main_~dst~0.base)) (<= 0 main_~dst~0.offset)), 29595#true, 29596#false, 29597#(<= (+ main_~item~0.offset 8) (select |#length| main_~item~0.base)), 29598#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (<= (+ main_~item~0.offset 8) (select |#length| main_~item~0.base))), 29599#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)))] [2018-02-02 20:22:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:22:59,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:22:59,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:22:59,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:22:59,943 INFO L87 Difference]: Start difference. First operand 376 states and 459 transitions. Second operand 7 states. [2018-02-02 20:23:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:00,167 INFO L93 Difference]: Finished difference Result 437 states and 505 transitions. [2018-02-02 20:23:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:23:00,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-02-02 20:23:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:00,168 INFO L225 Difference]: With dead ends: 437 [2018-02-02 20:23:00,168 INFO L226 Difference]: Without dead ends: 437 [2018-02-02 20:23:00,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:23:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-02 20:23:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 354. [2018-02-02 20:23:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-02 20:23:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 416 transitions. [2018-02-02 20:23:00,171 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 416 transitions. Word has length 84 [2018-02-02 20:23:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:00,171 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 416 transitions. [2018-02-02 20:23:00,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:23:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 416 transitions. [2018-02-02 20:23:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:23:00,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:00,171 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:00,171 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2132007491, now seen corresponding path program 1 times [2018-02-02 20:23:00,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:00,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:00,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:00,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:23:00,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:00,547 INFO L182 omatonBuilderFactory]: Interpolants [30407#true, 30408#false, 30409#(= 0 |main_#t~malloc3.offset|), 30410#(= main_~item~0.offset 0), 30411#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 30412#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 30413#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~data~0.offset) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 30414#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base))), 30415#(and (not (= 0 |main_#t~malloc3.base|)) (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base))), 30416#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (not (= 0 main_~item~0.base))), 30417#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= 0 |main_#t~malloc8.offset|) (not (= 0 main_~item~0.base))), 30418#(and (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset))) (or (= main_~lItem~0.base main_~data~0.base) (not (= 0 main_~item~0.base)))), 30419#(and (or (and (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~item~0.base))) (= main_~lItem~0.base main_~data~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (<= main_~data~0.offset main_~lItem~0.offset))) (= main_~lItem~0.offset 0)), 30420#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 30421#(or (and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ |main_#t~mem16.offset| 4)))) (= |main_#t~mem16.offset| 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 30422#(or (not (= 0 |main_#t~mem17.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 30423#(or (not (= 0 main_~item2~0.base)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 30424#(or (not (= 0 main_~item2~0.base)) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))), 30425#(or (not (= 0 main_~item2~0.base)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 30426#(or (not (= 0 main_~item2~0.base)) (= 0 (select |#valid| main_~data~0.base))), 30427#(= 0 (select |#valid| main_~data~0.base))] [2018-02-02 20:23:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:00,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:23:00,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:23:00,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:23:00,548 INFO L87 Difference]: Start difference. First operand 354 states and 416 transitions. Second operand 21 states. [2018-02-02 20:23:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:01,547 INFO L93 Difference]: Finished difference Result 381 states and 434 transitions. [2018-02-02 20:23:01,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:23:01,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-02-02 20:23:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:01,548 INFO L225 Difference]: With dead ends: 381 [2018-02-02 20:23:01,548 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 20:23:01,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:23:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 20:23:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 355. [2018-02-02 20:23:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-02 20:23:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 416 transitions. [2018-02-02 20:23:01,551 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 416 transitions. Word has length 85 [2018-02-02 20:23:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:01,551 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 416 transitions. [2018-02-02 20:23:01,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:23:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 416 transitions. [2018-02-02 20:23:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:23:01,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:01,552 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:01,552 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash -278400046, now seen corresponding path program 1 times [2018-02-02 20:23:01,553 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:01,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:02,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:02,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:23:02,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:02,022 INFO L182 omatonBuilderFactory]: Interpolants [31232#(and (or (and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ |main_#t~mem16.offset| 4))))) (<= (+ |main_#t~mem16.offset| 1) 0) (<= 1 |main_#t~mem16.offset|)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 31233#(or (not (= 0 |main_#t~mem17.base|)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 1) 0) (<= 1 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 31234#(or (not (= 0 main_~item2~0.base)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 1) 0) (<= 1 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 31235#(or (<= (+ |main_#t~mem18.offset| 1) 0) (not (= 0 main_~item2~0.base)) (<= 1 |main_#t~mem18.offset|)), 31236#(or (<= (+ main_~lItem~0.offset 1) 0) (not (= 0 main_~item2~0.base)) (<= 1 main_~lItem~0.offset)), 31237#(or (not (= 0 main_~item2~0.base)) (<= 1 main_~lItem~0.offset)), 31238#(not (= 0 main_~item2~0.base)), 31239#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 31216#true, 31217#false, 31218#(= 0 |main_#t~malloc3.offset|), 31219#(= main_~item~0.offset 0), 31220#(and (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 31221#(and (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 31222#(and (= main_~data~0.offset 0) (= main_~item~0.offset 0)), 31223#(= main_~data~0.offset 0), 31224#(and (= main_~data~0.offset 0) (not (= 0 |main_#t~malloc3.base|))), 31225#(and (= main_~data~0.offset 0) (not (= 0 main_~item~0.base))), 31226#(and (= main_~data~0.offset 0) (= 0 |main_#t~malloc8.offset|) (not (= 0 main_~item~0.base))), 31227#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0)) (= main_~lItem~0.offset 0) (or (= main_~lItem~0.base main_~data~0.base) (not (= 0 main_~item~0.base)))), 31228#(and (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)))) (or (= main_~lItem~0.base main_~data~0.base) (and (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~item~0.base))))), 31229#(or (and (= main_~data~0.offset 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))))), 31230#(or (and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset 0) (= main_~data~0.base |main_#t~mem14.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))))), 31231#(or (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))))] [2018-02-02 20:23:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:02,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:23:02,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:23:02,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:23:02,023 INFO L87 Difference]: Start difference. First operand 355 states and 416 transitions. Second operand 24 states. [2018-02-02 20:23:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:02,994 INFO L93 Difference]: Finished difference Result 366 states and 416 transitions. [2018-02-02 20:23:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:23:02,994 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2018-02-02 20:23:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:02,995 INFO L225 Difference]: With dead ends: 366 [2018-02-02 20:23:02,995 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 20:23:02,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=1961, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:23:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 20:23:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 352. [2018-02-02 20:23:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 20:23:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 411 transitions. [2018-02-02 20:23:02,998 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 411 transitions. Word has length 86 [2018-02-02 20:23:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:02,998 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 411 transitions. [2018-02-02 20:23:02,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:23:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 411 transitions. [2018-02-02 20:23:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:23:02,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:02,999 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:02,999 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1950357990, now seen corresponding path program 1 times [2018-02-02 20:23:02,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:03,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:03,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:03,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:23:03,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:03,550 INFO L182 omatonBuilderFactory]: Interpolants [32010#true, 32011#false, 32012#(and (not (= 0 |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 32013#(and (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 32014#(and (= 0 |main_#t~malloc8.offset|) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 32015#(and (= 0 main_~lItem~0.offset) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 32016#(and (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 32017#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= 0 main_~data~0.offset) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 32018#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= (select |#valid| main_~data~0.base) 1)), 32019#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 |main_#t~malloc3.base|)) (= 0 main_~data~0.offset) (not (= main_~data~0.base |main_#t~malloc3.base|))), 32020#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~item~0.base))), 32021#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (not (= 0 main_~item~0.base))), 32022#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|) (not (= 0 main_~item~0.base))), 32023#(and (= main_~lItem~0.offset 0) (= 0 main_~data~0.offset) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~item~0.base))) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= main_~lItem~0.base main_~data~0.base))), 32024#(and (= main_~data~0.offset 0) (or (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4)))) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~item~0.base)))), 32025#(and (= main_~data~0.offset 0) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 32026#(and (= main_~data~0.offset 0) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 32027#(and (= main_~data~0.offset 0) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)))), 32028#(and (= main_~data~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)) (not (= 0 |main_#t~mem15.base|)))), 32029#(and (= main_~data~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)) (not (= 0 main_~item~0.base)))), 32030#(and (= main_~data~0.offset 0) (or (not (= |main_#t~mem18.offset| 0)) (not (= 0 main_~item~0.base)))), 32031#(and (= main_~data~0.offset 0) (or (not (= 0 main_~lItem~0.offset)) (not (= 0 main_~item~0.base)))), 32032#(and (= main_~data~0.offset 0) (not (= 0 main_~item~0.base))), 32033#(and (= main_~data~0.offset 0) (= (+ main_~data~0.offset 4) main_~dst~0.offset) (not (= 0 main_~item~0.base))), 32034#(or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))] [2018-02-02 20:23:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:03,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:23:03,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:23:03,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:23:03,550 INFO L87 Difference]: Start difference. First operand 352 states and 411 transitions. Second operand 25 states. [2018-02-02 20:23:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:04,337 INFO L93 Difference]: Finished difference Result 359 states and 415 transitions. [2018-02-02 20:23:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:23:04,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-02-02 20:23:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:04,338 INFO L225 Difference]: With dead ends: 359 [2018-02-02 20:23:04,338 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 20:23:04,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=519, Invalid=1931, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:23:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 20:23:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 330. [2018-02-02 20:23:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:23:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 385 transitions. [2018-02-02 20:23:04,341 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 385 transitions. Word has length 87 [2018-02-02 20:23:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:04,341 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 385 transitions. [2018-02-02 20:23:04,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:23:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 385 transitions. [2018-02-02 20:23:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:23:04,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:04,342 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:04,342 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash 960015950, now seen corresponding path program 1 times [2018-02-02 20:23:04,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:04,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:05,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:05,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 20:23:05,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:05,917 INFO L182 omatonBuilderFactory]: Interpolants [32776#true, 32777#false, 32778#(and (not (= 0 |main_#t~malloc8.base|)) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 32779#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 32780#(and (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 32781#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 32782#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 32783#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 32784#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 32785#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 32786#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (or (= main_~data~0.base |main_#t~malloc8.base|) (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= 0 |main_#t~malloc8.offset|)), 32787#(and (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset main_~lItem~0.offset)) (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~data~0.base))), 32788#(and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~data~0.base)) (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.base |main_#t~mem10.base|) (= main_~lItem~0.offset main_~data~0.offset) (= 0 |main_#t~mem10.offset|)) (= main_~lItem~0.base main_~data~0.base))), 32789#(and (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset)) (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~data~0.base))), 32790#(and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (or (= main_~lItem~0.base main_~data~0.base) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.offset main_~data~0.offset) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)))), 32791#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) main_~data~0.offset))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 32792#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) main_~data~0.offset))) (= |main_#t~mem14.offset| main_~data~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) |main_#t~mem14.offset|) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 32793#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 32794#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))), 32795#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 32796#(or (and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| main_~data~0.base)) (not (= 0 |main_#t~mem20.base|)) (= main_~data~0.offset 0) (= main_~data~0.base |main_#t~mem20.base|)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 32797#(or (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (or (not (= main_~data~0.offset main_~item2~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 32798#(or (= 0 (select |#valid| main_~data~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (or (not (= main_~data~0.offset main_~item2~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 32799#(or (= 0 (select |#valid| main_~data~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (or (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (not (= main_~data~0.offset main_~item2~0.offset)) (not (= main_~dst~0.base main_~item2~0.base))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base))), 32800#(or (and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~data~0.offset main_~item2~0.offset)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (not (= main_~dst~0.base main_~item2~0.base))) (or (not (= main_~item2~0.offset 0)) (= main_~data~0.offset main_~item2~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)) (= 0 (select |#valid| main_~data~0.base))), 32801#(or (and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~data~0.offset main_~item2~0.offset)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (not (= main_~dst~0.base main_~item2~0.base))) (or (and (not (= main_~item2~0.offset 0)) (or (<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base)) (<= main_~item2~0.offset 0))) (= main_~data~0.offset main_~item2~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)) (= 0 (select |#valid| main_~data~0.base))), 32802#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~item2~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (and (not (= main_~item2~0.offset 0)) (or (<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base)) (<= main_~item2~0.offset 0))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset))) (not (= main_~data~0.offset main_~dst~0.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (and (= main_~item2~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (not (= main_~data~0.offset main_~item2~0.offset))) (not (= main_~dst~0.base main_~item2~0.base))) (= main_~dst~0.base main_~data~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 32803#(or (= 0 (select |#valid| main_~data~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (or (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (not (= 0 |main_#t~mem26.base|))) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base))) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)))), 32804#(or (= 0 (select |#valid| main_~data~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (or (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (and (not (= 0 main_~item2~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base))) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)))), 32805#(or (and (= 8 (select |#length| main_~data~0.base)) (or (and (not (= 0 main_~item2~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (not (= |main_#t~mem27.base| main_~data~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (or (<= 9 (select |#length| |main_#t~mem27.base|)) (= main_~data~0.offset |main_#t~mem27.offset|))) (= 0 (select |#valid| main_~data~0.base))), 32806#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~item2~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (= (select |#length| main_~dst~0.base) 8) (= main_~data~0.offset main_~dst~0.offset)) (= 0 (select |#valid| main_~data~0.base))), 32807#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 32808#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 32809#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|))), 32810#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 20:23:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:05,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 20:23:05,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 20:23:05,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:23:05,918 INFO L87 Difference]: Start difference. First operand 330 states and 385 transitions. Second operand 35 states. [2018-02-02 20:23:08,114 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 127 DAG size of output 100 [2018-02-02 20:23:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:09,267 INFO L93 Difference]: Finished difference Result 459 states and 535 transitions. [2018-02-02 20:23:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:23:09,267 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 89 [2018-02-02 20:23:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:09,268 INFO L225 Difference]: With dead ends: 459 [2018-02-02 20:23:09,268 INFO L226 Difference]: Without dead ends: 459 [2018-02-02 20:23:09,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=650, Invalid=3906, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 20:23:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-02 20:23:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 406. [2018-02-02 20:23:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-02 20:23:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 501 transitions. [2018-02-02 20:23:09,271 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 501 transitions. Word has length 89 [2018-02-02 20:23:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:09,271 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 501 transitions. [2018-02-02 20:23:09,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 20:23:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 501 transitions. [2018-02-02 20:23:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:23:09,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:09,272 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:09,272 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash 960015949, now seen corresponding path program 1 times [2018-02-02 20:23:09,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:09,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:09,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:09,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:23:09,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:09,920 INFO L182 omatonBuilderFactory]: Interpolants [33746#true, 33747#false, 33748#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 33749#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 33750#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 33751#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 33752#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 33753#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 33754#(and (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 33755#(and (= main_~data~0.offset |main_#t~malloc8.offset|) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 33756#(and (not (= main_~lItem~0.base main_~data~0.base)) (= 0 main_~data~0.offset) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 33757#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.base |main_#t~mem10.base|)), 33758#(and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))), 33759#(and (or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset main_~data~0.offset) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)))) (not (= main_~lItem~0.base main_~data~0.base)))), 33760#(and (= main_~data~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))), 33761#(and (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))) (= main_~data~0.offset 0)), 33762#(and (= main_~data~0.offset 0) (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))), 33763#(and (= main_~data~0.offset 0) (or (= main_~data~0.base |main_#t~mem20.base|) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))), 33764#(and (= main_~data~0.offset 0) (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))), 33765#(and (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))) (= main_~data~0.offset 0)), 33766#(and (= main_~data~0.offset 0) (or (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)), 33767#(and (or (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))) (= main_~data~0.offset 0) (not (= main_~data~0.offset main_~dst~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (= main_~dst~0.base main_~data~0.base)), 33768#(and (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))) (= main_~data~0.offset 0) (= 1 (select |#valid| main_~item~0.base))), 33769#(and (= main_~data~0.offset 0) (or (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (and (= 1 (select |#valid| main_~item~0.base)) (= main_~data~0.offset main_~dst~0.offset) (= main_~dst~0.base main_~data~0.base)) (= 0 (select |#valid| main_~data~0.base)))), 33770#(and (= main_~data~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base)))), 33771#(= 1 (select |#valid| |main_#t~mem30.base|)), 33772#(= 1 (select |#valid| main_~data~0.base))] [2018-02-02 20:23:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:09,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:23:09,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:23:09,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:23:09,921 INFO L87 Difference]: Start difference. First operand 406 states and 501 transitions. Second operand 27 states. [2018-02-02 20:23:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:11,250 INFO L93 Difference]: Finished difference Result 420 states and 514 transitions. [2018-02-02 20:23:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:23:11,250 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 89 [2018-02-02 20:23:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:11,251 INFO L225 Difference]: With dead ends: 420 [2018-02-02 20:23:11,251 INFO L226 Difference]: Without dead ends: 420 [2018-02-02 20:23:11,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=546, Invalid=2760, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:23:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-02 20:23:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 406. [2018-02-02 20:23:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-02 20:23:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 500 transitions. [2018-02-02 20:23:11,253 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 500 transitions. Word has length 89 [2018-02-02 20:23:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:11,253 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 500 transitions. [2018-02-02 20:23:11,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:23:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 500 transitions. [2018-02-02 20:23:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 20:23:11,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:11,254 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:11,254 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash -9913882, now seen corresponding path program 1 times [2018-02-02 20:23:11,254 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:11,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:12,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:12,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 20:23:12,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:12,775 INFO L182 omatonBuilderFactory]: Interpolants [34688#(and (= main_~data~0.offset 0) (or (and (= main_~dst~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= (select |#length| main_~dst~0.base) 8) (or (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset))) (not (= main_~data~0.offset main_~item~0.offset)) (not (= main_~item~0.base main_~dst~0.base))) (= main_~dst~0.base main_~data~0.base)) (= 0 (select |#valid| main_~data~0.base)))), 34689#(and (= main_~data~0.offset 0) (or (and (or (and (or (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset))) (not (= main_~data~0.offset main_~item~0.offset))) (<= (+ main_~item~0.offset 8) (select |#length| main_~item~0.base))) (not (= main_~item~0.base main_~dst~0.base))) (= main_~dst~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= (select |#length| main_~dst~0.base) 8) (= main_~dst~0.base main_~data~0.base)) (= 0 (select |#valid| main_~data~0.base)))), 34690#(and (= main_~data~0.offset 0) (or (= 0 (select |#valid| main_~data~0.base)) (and (= main_~dst~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= (select |#length| main_~dst~0.base) 8) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (and (or (and (not (= main_~data~0.offset main_~item~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (<= (+ main_~item~0.offset 8) (select |#length| main_~item~0.base))) (not (= main_~item~0.base main_~dst~0.base))) (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~item~0.base))) (= main_~dst~0.base main_~data~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset))))), 34691#(and (= main_~data~0.offset 0) (or (and (or (not (= 0 |main_#t~mem24.base|)) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset))) (not (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base))) (= main_~dst~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= (select |#length| main_~dst~0.base) 8) (= main_~dst~0.base main_~data~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base)))), 34692#(and (= main_~data~0.offset 0) (or (and (= main_~dst~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= (select |#length| main_~dst~0.base) 8) (= main_~dst~0.base main_~data~0.base) (or (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset))) (not (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base)) (not (= 0 main_~item~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base)))), 34693#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (or (and (<= (+ (select |#length| main_~data~0.base) |main_#t~mem27.offset|) (select |#length| |main_#t~mem27.base|)) (not (= main_~data~0.offset |main_#t~mem27.offset|))) (not (= |main_#t~mem27.base| main_~data~0.base)) (not (= 0 main_~item~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base)))), 34694#(and (= main_~data~0.offset 0) (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset)) main_~data~0.base) main_~data~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base)) main_~data~0.base) main_~data~0.offset)))) (= 0 (select |#valid| main_~data~0.base)) (and (not (= main_~data~0.offset main_~dst~0.offset)) (<= main_~dst~0.offset 0)) (not (= 0 main_~item~0.base)))), 34695#(and (= main_~data~0.offset 0) (or (not (= main_~item~0.offset 0)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset)) main_~data~0.base) main_~data~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base)) main_~data~0.base) main_~data~0.offset)))) (= 0 (select |#valid| main_~data~0.base)) (and (not (= main_~data~0.offset main_~dst~0.offset)) (<= main_~dst~0.offset 0)) (not (= 0 main_~item~0.base)))), 34696#(and (= main_~data~0.offset 0) (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset)) main_~data~0.base) main_~data~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base)) main_~data~0.base) main_~data~0.offset)))) (= 0 (select |#valid| main_~data~0.base)) (and (not (= main_~data~0.offset main_~dst~0.offset)) (<= main_~dst~0.offset 0)))), 34697#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))) (= main_~data~0.offset 0)), 34698#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|))), 34699#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8)), 34665#true, 34666#false, 34667#(and (not (= 0 |main_#t~malloc8.base|)) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 34668#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 34669#(and (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 34670#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~data~0.offset) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 34671#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 34672#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 34673#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 34674#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 34675#(and (or (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base |main_#t~malloc8.base|)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|)), 34676#(and (= 0 main_~data~0.offset) (or (and (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset main_~lItem~0.offset))) (<= main_~data~0.offset main_~lItem~0.offset)), 34677#(and (or (and (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (not (= 0 |main_#t~mem10.base|)) (= main_~data~0.offset main_~lItem~0.offset) (= 0 |main_#t~mem10.offset|))) (= main_~data~0.offset 0) (<= main_~data~0.offset main_~lItem~0.offset)), 34678#(and (= main_~data~0.offset 0) (or (and (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset))) (<= main_~data~0.offset main_~lItem~0.offset)), 34679#(and (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (= main_~data~0.base main_~lItem~0.base))) (= main_~data~0.offset 0) (<= main_~data~0.offset main_~lItem~0.offset)), 34680#(and (= main_~data~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) main_~data~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))), 34681#(and (or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= |main_#t~mem14.offset| main_~data~0.offset) (or (= main_~data~0.base |main_#t~mem14.base|) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) main_~data~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) |main_#t~mem14.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.offset 0)), 34682#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))) (= main_~data~0.offset 0)), 34683#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|)))), 34684#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))), 34685#(and (= main_~data~0.offset 0) (or (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)) (and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| main_~data~0.base)) (not (= 0 |main_#t~mem20.base|)) (= main_~data~0.base |main_#t~mem20.base|)))), 34686#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~data~0.offset main_~item~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))), 34687#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~data~0.offset main_~item~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))))] [2018-02-02 20:23:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:12,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 20:23:12,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 20:23:12,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:23:12,775 INFO L87 Difference]: Start difference. First operand 406 states and 500 transitions. Second operand 35 states. [2018-02-02 20:23:14,907 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 106 DAG size of output 82 [2018-02-02 20:23:15,142 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 112 DAG size of output 89 [2018-02-02 20:23:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:16,546 INFO L93 Difference]: Finished difference Result 526 states and 641 transitions. [2018-02-02 20:23:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:23:16,546 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-02-02 20:23:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:16,547 INFO L225 Difference]: With dead ends: 526 [2018-02-02 20:23:16,547 INFO L226 Difference]: Without dead ends: 526 [2018-02-02 20:23:16,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=773, Invalid=4629, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 20:23:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-02-02 20:23:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 415. [2018-02-02 20:23:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-02 20:23:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 510 transitions. [2018-02-02 20:23:16,550 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 510 transitions. Word has length 90 [2018-02-02 20:23:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:16,550 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 510 transitions. [2018-02-02 20:23:16,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 20:23:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 510 transitions. [2018-02-02 20:23:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 20:23:16,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:16,551 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:16,551 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash -9913883, now seen corresponding path program 1 times [2018-02-02 20:23:16,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:16,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:17,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:17,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:23:17,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:17,197 INFO L182 omatonBuilderFactory]: Interpolants [35725#true, 35726#false, 35727#(= 0 |main_#t~malloc8.offset|), 35728#(= 0 main_~lItem~0.offset), 35729#(and (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 35730#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 35731#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 35732#(and (= main_~data~0.offset 0) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 35733#(and (= main_~data~0.offset 0) (not (= main_~item~0.base main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 35734#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 35735#(and (= main_~data~0.offset |main_#t~malloc8.offset|) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|)), 35736#(and (= main_~data~0.offset main_~lItem~0.offset) (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base main_~lItem~0.base))), 35737#(and (or (= main_~data~0.base |main_#t~mem10.base|) (= main_~data~0.base main_~lItem~0.base)) (= main_~data~0.offset main_~lItem~0.offset)), 35738#(and (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset)), 35739#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (<= main_~data~0.offset main_~lItem~0.offset) (or (and (= main_~lItem~0.offset main_~data~0.offset) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base))), 35740#(and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) main_~data~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 35741#(and (= |main_#t~mem14.offset| main_~data~0.offset) (or (= main_~data~0.base |main_#t~mem14.base|) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) main_~data~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) |main_#t~mem14.offset|)))), 35742#(= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 35743#(= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)), 35744#(= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)), 35745#(= main_~data~0.base |main_#t~mem20.base|), 35746#(= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)), 35747#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)), 35748#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (= 1 (select |#valid| main_~item2~0.base)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)), 35749#(and (= 1 (select |#valid| main_~item2~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 35750#(or (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base)) main_~data~0.base) main_~data~0.offset)) (and (= 1 (select |#valid| main_~item2~0.base)) (= main_~data~0.offset main_~dst~0.offset) (= main_~dst~0.base main_~data~0.base))), 35751#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 35752#(= 1 (select |#valid| |main_#t~mem30.base|)), 35753#(= 1 (select |#valid| main_~data~0.base))] [2018-02-02 20:23:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:17,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:23:17,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:23:17,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:23:17,198 INFO L87 Difference]: Start difference. First operand 415 states and 510 transitions. Second operand 29 states. [2018-02-02 20:23:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:18,315 INFO L93 Difference]: Finished difference Result 423 states and 517 transitions. [2018-02-02 20:23:18,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:23:18,315 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-02-02 20:23:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:18,316 INFO L225 Difference]: With dead ends: 423 [2018-02-02 20:23:18,316 INFO L226 Difference]: Without dead ends: 423 [2018-02-02 20:23:18,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=477, Invalid=2945, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:23:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-02 20:23:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 410. [2018-02-02 20:23:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 20:23:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2018-02-02 20:23:18,318 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 90 [2018-02-02 20:23:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:18,318 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2018-02-02 20:23:18,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:23:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2018-02-02 20:23:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:23:18,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:18,319 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:18,319 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1014209632, now seen corresponding path program 1 times [2018-02-02 20:23:18,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:18,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:19,251 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 82 DAG size of output 59 [2018-02-02 20:23:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:19,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:19,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:23:19,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:19,752 INFO L182 omatonBuilderFactory]: Interpolants [36672#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~item~0.offset 0)) (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (not (= main_~data~0.offset main_~item2~0.offset)) (not (= main_~dst~0.base main_~item2~0.base))) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (or (and (not (= main_~item2~0.offset 0)) (or (<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base)) (<= main_~item2~0.offset 0))) (= main_~data~0.offset main_~item2~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)), 36673#(and (= 8 (select |#length| main_~data~0.base)) (= main_~item2~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (and (not (= main_~item2~0.offset 0)) (or (<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base)) (<= main_~item2~0.offset 0))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset))) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (= main_~item~0.offset 0)) (= main_~dst~0.base main_~data~0.base) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset))) (and (= main_~item2~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (not (= main_~data~0.offset main_~item2~0.offset))) (not (= main_~dst~0.base main_~item2~0.base)))), 36674#(and (or (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)))) (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base main_~dst~0.base) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (not (= main_~data~0.offset main_~dst~0.offset)) (or (not (= 0 |main_#t~mem26.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (= main_~item~0.offset 0))), 36675#(and (or (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset)) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset)))) (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (not (= main_~data~0.offset main_~dst~0.offset)) (or (not (= 0 main_~item2~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (= main_~item~0.offset 0)) (= main_~dst~0.base main_~data~0.base)), 36676#(and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= 0 main_~item2~0.base)) (not (= |main_#t~mem27.base| main_~data~0.base))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~item~0.offset 0)) (or (<= 9 (select |#length| |main_#t~mem27.base|)) (= main_~data~0.offset |main_#t~mem27.offset|))), 36677#(or (and (not (= 0 main_~item2~0.base)) (or (not (= main_~item~0.offset 0)) (and (= main_~dst~0.base main_~data~0.base) (not (= 0 main_~item~0.base)))) (= (select |#length| main_~dst~0.base) 8) (= main_~data~0.offset main_~dst~0.offset)) (and (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)))), 36678#(and (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))), 36679#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 36680#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem30.base|) |main_#t~mem30.offset|))), 36681#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 36682#(= 1 (select |#valid| |main_#t~mem16.base|)), 36651#true, 36652#false, 36653#(and (not (= 0 |main_#t~malloc8.base|)) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 36654#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 36655#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 36656#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 36657#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 36658#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 36659#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))) (= (select |#valid| main_~data~0.base) 1) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 36660#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 36661#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 36662#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (not (= 0 |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|) (= main_~data~0.offset |main_#t~mem10.offset|)), 36663#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))), 36664#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset))), 36665#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 36666#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 36667#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))), 36668#(and (= 8 (select |#length| main_~data~0.base)) (not (= 0 |main_#t~mem20.base|)) (= main_~data~0.offset 0) (= main_~data~0.offset |main_#t~mem20.offset|) (= main_~data~0.base |main_#t~mem20.base|)), 36669#(and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~data~0.offset main_~item2~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 36670#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (or (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (not (= main_~data~0.offset main_~item2~0.offset)) (not (= main_~dst~0.base main_~item2~0.base))) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)), 36671#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~item~0.offset 0)) (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item2~0.offset 0)) (= main_~data~0.offset main_~item2~0.offset)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (not (= main_~data~0.offset main_~item2~0.offset)) (not (= main_~dst~0.base main_~item2~0.base))) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base))] [2018-02-02 20:23:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:19,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:23:19,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:23:19,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:23:19,752 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand 32 states. [2018-02-02 20:23:21,379 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 103 DAG size of output 80 [2018-02-02 20:23:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:23:22,307 INFO L93 Difference]: Finished difference Result 438 states and 533 transitions. [2018-02-02 20:23:22,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:23:22,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 94 [2018-02-02 20:23:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:23:22,308 INFO L225 Difference]: With dead ends: 438 [2018-02-02 20:23:22,308 INFO L226 Difference]: Without dead ends: 438 [2018-02-02 20:23:22,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=657, Invalid=4173, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 20:23:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-02 20:23:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 420. [2018-02-02 20:23:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-02-02 20:23:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 516 transitions. [2018-02-02 20:23:22,311 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 516 transitions. Word has length 94 [2018-02-02 20:23:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:23:22,311 INFO L432 AbstractCegarLoop]: Abstraction has 420 states and 516 transitions. [2018-02-02 20:23:22,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:23:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 516 transitions. [2018-02-02 20:23:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:23:22,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:23:22,312 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:23:22,312 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:23:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1014209633, now seen corresponding path program 1 times [2018-02-02 20:23:22,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:23:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:23:22,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:23:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:23,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:23:23,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:23:23,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:23:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:23,381 INFO L182 omatonBuilderFactory]: Interpolants [37632#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))), 37633#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset))), 37634#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 37635#(and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item2~0.offset 0)) (= main_~data~0.offset main_~item2~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 37636#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (or (not (= main_~item2~0.offset 0)) (= main_~data~0.offset main_~item2~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 37637#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (or (not (= main_~item2~0.offset 0)) (= main_~data~0.offset main_~item2~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))), 37638#(and (= 8 (select |#length| main_~data~0.base)) (not (= 0 |main_#t~mem20.base|)) (= main_~data~0.offset |main_#t~mem20.offset|) (or (not (= main_~item2~0.offset 0)) (= main_~data~0.offset main_~item2~0.offset)) (= main_~data~0.base |main_#t~mem20.base|)), 37639#(and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item2~0.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.offset main_~item2~0.offset))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 37640#(and (or (not (= main_~item2~0.base main_~dst~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item2~0.offset 0)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (= main_~data~0.offset main_~item2~0.offset))))) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)), 37641#(and (or (and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item2~0.offset 0)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (= main_~data~0.offset main_~item2~0.offset)))) (not (= main_~item2~0.base main_~dst~0.base))) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~dst~0.base main_~data~0.base)), 37642#(and (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item2~0.offset) main_~data~0.offset)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (or (not (= main_~item2~0.base main_~dst~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (or (not (= main_~item2~0.offset 0)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item2~0.base) main_~data~0.offset))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (= main_~data~0.offset main_~item2~0.offset))) (<= main_~item2~0.offset 0))) (= main_~dst~0.base main_~data~0.base)), 37643#(and (or (not (= main_~item2~0.base main_~dst~0.base)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~item2~0.base) main_~item2~0.offset))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~item2~0.offset 0)) (<= main_~item2~0.offset 0))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~item2~0.base) (= main_~dst~0.base main_~data~0.base)), 37644#(and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (not (= 0 |main_#t~mem26.base|))) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base))) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (= main_~dst~0.base main_~data~0.base)), 37645#(and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~data~0.offset)) (or (and (not (= 0 main_~item2~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (not (= (select (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset) main_~dst~0.base))) (not (= main_~data~0.offset main_~dst~0.offset)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~data~0.offset)) (= main_~dst~0.base main_~data~0.base)), 37646#(and (or (and (not (= 0 main_~item2~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))) (not (= |main_#t~mem27.base| main_~data~0.base))) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 37647#(or (and (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~item2~0.base)) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))))), 37648#(and (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~dst~0.base (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~dst~0.base (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))), 37649#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 37650#(and (= (select (select |#memory_$Pointer$.base| |main_#t~mem30.base|) |main_#t~mem30.offset|) |main_#t~mem30.base|) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem30.base|) |main_#t~mem30.offset|))), 37651#(and (= |main_#t~mem14.offset| main_~data~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 37620#true, 37621#false, 37622#(and (not (= 0 |main_#t~malloc8.base|)) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 37623#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 37624#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (= (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset) main_~lItem~0.base)), 37625#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 37626#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 37627#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 37628#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))) (= (select |#valid| main_~data~0.base) 1) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~data~0.base) main_~data~0.offset))), 37629#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.offset 0) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 37630#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 37631#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0) (= main_~data~0.base |main_#t~mem10.base|) (not (= 0 |main_#t~mem10.base|)) (= main_~data~0.offset |main_#t~mem10.offset|))] [2018-02-02 20:23:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:23:23,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:23:23,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:23:23,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:23:23,382 INFO L87 Difference]: Start difference. First operand 420 states and 516 transitions. Second operand 32 states. Received shutdown request... [2018-02-02 20:23:23,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:23:23,623 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:23:23,627 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:23:23,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:23:23 BoogieIcfgContainer [2018-02-02 20:23:23,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:23:23,628 INFO L168 Benchmark]: Toolchain (without parser) took 70788.04 ms. Allocated memory was 402.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 359.3 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 141.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:23:23,629 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:23:23,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.77 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 346.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:23:23,629 INFO L168 Benchmark]: Boogie Preprocessor took 31.15 ms. Allocated memory is still 402.7 MB. Free memory is still 346.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:23:23,629 INFO L168 Benchmark]: RCFGBuilder took 446.77 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 302.5 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:23:23,630 INFO L168 Benchmark]: TraceAbstraction took 70130.21 ms. Allocated memory was 402.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 84.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:23:23,630 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.77 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 346.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.15 ms. Allocated memory is still 402.7 MB. Free memory is still 346.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 446.77 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 302.5 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70130.21 ms. Allocated memory was 402.7 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 84.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 7 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 155 locations, 67 error locations. TIMEOUT Result, 70.0s OverallTime, 59 OverallIterations, 3 TraceHistogramMax, 45.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6874 SDtfs, 21610 SDslu, 39345 SDs, 0 SdLazy, 41477 SolverSat, 3042 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1944 GetRequests, 200 SyntacticMatches, 126 SemanticMatches, 1617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16420 ImplicationChecksByTransitivity, 41.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=440occurred in iteration=45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 729/1070 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, 58 MinimizatonAttempts, 3062 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 3555 NumberOfCodeBlocks, 3555 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 3496 ConstructedInterpolants, 0 QuantifiedInterpolants, 4460525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 26 PerfectInterpolantSequences, 729/1070 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-23-23-636.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-23-23-636.csv Completed graceful shutdown