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/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:14:16,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:14:16,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:14:16,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:14:16,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:14:16,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:14:16,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:14:16,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:14:16,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:14:16,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:14:16,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:14:16,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:14:16,791 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:14:16,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:14:16,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:14:16,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:14:16,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:14:16,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:14:16,799 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:14:16,800 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:14:16,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:14:16,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:14:16,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:14:16,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:14:16,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:14:16,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:14:16,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:14:16,805 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:14:16,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:14:16,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:14:16,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:14:16,806 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:14:16,817 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:14:16,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:14:16,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:14:16,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:14:16,818 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:14:16,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:14:16,818 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:14:16,819 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:14:16,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:14:16,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:14:16,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:14:16,819 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:14:16,819 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:14:16,819 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:14:16,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:14:16,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:14:16,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:14:16,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:14:16,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:14:16,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:14:16,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:14:16,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:14:16,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:14:16,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:14:16,861 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:14:16,865 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:14:16,866 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:14:16,867 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:14:16,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2018-02-02 20:14:17,012 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:14:17,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:14:17,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:14:17,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:14:17,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:14:17,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274f1477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17, skipping insertion in model container [2018-02-02 20:14:17,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,030 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:14:17,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:14:17,147 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:14:17,162 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:14:17,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17 WrapperNode [2018-02-02 20:14:17,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:14:17,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:14:17,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:14:17,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:14:17,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (1/1) ... [2018-02-02 20:14:17,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:14:17,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:14:17,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:14:17,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:14:17,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (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:14:17,227 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:14:17,227 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:14:17,227 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 20:14:17,227 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 20:14:17,227 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 20:14:17,227 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:14:17,227 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:14:17,228 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:14:17,229 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 20:14:17,229 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 20:14:17,229 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 20:14:17,229 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:14:17,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:14:17,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:14:17,543 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:14:17,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:14:17 BoogieIcfgContainer [2018-02-02 20:14:17,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:14:17,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:14:17,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:14:17,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:14:17,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:14:17" (1/3) ... [2018-02-02 20:14:17,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b949c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:14:17, skipping insertion in model container [2018-02-02 20:14:17,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:14:17" (2/3) ... [2018-02-02 20:14:17,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b949c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:14:17, skipping insertion in model container [2018-02-02 20:14:17,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:14:17" (3/3) ... [2018-02-02 20:14:17,549 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i [2018-02-02 20:14:17,554 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:14:17,559 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-02 20:14:17,581 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:14:17,581 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:14:17,581 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:14:17,581 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:14:17,581 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:14:17,581 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:14:17,581 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:14:17,582 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:14:17,582 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:14:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-02-02 20:14:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 20:14:17,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:17,597 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:17,598 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:17,600 INFO L82 PathProgramCache]: Analyzing trace with hash -548983798, now seen corresponding path program 1 times [2018-02-02 20:14:17,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:17,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:17,712 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:14:17,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:17,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:14:17,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:17,717 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:14:17,717 INFO L182 omatonBuilderFactory]: Interpolants [124#true, 125#false, 126#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 20:14:17,717 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:14:17,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:14:17,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:14:17,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:14:17,732 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2018-02-02 20:14:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:17,908 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-02 20:14:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:14:17,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 20:14:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:17,916 INFO L225 Difference]: With dead ends: 123 [2018-02-02 20:14:17,916 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:14:17,917 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:14:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:14:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-02 20:14:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 20:14:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 20:14:17,945 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2018-02-02 20:14:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:17,945 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 20:14:17,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:14:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 20:14:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 20:14:17,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:17,946 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:17,946 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:17,946 INFO L82 PathProgramCache]: Analyzing trace with hash -548983797, now seen corresponding path program 1 times [2018-02-02 20:14:17,946 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:17,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:17,981 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:14:17,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:17,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:14:17,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:17,982 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:14:17,982 INFO L182 omatonBuilderFactory]: Interpolants [368#false, 369#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0)), 367#true] [2018-02-02 20:14:17,982 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:14:17,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:14:17,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:14:17,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:14:17,984 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 3 states. [2018-02-02 20:14:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:18,085 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-02-02 20:14:18,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:14:18,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 20:14:18,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:18,087 INFO L225 Difference]: With dead ends: 118 [2018-02-02 20:14:18,087 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 20:14:18,088 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:14:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 20:14:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-02-02 20:14:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 20:14:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-02 20:14:18,096 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2018-02-02 20:14:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:18,096 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-02 20:14:18,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:14:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-02 20:14:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:14:18,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:18,097 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:18,097 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977305, now seen corresponding path program 1 times [2018-02-02 20:14:18,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:18,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:18,160 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:14:18,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:18,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:18,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:18,161 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:14:18,161 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| append_~pointerToList.base)), 604#true, 605#false, 606#(= 1 (select |#valid| |main_~#list~0.base|)), 607#(= 1 (select |#valid| |append_#in~pointerToList.base|))] [2018-02-02 20:14:18,161 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:14:18,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:18,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:18,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:18,162 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-02-02 20:14:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:18,346 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 20:14:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:14:18,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:14:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:18,347 INFO L225 Difference]: With dead ends: 129 [2018-02-02 20:14:18,347 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:14:18,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:14:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-02-02 20:14:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:14:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-02 20:14:18,353 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 14 [2018-02-02 20:14:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:18,354 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-02 20:14:18,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-02 20:14:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:14:18,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:18,354 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:18,354 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977306, now seen corresponding path program 1 times [2018-02-02 20:14:18,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:18,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:18,448 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:14:18,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:18,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:14:18,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:18,449 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:14:18,449 INFO L182 omatonBuilderFactory]: Interpolants [864#(and (= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|)), 865#(and (= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 866#(and (= 0 |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1) (= 4 (select |#length| |append_#in~pointerToList.base|))), 867#(and (= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 868#(and (= append_~pointerToList.offset 0) (= (select |#length| append_~pointerToList.base) 4)), 862#true, 863#false] [2018-02-02 20:14:18,450 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:14:18,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:14:18,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:14:18,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:18,451 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-02 20:14:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:18,649 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-02 20:14:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:14:18,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 20:14:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:18,652 INFO L225 Difference]: With dead ends: 127 [2018-02-02 20:14:18,652 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 20:14:18,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:14:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 20:14:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-02 20:14:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:14:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-02 20:14:18,658 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2018-02-02 20:14:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:18,658 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-02 20:14:18,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:14:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-02 20:14:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:14:18,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:18,659 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:18,659 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:18,659 INFO L82 PathProgramCache]: Analyzing trace with hash 150721727, now seen corresponding path program 1 times [2018-02-02 20:14:18,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:18,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:18,692 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:14:18,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:18,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:14:18,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:18,693 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:14:18,693 INFO L182 omatonBuilderFactory]: Interpolants [1120#true, 1121#false, 1122#(= 1 (select |#valid| |append_#t~malloc14.base|)), 1123#(= 1 (select |#valid| append_~node~0.base))] [2018-02-02 20:14:18,694 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:14:18,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:14:18,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:14:18,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:14:18,694 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2018-02-02 20:14:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:18,766 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 20:14:18,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:14:18,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:14:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:18,767 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:14:18,767 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 20:14:18,767 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:14:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 20:14:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-02 20:14:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 20:14:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-02 20:14:18,773 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 15 [2018-02-02 20:14:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:18,773 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-02 20:14:18,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:14:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-02 20:14:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:14:18,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:18,774 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:18,774 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 150721728, now seen corresponding path program 1 times [2018-02-02 20:14:18,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:18,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:18,820 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:14:18,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:18,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:14:18,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:18,821 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:14:18,821 INFO L182 omatonBuilderFactory]: Interpolants [1368#true, 1369#false, 1370#(and (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 1371#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0))] [2018-02-02 20:14:18,821 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:14:18,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:14:18,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:14:18,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:14:18,821 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2018-02-02 20:14:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:18,886 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-02 20:14:18,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:14:18,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:14:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:18,887 INFO L225 Difference]: With dead ends: 120 [2018-02-02 20:14:18,887 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:14:18,887 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:14:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:14:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 20:14:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 20:14:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 20:14:18,890 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 15 [2018-02-02 20:14:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:18,890 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 20:14:18,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:14:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 20:14:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:14:18,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:18,891 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:14:18,891 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099981, now seen corresponding path program 1 times [2018-02-02 20:14:18,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:18,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:18,925 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:14:18,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:18,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:18,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:18,925 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:14:18,926 INFO L182 omatonBuilderFactory]: Interpolants [1616#(= 1 (select |#valid| |append_#t~malloc14.base|)), 1617#(= 1 (select |#valid| append_~node~0.base)), 1618#(= |#valid| |old(#valid)|), 1614#true, 1615#false] [2018-02-02 20:14:18,926 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:14:18,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:18,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:18,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:18,926 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2018-02-02 20:14:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:19,029 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-02-02 20:14:19,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:14:19,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 20:14:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:19,030 INFO L225 Difference]: With dead ends: 135 [2018-02-02 20:14:19,030 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 20:14:19,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 20:14:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-02-02 20:14:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:14:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-02 20:14:19,037 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2018-02-02 20:14:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:19,038 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-02 20:14:19,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-02 20:14:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:14:19,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:19,038 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:14:19,038 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099982, now seen corresponding path program 1 times [2018-02-02 20:14:19,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:19,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:14:19,085 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:14:19,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:19,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:19,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:19,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:14:19,086 INFO L182 omatonBuilderFactory]: Interpolants [1879#true, 1880#false, 1881#(and (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 1882#(and (= append_~node~0.offset 0) (= 8 (select |#length| append_~node~0.base))), 1883#(= |old(#length)| |#length|)] [2018-02-02 20:14:19,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:14:19,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:19,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:19,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:19,087 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 5 states. [2018-02-02 20:14:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:19,186 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-02 20:14:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:14:19,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 20:14:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:19,187 INFO L225 Difference]: With dead ends: 129 [2018-02-02 20:14:19,187 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:14:19,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:14:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-02-02 20:14:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:14:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 20:14:19,192 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 22 [2018-02-02 20:14:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:19,192 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 20:14:19,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 20:14:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:14:19,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:19,193 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, 1] [2018-02-02 20:14:19,193 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash 4873111, now seen corresponding path program 1 times [2018-02-02 20:14:19,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:19,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:14:19,227 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:14:19,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:19,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:14:19,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:19,227 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:14:19,228 INFO L182 omatonBuilderFactory]: Interpolants [2138#true, 2139#false, 2140#(= 1 (select |#valid| |create_data_#t~malloc1.base|)), 2141#(= 1 (select |#valid| create_data_~data~0.base))] [2018-02-02 20:14:19,228 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:14:19,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:14:19,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:14:19,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:14:19,228 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 4 states. [2018-02-02 20:14:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:19,292 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 20:14:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:14:19,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:14:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:19,293 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:14:19,293 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:14:19,293 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:14:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:14:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 20:14:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:14:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 20:14:19,295 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 23 [2018-02-02 20:14:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:19,295 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 20:14:19,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:14:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 20:14:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:14:19,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:19,296 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, 1] [2018-02-02 20:14:19,296 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash 4873112, now seen corresponding path program 1 times [2018-02-02 20:14:19,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:19,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:19,339 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:14:19,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:19,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:14:19,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:19,340 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:14:19,340 INFO L182 omatonBuilderFactory]: Interpolants [2384#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 2385#(and (= create_data_~data~0.offset 0) (= (select |#length| create_data_~data~0.base) 8)), 2382#true, 2383#false] [2018-02-02 20:14:19,340 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:14:19,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:14:19,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:14:19,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:14:19,341 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-02 20:14:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:19,407 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-02-02 20:14:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:14:19,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:14:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:19,408 INFO L225 Difference]: With dead ends: 123 [2018-02-02 20:14:19,408 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 20:14:19,409 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:14:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 20:14:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-02-02 20:14:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 20:14:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 20:14:19,412 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 23 [2018-02-02 20:14:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:19,412 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 20:14:19,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:14:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 20:14:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:14:19,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:19,413 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, 1, 1] [2018-02-02 20:14:19,413 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash 167210254, now seen corresponding path program 1 times [2018-02-02 20:14:19,414 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:19,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:19,449 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:14:19,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:19,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:14:19,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:19,450 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:14:19,450 INFO L182 omatonBuilderFactory]: Interpolants [2631#true, 2632#false, 2633#(= 1 (select |#valid| append_~pointerToList.base)), 2634#(= |#valid| |old(#valid)|)] [2018-02-02 20:14:19,450 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:14:19,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:14:19,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:14:19,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:14:19,451 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 4 states. [2018-02-02 20:14:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:19,529 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-02-02 20:14:19,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:14:19,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-02-02 20:14:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:19,531 INFO L225 Difference]: With dead ends: 128 [2018-02-02 20:14:19,531 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 20:14:19,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:14:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 20:14:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-02-02 20:14:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:14:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-02 20:14:19,534 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 24 [2018-02-02 20:14:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:19,534 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-02 20:14:19,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:14:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-02 20:14:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:14:19,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:19,535 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, 1, 1] [2018-02-02 20:14:19,535 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash 167210255, now seen corresponding path program 1 times [2018-02-02 20:14:19,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:19,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:19,601 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:14:19,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:19,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:14:19,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:19,602 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:14:19,602 INFO L182 omatonBuilderFactory]: Interpolants [2885#true, 2886#false, 2887#(= 0 |main_~#list~0.offset|), 2888#(= 0 |append_#in~pointerToList.offset|), 2889#(= append_~pointerToList.offset 0), 2890#(and (< 0 (+ append_~pointerToList.offset 1)) (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base))), 2891#(= |old(#length)| |#length|)] [2018-02-02 20:14:19,602 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:14:19,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:14:19,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:14:19,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:19,603 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-02 20:14:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:19,787 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-02-02 20:14:19,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:14:19,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 20:14:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:19,788 INFO L225 Difference]: With dead ends: 122 [2018-02-02 20:14:19,788 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 20:14:19,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:14:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 20:14:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-02 20:14:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:14:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-02 20:14:19,790 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2018-02-02 20:14:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:19,790 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-02 20:14:19,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:14:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-02 20:14:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:14:19,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:19,791 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, 1, 1] [2018-02-02 20:14:19,794 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 151037655, now seen corresponding path program 1 times [2018-02-02 20:14:19,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:19,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:19,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:14:19,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:19,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:19,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:19,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:14:19,828 INFO L182 omatonBuilderFactory]: Interpolants [3144#true, 3145#false, 3146#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|) (= (select |#valid| |create_data_#t~malloc1.base|) 1)), 3147#(and (= create_data_~data~0.offset 0) (= 8 (select |#length| create_data_~data~0.base)) (= (select |#valid| create_data_~data~0.base) 1)), 3148#(and (= create_data_~data~0.offset 0) (= (select |#length| create_data_~data~0.base) 8))] [2018-02-02 20:14:19,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:14:19,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:19,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:19,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:19,828 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 5 states. [2018-02-02 20:14:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:19,946 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 20:14:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:14:19,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 20:14:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:19,947 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:14:19,947 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:14:19,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:14:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-02 20:14:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 20:14:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-02 20:14:19,951 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-02-02 20:14:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:19,951 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-02 20:14:19,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-02 20:14:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:14:19,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:19,952 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:19,952 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005000, now seen corresponding path program 1 times [2018-02-02 20:14:19,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:19,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:14:20,023 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:14:20,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:20,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:14:20,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:20,023 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:14:20,024 INFO L182 omatonBuilderFactory]: Interpolants [3392#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 3393#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 3387#true, 3388#false, 3389#(= 1 (select |#valid| append_~node~0.base)), 3390#(= |#valid| |old(#valid)|), 3391#(= |#valid| (store |old(#valid)| |create_data_#t~malloc1.base| (select |#valid| |create_data_#t~malloc1.base|)))] [2018-02-02 20:14:20,024 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:14:20,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:14:20,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:14:20,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:20,025 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 7 states. [2018-02-02 20:14:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:20,277 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-02 20:14:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:14:20,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 20:14:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:20,278 INFO L225 Difference]: With dead ends: 131 [2018-02-02 20:14:20,279 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 20:14:20,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:14:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 20:14:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 20:14:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:14:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-02 20:14:20,282 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 29 [2018-02-02 20:14:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:20,283 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-02 20:14:20,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:14:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-02 20:14:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:14:20,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:20,284 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:20,284 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005001, now seen corresponding path program 1 times [2018-02-02 20:14:20,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:20,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:20,357 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:14:20,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:20,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:14:20,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:20,358 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:14:20,358 INFO L182 omatonBuilderFactory]: Interpolants [3654#true, 3655#false, 3656#(and (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 3657#(and (= append_~node~0.offset 0) (= 8 (select |#length| append_~node~0.base))), 3658#(= |old(#length)| |#length|), 3659#(and (= (select |#length| |create_data_#t~malloc1.base|) 8) (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|)))), 3660#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)))] [2018-02-02 20:14:20,359 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:14:20,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:14:20,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:14:20,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:20,359 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2018-02-02 20:14:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:20,591 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-02 20:14:20,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:14:20,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 20:14:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:20,592 INFO L225 Difference]: With dead ends: 131 [2018-02-02 20:14:20,592 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 20:14:20,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:14:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 20:14:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 20:14:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:14:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 20:14:20,595 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 29 [2018-02-02 20:14:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:20,596 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 20:14:20,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:14:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 20:14:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:14:20,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:20,596 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:20,597 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344885, now seen corresponding path program 1 times [2018-02-02 20:14:20,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:20,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:20,624 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:14:20,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:20,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:20,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:20,625 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:14:20,625 INFO L182 omatonBuilderFactory]: Interpolants [3921#true, 3922#false, 3923#(= append_~pointerToList.base |append_#in~pointerToList.base|), 3924#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 3925#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 20:14:20,625 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:14:20,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:20,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:20,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:20,626 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-02-02 20:14:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:20,726 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 20:14:20,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:14:20,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 20:14:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:20,727 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:14:20,728 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 20:14:20,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 20:14:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 20:14:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:14:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-02 20:14:20,731 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-02-02 20:14:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:20,731 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-02 20:14:20,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-02 20:14:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:14:20,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:20,732 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:20,732 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344886, now seen corresponding path program 1 times [2018-02-02 20:14:20,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:20,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:20,830 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:14:20,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:20,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:14:20,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:20,831 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:14:20,831 INFO L182 omatonBuilderFactory]: Interpolants [4168#true, 4169#false, 4170#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 4171#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 4172#(or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0))), 4173#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|)))] [2018-02-02 20:14:20,831 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:14:20,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:14:20,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:14:20,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:20,831 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-02 20:14:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:20,956 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 20:14:20,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:14:20,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 20:14:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:20,958 INFO L225 Difference]: With dead ends: 126 [2018-02-02 20:14:20,958 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 20:14:20,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 20:14:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-02-02 20:14:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:14:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 20:14:20,961 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2018-02-02 20:14:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:20,962 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 20:14:20,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:14:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 20:14:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:14:20,962 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:20,962 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:20,966 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765284, now seen corresponding path program 1 times [2018-02-02 20:14:20,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:20,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:21,004 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:14:21,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:21,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:21,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:21,005 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:14:21,005 INFO L182 omatonBuilderFactory]: Interpolants [4421#true, 4422#false, 4423#(= 1 (select |#valid| |create_data_#t~malloc3.base|)), 4424#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 4425#(= 1 (select |#valid| |create_data_#t~mem6.base|))] [2018-02-02 20:14:21,005 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:14:21,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:21,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:21,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:21,006 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2018-02-02 20:14:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:21,121 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-02 20:14:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:14:21,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 20:14:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:21,125 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:14:21,125 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:14:21,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:14:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:14:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-02-02 20:14:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 20:14:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 20:14:21,128 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 30 [2018-02-02 20:14:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:21,128 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 20:14:21,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 20:14:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:14:21,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:21,129 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:21,129 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765283, now seen corresponding path program 1 times [2018-02-02 20:14:21,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:21,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:21,209 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:14:21,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:21,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:14:21,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:21,210 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:14:21,210 INFO L182 omatonBuilderFactory]: Interpolants [4688#(and (= 0 |create_data_#t~malloc3.offset|) (= 80 (select |#length| |create_data_#t~malloc3.base|))), 4689#(and (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 4690#(and (= create_data_~counter~0 0) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 4691#(and (= |create_data_#t~mem6.offset| 0) (= create_data_~counter~0 0) (= (select |#length| |create_data_#t~mem6.base|) 80)), 4686#true, 4687#false] [2018-02-02 20:14:21,210 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:14:21,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:14:21,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:14:21,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:21,211 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2018-02-02 20:14:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:21,316 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 20:14:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:14:21,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 20:14:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:21,317 INFO L225 Difference]: With dead ends: 125 [2018-02-02 20:14:21,317 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 20:14:21,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:14:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 20:14:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-02 20:14:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 20:14:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 20:14:21,320 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-02-02 20:14:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:21,320 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 20:14:21,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:14:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 20:14:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:14:21,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:21,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:21,321 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash 660985097, now seen corresponding path program 1 times [2018-02-02 20:14:21,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:21,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:21,412 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:14:21,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:21,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:14:21,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:21,413 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:14:21,413 INFO L182 omatonBuilderFactory]: Interpolants [4949#true, 4950#false, 4951#(= 1 (select |#valid| append_~pointerToList.base)), 4952#(= |#valid| |old(#valid)|), 4953#(= |#valid| (store |old(#valid)| |create_data_#t~malloc1.base| (select |#valid| |create_data_#t~malloc1.base|))), 4954#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4955#(and (or (and (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= 1 (select |#valid| create_data_~data~0.base))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4956#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 20:14:21,414 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:14:21,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:14:21,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:14:21,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:14:21,414 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2018-02-02 20:14:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:21,634 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-02 20:14:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:14:21,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 20:14:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:21,635 INFO L225 Difference]: With dead ends: 134 [2018-02-02 20:14:21,635 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 20:14:21,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:14:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 20:14:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-02-02 20:14:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:14:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-02 20:14:21,638 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 31 [2018-02-02 20:14:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:21,639 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-02 20:14:21,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:14:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-02 20:14:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:14:21,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:21,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:21,640 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash 660985098, now seen corresponding path program 1 times [2018-02-02 20:14:21,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:21,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:21,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:14:21,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:21,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:14:21,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:21,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:14:21,751 INFO L182 omatonBuilderFactory]: Interpolants [5232#(and (< 0 (+ append_~pointerToList.offset 1)) (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base))), 5223#true, 5224#false, 5225#(= 0 |main_~#list~0.offset|), 5226#(= 0 |append_#in~pointerToList.offset|), 5227#(= append_~pointerToList.offset 0), 5228#(and (< 0 (+ append_~pointerToList.offset 1)) (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= (select |#valid| append_~pointerToList.base) 1)), 5229#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5230#(and (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 5231#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))))] [2018-02-02 20:14:21,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:14:21,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:14:21,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:14:21,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:14:21,752 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 10 states. [2018-02-02 20:14:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:22,084 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-02 20:14:22,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:14:22,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 20:14:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:22,085 INFO L225 Difference]: With dead ends: 133 [2018-02-02 20:14:22,085 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 20:14:22,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:14:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 20:14:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-02-02 20:14:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 20:14:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-02 20:14:22,089 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 31 [2018-02-02 20:14:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:22,089 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-02 20:14:22,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:14:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-02 20:14:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:14:22,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:22,090 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] [2018-02-02 20:14:22,090 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -184722078, now seen corresponding path program 1 times [2018-02-02 20:14:22,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:22,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:22,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:22,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:14:22,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:22,195 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:14:22,195 INFO L182 omatonBuilderFactory]: Interpolants [5504#false, 5505#(= 0 |main_~#list~0.offset|), 5506#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 5507#(and (= (select |#valid| |append_#in~pointerToList.base|) 1) (or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0)))), 5508#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 5509#(and (<= 4 (select |#length| |append_#in~pointerToList.base|)) (= 0 |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1)), 5510#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 5511#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 5503#true] [2018-02-02 20:14:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:22,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:14:22,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:14:22,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:14:22,195 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 9 states. [2018-02-02 20:14:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:22,309 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 20:14:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:14:22,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 20:14:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:22,310 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:14:22,310 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:14:22,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:14:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:14:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-02-02 20:14:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 20:14:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-02 20:14:22,312 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 34 [2018-02-02 20:14:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:22,312 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-02 20:14:22,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:14:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-02 20:14:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:14:22,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:22,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:22,313 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash 501156800, now seen corresponding path program 1 times [2018-02-02 20:14:22,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:22,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:22,347 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:14:22,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:22,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:14:22,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:22,348 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:14:22,348 INFO L182 omatonBuilderFactory]: Interpolants [5744#true, 5745#false, 5746#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 5747#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 5748#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 5749#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 5750#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 20:14:22,348 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:14:22,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:14:22,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:14:22,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:22,348 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 7 states. [2018-02-02 20:14:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:22,479 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-02 20:14:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:14:22,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-02 20:14:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:22,480 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:14:22,480 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:14:22,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:14:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:14:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-02-02 20:14:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 20:14:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-02 20:14:22,483 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 33 [2018-02-02 20:14:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:22,483 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-02 20:14:22,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:14:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-02 20:14:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:14:22,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:22,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:22,484 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash 501156801, now seen corresponding path program 1 times [2018-02-02 20:14:22,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:22,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:22,596 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:14:22,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:22,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:14:22,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:22,597 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:14:22,597 INFO L182 omatonBuilderFactory]: Interpolants [6001#true, 6002#false, 6003#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 6004#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 6005#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 6006#(= |old(#length)| |#length|), 6007#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 6008#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 6009#(and (= (select |#length| |main_#t~mem21.base|) 8) (= |main_#t~mem21.offset| 0))] [2018-02-02 20:14:22,597 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:14:22,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:14:22,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:14:22,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:14:22,597 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 9 states. [2018-02-02 20:14:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:22,823 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-02-02 20:14:22,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:14:22,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 20:14:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:22,824 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:14:22,824 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 20:14:22,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:14:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 20:14:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2018-02-02 20:14:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 20:14:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-02-02 20:14:22,826 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 33 [2018-02-02 20:14:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:22,827 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-02-02 20:14:22,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:14:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-02-02 20:14:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:14:22,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:22,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:22,827 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash 574362333, now seen corresponding path program 1 times [2018-02-02 20:14:22,828 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:22,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:22,882 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:14:22,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:22,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:14:22,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:22,882 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:14:22,882 INFO L182 omatonBuilderFactory]: Interpolants [6305#true, 6306#false, 6307#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 6308#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 6309#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 6310#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 6311#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 6312#(not (= 0 |main_#t~mem27.base|))] [2018-02-02 20:14:22,882 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:14:22,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:14:22,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:14:22,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:14:22,883 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 8 states. [2018-02-02 20:14:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:22,985 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-02-02 20:14:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:14:22,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-02 20:14:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:22,986 INFO L225 Difference]: With dead ends: 151 [2018-02-02 20:14:22,986 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 20:14:22,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:14:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 20:14:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2018-02-02 20:14:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 20:14:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-02-02 20:14:22,989 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 35 [2018-02-02 20:14:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:22,989 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-02-02 20:14:22,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:14:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-02-02 20:14:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:14:22,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:22,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:22,990 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash 655964540, now seen corresponding path program 1 times [2018-02-02 20:14:22,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:22,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:23,024 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:14:23,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:23,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:23,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:23,024 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:14:23,024 INFO L182 omatonBuilderFactory]: Interpolants [6602#true, 6603#false, 6604#(= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 6605#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 6606#(= 1 (select |#valid| |main_#t~mem23.base|))] [2018-02-02 20:14:23,025 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:14:23,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:23,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:23,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:23,025 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states. [2018-02-02 20:14:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:23,118 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-02 20:14:23,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:14:23,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-02 20:14:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:23,119 INFO L225 Difference]: With dead ends: 127 [2018-02-02 20:14:23,119 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 20:14:23,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 20:14:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 20:14:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 20:14:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-02-02 20:14:23,122 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 36 [2018-02-02 20:14:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:23,122 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-02-02 20:14:23,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-02-02 20:14:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:14:23,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:23,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:23,123 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash 655964541, now seen corresponding path program 1 times [2018-02-02 20:14:23,124 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:23,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:23,251 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:14:23,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:23,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:14:23,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:23,252 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:14:23,253 INFO L182 omatonBuilderFactory]: Interpolants [6865#true, 6866#false, 6867#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 6868#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 6869#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 6870#(= |old(#length)| |#length|), 6871#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 6872#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 6873#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 6874#(and (<= 0 |main_#t~mem23.offset|) (<= |main_#t~mem23.offset| 0) (= (select |#length| |main_#t~mem23.base|) 8))] [2018-02-02 20:14:23,253 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:14:23,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:14:23,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:14:23,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:14:23,253 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 10 states. [2018-02-02 20:14:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:23,506 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-02-02 20:14:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:14:23,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 20:14:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:23,507 INFO L225 Difference]: With dead ends: 147 [2018-02-02 20:14:23,507 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 20:14:23,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:14:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 20:14:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2018-02-02 20:14:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 20:14:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-02-02 20:14:23,510 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 36 [2018-02-02 20:14:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:23,510 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-02-02 20:14:23,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:14:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-02-02 20:14:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:14:23,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:23,510 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] [2018-02-02 20:14:23,510 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash -747720392, now seen corresponding path program 1 times [2018-02-02 20:14:23,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:23,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:14:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:23,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:23,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:14:23,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:23,573 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:14:23,573 INFO L182 omatonBuilderFactory]: Interpolants [7168#(= (select |#valid| |create_data_#t~malloc1.base|) 1), 7169#(= (select |#valid| create_data_~data~0.base) 1), 7170#(and (= 1 (select |#valid| |create_data_#t~malloc3.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc3.base|))), 7171#(and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7172#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (not (= create_data_~data~0.base |create_data_#t~mem6.base|))), 7173#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 7174#(= 1 (select |#valid| |create_data_#t~mem6.base|)), 7166#true, 7167#false] [2018-02-02 20:14:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:23,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:14:23,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:14:23,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:14:23,573 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 9 states. [2018-02-02 20:14:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:23,754 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 20:14:23,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:14:23,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-02-02 20:14:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:23,754 INFO L225 Difference]: With dead ends: 129 [2018-02-02 20:14:23,754 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:14:23,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:14:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:14:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-02 20:14:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:14:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-02-02 20:14:23,756 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 37 [2018-02-02 20:14:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:23,756 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-02-02 20:14:23,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:14:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-02-02 20:14:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:14:23,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:23,757 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] [2018-02-02 20:14:23,757 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -747720391, now seen corresponding path program 1 times [2018-02-02 20:14:23,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:23,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:23,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:23,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:14:23,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:23,894 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:14:23,894 INFO L182 omatonBuilderFactory]: Interpolants [7441#true, 7442#false, 7443#(= (select |#valid| |create_data_#t~malloc1.base|) 1), 7444#(= (select |#valid| create_data_~data~0.base) 1), 7445#(and (= 0 |create_data_#t~malloc3.offset|) (= 80 (select |#length| |create_data_#t~malloc3.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc3.base|))), 7446#(and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7447#(and (= |create_data_#t~mem6.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (not (= create_data_~data~0.base |create_data_#t~mem6.base|)) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7448#(and (<= 0 create_data_~counter~0) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7449#(and (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 1 create_data_~counter~0) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7450#(and (<= create_data_~counter~0 19) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 1 create_data_~counter~0) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7451#(and (<= create_data_~counter~0 19) (= |create_data_#t~mem6.offset| 0) (= (select |#length| |create_data_#t~mem6.base|) 80) (<= 1 create_data_~counter~0))] [2018-02-02 20:14:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:23,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:14:23,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:14:23,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:14:23,894 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 11 states. [2018-02-02 20:14:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:24,111 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-02-02 20:14:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:14:24,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-02 20:14:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:24,112 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:14:24,112 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:14:24,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:14:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:14:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-02-02 20:14:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:14:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-02-02 20:14:24,114 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 37 [2018-02-02 20:14:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:24,114 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-02-02 20:14:24,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:14:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-02-02 20:14:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:14:24,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:24,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:24,115 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash 484884458, now seen corresponding path program 1 times [2018-02-02 20:14:24,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:24,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:24,303 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:14:24,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:24,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:14:24,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:24,303 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:14:24,304 INFO L182 omatonBuilderFactory]: Interpolants [7723#true, 7724#false, 7725#(= (select |#valid| |main_~#list~0.base|) 1), 7726#(= |#valid| |old(#valid)|), 7727#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 7728#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 7729#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 7730#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 7731#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret17.offset|) (= 0 |append_#t~ret17.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 7732#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~pointerToList.base append_~node~0.base)) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 7733#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 7734#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7735#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 7736#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 7737#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 7738#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 7739#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0))] [2018-02-02 20:14:24,304 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:14:24,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:14:24,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:14:24,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:14:24,304 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 17 states. [2018-02-02 20:14:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:24,891 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2018-02-02 20:14:24,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:14:24,892 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-02 20:14:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:24,892 INFO L225 Difference]: With dead ends: 164 [2018-02-02 20:14:24,892 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 20:14:24,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:14:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 20:14:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-02 20:14:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:14:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-02-02 20:14:24,895 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 40 [2018-02-02 20:14:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:24,895 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-02-02 20:14:24,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:14:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-02-02 20:14:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:14:24,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:24,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:24,896 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1287024166, now seen corresponding path program 1 times [2018-02-02 20:14:24,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:24,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:25,019 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:14:25,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:25,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:14:25,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:25,020 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:14:25,020 INFO L182 omatonBuilderFactory]: Interpolants [8084#true, 8085#false, 8086#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 8087#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 8088#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 8089#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1) (= 8 (select |#length| append_~node~0.base))), 8090#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 8091#(and (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 8092#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 8093#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 8094#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 8095#(and (= 8 (select |#length| |main_#t~mem21.base|)) (= |main_#t~mem21.offset| 0))] [2018-02-02 20:14:25,020 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:14:25,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:14:25,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:14:25,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:14:25,021 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 12 states. [2018-02-02 20:14:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:25,443 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2018-02-02 20:14:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:14:25,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 20:14:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:25,445 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:14:25,445 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:14:25,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:14:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:14:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 155. [2018-02-02 20:14:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:14:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2018-02-02 20:14:25,449 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 40 [2018-02-02 20:14:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:25,449 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2018-02-02 20:14:25,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:14:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2018-02-02 20:14:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:14:25,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:25,450 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:14:25,450 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash 268633466, now seen corresponding path program 1 times [2018-02-02 20:14:25,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:25,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:14:25,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:25,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:14:25,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:14:25,483 INFO L182 omatonBuilderFactory]: Interpolants [8454#true, 8455#false, 8456#(= create_data_~counter~0 0), 8457#(<= create_data_~counter~0 1)] [2018-02-02 20:14:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:14:25,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:14:25,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:14:25,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:14:25,484 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 4 states. [2018-02-02 20:14:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:25,496 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-02-02 20:14:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:14:25,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-02 20:14:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:25,499 INFO L225 Difference]: With dead ends: 167 [2018-02-02 20:14:25,499 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 20:14:25,499 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:14:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 20:14:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-02-02 20:14:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 20:14:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2018-02-02 20:14:25,504 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 60 [2018-02-02 20:14:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:25,505 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2018-02-02 20:14:25,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:14:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2018-02-02 20:14:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:14:25,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:25,505 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, 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:14:25,505 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash -907645030, now seen corresponding path program 1 times [2018-02-02 20:14:25,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:25,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:25,587 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:14:25,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:25,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:14:25,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:25,588 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:14:25,588 INFO L182 omatonBuilderFactory]: Interpolants [8787#true, 8788#false, 8789#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 8790#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 8791#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 8792#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 8793#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 8794#(= 0 |main_#t~mem25.offset|)] [2018-02-02 20:14:25,588 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:14:25,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:14:25,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:14:25,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:14:25,589 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand 8 states. [2018-02-02 20:14:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:25,704 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2018-02-02 20:14:25,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:14:25,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-02-02 20:14:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:25,706 INFO L225 Difference]: With dead ends: 178 [2018-02-02 20:14:25,706 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 20:14:25,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:14:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 20:14:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2018-02-02 20:14:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:14:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2018-02-02 20:14:25,710 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 44 [2018-02-02 20:14:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:25,710 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2018-02-02 20:14:25,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:14:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2018-02-02 20:14:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:14:25,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:25,711 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, 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:14:25,711 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash -907645029, now seen corresponding path program 1 times [2018-02-02 20:14:25,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:25,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:25,745 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:14:25,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:25,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:14:25,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:25,745 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:14:25,746 INFO L182 omatonBuilderFactory]: Interpolants [9154#true, 9155#false, 9156#(= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 9157#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 9158#(= |#valid| |old(#valid)|), 9159#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 20:14:25,746 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:14:25,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:14:25,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:14:25,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:25,746 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand 6 states. [2018-02-02 20:14:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:25,867 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2018-02-02 20:14:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:14:25,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 20:14:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:25,869 INFO L225 Difference]: With dead ends: 177 [2018-02-02 20:14:25,869 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 20:14:25,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:14:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 20:14:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-02-02 20:14:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 20:14:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2018-02-02 20:14:25,873 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 44 [2018-02-02 20:14:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:25,873 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2018-02-02 20:14:25,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:14:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2018-02-02 20:14:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:14:25,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:25,874 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, 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:14:25,874 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash 563904760, now seen corresponding path program 1 times [2018-02-02 20:14:25,874 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:25,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:25,986 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:14:25,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:25,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:14:25,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:25,987 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:14:25,987 INFO L182 omatonBuilderFactory]: Interpolants [9520#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 9521#(and (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 9522#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9523#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 8) (select |#length| |main_#t~mem23.base|))), 9514#true, 9515#false, 9516#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 9517#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 9518#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 9519#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))] [2018-02-02 20:14:25,987 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:14:25,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:14:25,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:14:25,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:14:25,987 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand 10 states. [2018-02-02 20:14:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:26,165 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2018-02-02 20:14:26,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:14:26,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-02-02 20:14:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:26,166 INFO L225 Difference]: With dead ends: 179 [2018-02-02 20:14:26,166 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 20:14:26,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:14:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 20:14:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2018-02-02 20:14:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 20:14:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2018-02-02 20:14:26,171 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 43 [2018-02-02 20:14:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:26,172 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2018-02-02 20:14:26,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:14:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2018-02-02 20:14:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:14:26,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:26,172 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, 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:14:26,173 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash -368510437, now seen corresponding path program 1 times [2018-02-02 20:14:26,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:26,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:26,323 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:14:26,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:26,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:14:26,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:26,324 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:14:26,324 INFO L182 omatonBuilderFactory]: Interpolants [9888#(not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 9889#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9890#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9891#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (not (= |main_~#list~0.base| |main_#t~mem25.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 9880#true, 9881#false, 9882#(= 1 (select |#valid| |main_~#list~0.base|)), 9883#(= |#valid| |old(#valid)|), 9884#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 9885#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 9886#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base))), 9887#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))] [2018-02-02 20:14:26,324 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:14:26,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:14:26,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:14:26,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:14:26,325 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand 12 states. [2018-02-02 20:14:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:26,564 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2018-02-02 20:14:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:14:26,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-02-02 20:14:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:26,564 INFO L225 Difference]: With dead ends: 197 [2018-02-02 20:14:26,564 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 20:14:26,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:14:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 20:14:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2018-02-02 20:14:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 20:14:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-02-02 20:14:26,567 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 46 [2018-02-02 20:14:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:26,567 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-02-02 20:14:26,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:14:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-02-02 20:14:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:14:26,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:26,568 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, 1, 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:14:26,568 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:26,568 INFO L82 PathProgramCache]: Analyzing trace with hash 221499877, now seen corresponding path program 1 times [2018-02-02 20:14:26,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:26,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:26,803 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:14:26,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:26,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:14:26,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:26,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:14:26,834 INFO L182 omatonBuilderFactory]: Interpolants [10304#(= 1 (select |#valid| |freeData_#in~data.base|)), 10305#(= 1 (select |#valid| freeData_~data.base)), 10288#true, 10289#false, 10290#(= (select |#valid| |main_~#list~0.base|) 1), 10291#(= |#valid| |old(#valid)|), 10292#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 10293#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 10294#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 10295#(= 1 (select |#valid| create_data_~data~0.base)), 10296#(= 1 (select |#valid| |create_data_#res.base|)), 10297#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| |append_#t~ret17.base|))))), 10298#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base))), 10299#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 10300#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10301#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10302#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 10303#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 20:14:26,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:14:26,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:14:26,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:14:26,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:14:26,835 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 18 states. [2018-02-02 20:14:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:27,513 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2018-02-02 20:14:27,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:14:27,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-02 20:14:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:27,514 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:14:27,514 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 20:14:27,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:14:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 20:14:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2018-02-02 20:14:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:14:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-02 20:14:27,519 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 47 [2018-02-02 20:14:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:27,519 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-02 20:14:27,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:14:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-02 20:14:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:14:27,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:27,520 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, 1, 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:14:27,520 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash 221499878, now seen corresponding path program 1 times [2018-02-02 20:14:27,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:27,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:27,799 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:14:27,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:27,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:14:27,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:27,800 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:14:27,800 INFO L182 omatonBuilderFactory]: Interpolants [10752#(= |#valid| |old(#valid)|), 10753#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 10754#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 10755#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 10756#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 10757#(and (= 0 create_data_~data~0.offset) (= 8 (select |#length| create_data_~data~0.base))), 10758#(and (= 0 |create_data_#res.offset|) (= 8 (select |#length| |create_data_#res.base|))), 10759#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| |append_#t~ret17.base|)) (= 0 |append_#t~ret17.offset|)) (= append_~node~0.base append_~pointerToList.base))), 10760#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~node~0.base append_~pointerToList.base))), 10761#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 10762#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10763#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10764#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 10765#(and (= 8 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 10766#(and (= 0 |freeData_#in~data.offset|) (= 8 (select |#length| |freeData_#in~data.base|))), 10767#(and (= (select |#length| freeData_~data.base) 8) (= 0 freeData_~data.offset)), 10749#true, 10750#false, 10751#(= (select |#valid| |main_~#list~0.base|) 1)] [2018-02-02 20:14:27,800 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:14:27,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:14:27,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:14:27,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:14:27,801 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 19 states. [2018-02-02 20:14:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:28,620 INFO L93 Difference]: Finished difference Result 232 states and 262 transitions. [2018-02-02 20:14:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:14:28,620 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-02 20:14:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:28,621 INFO L225 Difference]: With dead ends: 232 [2018-02-02 20:14:28,621 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:14:28,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:14:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:14:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2018-02-02 20:14:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 20:14:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2018-02-02 20:14:28,627 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 47 [2018-02-02 20:14:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:28,627 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2018-02-02 20:14:28,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:14:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2018-02-02 20:14:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:14:28,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:28,628 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:14:28,629 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1594265010, now seen corresponding path program 1 times [2018-02-02 20:14:28,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:28,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:28,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:28,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:14:28,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:28,661 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:14:28,662 INFO L182 omatonBuilderFactory]: Interpolants [11249#true, 11250#false, 11251#(= create_data_~counter~0 0), 11252#(<= create_data_~counter~0 1), 11253#(<= create_data_~counter~0 2)] [2018-02-02 20:14:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:28,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:28,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:28,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:28,662 INFO L87 Difference]: Start difference. First operand 211 states and 242 transitions. Second operand 5 states. [2018-02-02 20:14:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:28,680 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-02 20:14:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:14:28,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 20:14:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:28,681 INFO L225 Difference]: With dead ends: 223 [2018-02-02 20:14:28,681 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 20:14:28,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 20:14:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2018-02-02 20:14:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:14:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 249 transitions. [2018-02-02 20:14:28,686 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 249 transitions. Word has length 47 [2018-02-02 20:14:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:28,686 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 249 transitions. [2018-02-02 20:14:28,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 249 transitions. [2018-02-02 20:14:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:14:28,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:28,687 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, 1, 1, 1, 1, 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:14:28,687 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162428, now seen corresponding path program 1 times [2018-02-02 20:14:28,688 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:28,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:28,721 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:14:28,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:28,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:28,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:28,722 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:14:28,722 INFO L182 omatonBuilderFactory]: Interpolants [11696#false, 11697#(= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))), 11698#(= 0 (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))), 11699#(= |freeData_#t~mem13.offset| 0), 11695#true] [2018-02-02 20:14:28,722 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:14:28,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:28,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:28,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:28,723 INFO L87 Difference]: Start difference. First operand 218 states and 249 transitions. Second operand 5 states. [2018-02-02 20:14:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:28,793 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2018-02-02 20:14:28,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:14:28,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-02-02 20:14:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:28,794 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:14:28,794 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 20:14:28,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 20:14:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2018-02-02 20:14:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 20:14:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 247 transitions. [2018-02-02 20:14:28,799 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 247 transitions. Word has length 50 [2018-02-02 20:14:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:28,800 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 247 transitions. [2018-02-02 20:14:28,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 247 transitions. [2018-02-02 20:14:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:14:28,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:28,800 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, 1, 1, 1, 1, 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:14:28,801 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:28,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162429, now seen corresponding path program 1 times [2018-02-02 20:14:28,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:28,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:28,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:14:28,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:28,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:14:28,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:28,829 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:14:28,829 INFO L182 omatonBuilderFactory]: Interpolants [12144#(= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))), 12145#(= |freeData_#t~mem13.base| 0), 12141#true, 12142#false, 12143#(= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))] [2018-02-02 20:14:28,829 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:14:28,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:14:28,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:14:28,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:14:28,829 INFO L87 Difference]: Start difference. First operand 217 states and 247 transitions. Second operand 5 states. [2018-02-02 20:14:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:28,890 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2018-02-02 20:14:28,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:14:28,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-02-02 20:14:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:28,892 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:14:28,892 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 20:14:28,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 20:14:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2018-02-02 20:14:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 20:14:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 245 transitions. [2018-02-02 20:14:28,897 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 245 transitions. Word has length 50 [2018-02-02 20:14:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:28,897 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 245 transitions. [2018-02-02 20:14:28,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:14:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 245 transitions. [2018-02-02 20:14:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:14:28,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:28,898 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] [2018-02-02 20:14:28,898 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash -420728712, now seen corresponding path program 1 times [2018-02-02 20:14:28,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:28,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:29,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:29,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:14:29,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:29,480 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:14:29,480 INFO L182 omatonBuilderFactory]: Interpolants [12585#true, 12586#false, 12587#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 12588#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12589#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12590#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12591#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 12592#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 12593#(and (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))))), 12594#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (and (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 12595#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 12596#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12597#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12598#(or (and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (not (= |main_#t~mem21.offset| 0)))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12599#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 12600#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 12601#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (not (= |main_#t~mem25.offset| 0)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12602#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12603#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.base| 0))] [2018-02-02 20:14:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:29,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:14:29,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:14:29,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:14:29,481 INFO L87 Difference]: Start difference. First operand 216 states and 245 transitions. Second operand 19 states. [2018-02-02 20:14:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:30,186 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2018-02-02 20:14:30,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:14:30,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 20:14:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:30,187 INFO L225 Difference]: With dead ends: 231 [2018-02-02 20:14:30,187 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 20:14:30,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:14:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 20:14:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2018-02-02 20:14:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 20:14:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 253 transitions. [2018-02-02 20:14:30,192 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 253 transitions. Word has length 51 [2018-02-02 20:14:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:30,192 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 253 transitions. [2018-02-02 20:14:30,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:14:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 253 transitions. [2018-02-02 20:14:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:14:30,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:30,193 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, 1, 1, 1, 1, 1, 1, 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:14:30,193 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1806033505, now seen corresponding path program 1 times [2018-02-02 20:14:30,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:30,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:30,240 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:14:30,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:30,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:14:30,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:30,241 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:14:30,241 INFO L182 omatonBuilderFactory]: Interpolants [13088#(= 1 (select |#valid| freeData_~data.base)), 13083#true, 13084#false, 13085#(and (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 1 (select |#valid| freeData_~data.base))), 13086#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 1 (select |#valid| freeData_~data.base))), 13087#(and (= |freeData_#t~mem13.base| 0) (= 1 (select |#valid| freeData_~data.base)))] [2018-02-02 20:14:30,241 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:14:30,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:14:30,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:14:30,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:30,242 INFO L87 Difference]: Start difference. First operand 224 states and 253 transitions. Second operand 6 states. [2018-02-02 20:14:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:30,290 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2018-02-02 20:14:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:14:30,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-02-02 20:14:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:30,291 INFO L225 Difference]: With dead ends: 224 [2018-02-02 20:14:30,291 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 20:14:30,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 20:14:30,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-02-02 20:14:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 20:14:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 248 transitions. [2018-02-02 20:14:30,293 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 248 transitions. Word has length 52 [2018-02-02 20:14:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:30,294 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 248 transitions. [2018-02-02 20:14:30,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:14:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 248 transitions. [2018-02-02 20:14:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:14:30,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:30,294 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:30,294 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash -594351723, now seen corresponding path program 1 times [2018-02-02 20:14:30,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:30,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:30,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:30,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:14:30,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:30,580 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:14:30,580 INFO L182 omatonBuilderFactory]: Interpolants [13536#true, 13537#false, 13538#(= |#valid| |old(#valid)|), 13539#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 13540#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 13541#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |old(#valid)| (store |#valid| |append_#t~malloc14.base| (select |old(#valid)| |append_#t~malloc14.base|)))), 13542#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= (store |#valid| append_~node~0.base (select |old(#valid)| append_~node~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| append_~node~0.base)) (= |append_#in~pointerToList.base| append_~pointerToList.base)))), 13543#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (store |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) |old(#valid)|))), 13544#(or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 13545#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 13546#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 13547#(and (or (and (= (store (store |#valid| |main_~#list~0.base| 0) |main_#t~mem25.base| (select (store |#valid| |main_#t~mem25.base| 0) |main_#t~mem25.base|)) |old(#valid)|) (not (= |main_#t~mem25.base| |main_~#list~0.base|))) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0)))), 13548#(or (= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-02 20:14:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:30,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:14:30,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:14:30,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:14:30,581 INFO L87 Difference]: Start difference. First operand 221 states and 248 transitions. Second operand 13 states. [2018-02-02 20:14:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:30,979 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2018-02-02 20:14:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:14:30,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 20:14:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:30,981 INFO L225 Difference]: With dead ends: 230 [2018-02-02 20:14:30,981 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 20:14:30,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:14:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 20:14:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-02-02 20:14:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 20:14:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 226 transitions. [2018-02-02 20:14:30,986 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 226 transitions. Word has length 53 [2018-02-02 20:14:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:30,986 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 226 transitions. [2018-02-02 20:14:30,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:14:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2018-02-02 20:14:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:14:30,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:30,987 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, 1, 1, 1, 1, 1, 1, 1, 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:14:30,987 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash 419691716, now seen corresponding path program 1 times [2018-02-02 20:14:30,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:30,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:31,368 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:14:31,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:31,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 20:14:31,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:31,369 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:14:31,369 INFO L182 omatonBuilderFactory]: Interpolants [13991#true, 13992#false, 13993#(= 1 (select |#valid| |main_~#list~0.base|)), 13994#(= |#valid| |old(#valid)|), 13995#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 13996#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 13997#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 13998#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| append_~pointerToList.base))), 13999#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 14000#(= 0 (select |old(#valid)| create_data_~data~0.base)), 14001#(= 0 (select |old(#valid)| |create_data_#res.base|)), 14002#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (not (= append_~pointerToList.base |append_#t~ret17.base|))), 14003#(and (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~pointerToList.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))))), 14004#(and (= 1 (select |#valid| |append_#in~pointerToList.base|)) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))))), 14005#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 1 (select |#valid| |main_~#list~0.base|))), 14006#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= 1 (select |#valid| |main_~#list~0.base|))), 14007#(and (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 14008#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14009#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14010#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 20:14:31,369 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:14:31,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:14:31,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:14:31,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:14:31,369 INFO L87 Difference]: Start difference. First operand 200 states and 226 transitions. Second operand 20 states. [2018-02-02 20:14:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:31,966 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2018-02-02 20:14:32,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:14:32,006 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-02 20:14:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:32,006 INFO L225 Difference]: With dead ends: 236 [2018-02-02 20:14:32,006 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 20:14:32,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:14:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 20:14:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2018-02-02 20:14:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 20:14:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2018-02-02 20:14:32,010 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 254 transitions. Word has length 53 [2018-02-02 20:14:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:32,010 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 254 transitions. [2018-02-02 20:14:32,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:14:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 254 transitions. [2018-02-02 20:14:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:14:32,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:32,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:32,011 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash 125541378, now seen corresponding path program 1 times [2018-02-02 20:14:32,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:32,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:32,289 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:14:32,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:32,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:14:32,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:32,290 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:14:32,290 INFO L182 omatonBuilderFactory]: Interpolants [14496#true, 14497#false, 14498#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 14499#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 14500#(= |#valid| |old(#valid)|), 14501#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 14502#(= 0 (select |old(#valid)| create_data_~data~0.base)), 14503#(= 0 (select |old(#valid)| |create_data_#res.base|)), 14504#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~node~0.base |append_#t~ret17.base|))), 14505#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| append_~node~0.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base))), 14506#(and (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 14507#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 14508#(and (or (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 14509#(and (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 14510#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14511#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14512#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 14513#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 14514#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 20:14:32,291 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:14:32,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:14:32,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:14:32,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:14:32,291 INFO L87 Difference]: Start difference. First operand 221 states and 254 transitions. Second operand 19 states. [2018-02-02 20:14:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:32,760 INFO L93 Difference]: Finished difference Result 235 states and 269 transitions. [2018-02-02 20:14:32,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:14:32,760 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-02 20:14:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:32,761 INFO L225 Difference]: With dead ends: 235 [2018-02-02 20:14:32,761 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 20:14:32,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:14:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 20:14:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 215. [2018-02-02 20:14:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 20:14:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2018-02-02 20:14:32,765 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 54 [2018-02-02 20:14:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:32,765 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2018-02-02 20:14:32,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:14:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2018-02-02 20:14:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:14:32,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:32,766 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:14:32,766 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash 866020445, now seen corresponding path program 1 times [2018-02-02 20:14:32,767 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:32,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:33,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:33,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:14:33,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:33,014 INFO L182 omatonBuilderFactory]: Interpolants [15008#(= 1 (select |#valid| freeData_~data.base)), 14989#true, 14990#false, 14991#(= append_~pointerToList.base |append_#in~pointerToList.base|), 14992#(= (select |#valid| |append_#in~pointerToList.base|) 1), 14993#(= (select |#valid| |main_~#list~0.base|) 1), 14994#(= |#valid| |old(#valid)|), 14995#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 14996#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 14997#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 14998#(= 1 (select |#valid| create_data_~data~0.base)), 14999#(= 1 (select |#valid| |create_data_#res.base|)), 15000#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| |append_#t~ret17.base|))), 15001#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base))), 15002#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 15003#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 15004#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 15005#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 15006#(= 1 (select |#valid| |main_#t~mem24.base|)), 15007#(= 1 (select |#valid| |freeData_#in~data.base|))] [2018-02-02 20:14:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:33,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:14:33,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:14:33,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:14:33,015 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand 20 states. [2018-02-02 20:14:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:33,574 INFO L93 Difference]: Finished difference Result 246 states and 281 transitions. [2018-02-02 20:14:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:14:33,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-02-02 20:14:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:33,575 INFO L225 Difference]: With dead ends: 246 [2018-02-02 20:14:33,575 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 20:14:33,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=1383, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:14:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 20:14:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 219. [2018-02-02 20:14:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:14:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-02-02 20:14:33,580 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 67 [2018-02-02 20:14:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:33,580 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-02-02 20:14:33,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:14:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-02-02 20:14:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:14:33,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:33,581 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:14:33,581 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash -688882574, now seen corresponding path program 1 times [2018-02-02 20:14:33,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:33,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:14:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:33,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:33,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:14:33,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:33,855 INFO L182 omatonBuilderFactory]: Interpolants [15520#(= (select |#valid| |main_~#list~0.base|) 1), 15521#(= |#valid| |old(#valid)|), 15522#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 15523#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 15524#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 15525#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 15526#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret17.offset|) (= 0 |append_#t~ret17.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 15527#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~pointerToList.base append_~node~0.base)) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 15528#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 15529#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 15530#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 15531#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 15532#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 15533#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 15534#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0)), 15516#true, 15517#false, 15518#(= append_~pointerToList.base |append_#in~pointerToList.base|), 15519#(= (select |#valid| |append_#in~pointerToList.base|) 1)] [2018-02-02 20:14:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:33,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:14:33,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:14:33,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:14:33,856 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 19 states. [2018-02-02 20:14:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:34,540 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2018-02-02 20:14:34,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:14:34,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 20:14:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:34,541 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:14:34,541 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:14:34,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=1363, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:14:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:14:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 223. [2018-02-02 20:14:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 20:14:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2018-02-02 20:14:34,545 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 60 [2018-02-02 20:14:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:34,546 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2018-02-02 20:14:34,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:14:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2018-02-02 20:14:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:14:34,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:34,547 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:14:34,547 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 866020446, now seen corresponding path program 1 times [2018-02-02 20:14:34,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:34,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:34,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:34,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:14:34,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:34,880 INFO L182 omatonBuilderFactory]: Interpolants [16064#(and (= (select |#length| freeData_~data.base) 8) (= 0 freeData_~data.offset)), 16044#true, 16045#false, 16046#(= append_~pointerToList.base |append_#in~pointerToList.base|), 16047#(= (select |#valid| |append_#in~pointerToList.base|) 1), 16048#(= (select |#valid| |main_~#list~0.base|) 1), 16049#(= |#valid| |old(#valid)|), 16050#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 16051#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 16052#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 16053#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 16054#(and (= 0 create_data_~data~0.offset) (= 8 (select |#length| create_data_~data~0.base))), 16055#(and (= 0 |create_data_#res.offset|) (= 8 (select |#length| |create_data_#res.base|))), 16056#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| |append_#t~ret17.base|)) (= 0 |append_#t~ret17.offset|)) (= append_~node~0.base append_~pointerToList.base))), 16057#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~node~0.base append_~pointerToList.base))), 16058#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 16059#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 16060#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 16061#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 16062#(and (= 8 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 16063#(and (= 0 |freeData_#in~data.offset|) (= 8 (select |#length| |freeData_#in~data.base|)))] [2018-02-02 20:14:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:34,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:14:34,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:14:34,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:14:34,880 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand 21 states. [2018-02-02 20:14:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:35,629 INFO L93 Difference]: Finished difference Result 279 states and 315 transitions. [2018-02-02 20:14:35,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:14:35,629 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-02-02 20:14:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:35,630 INFO L225 Difference]: With dead ends: 279 [2018-02-02 20:14:35,630 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 20:14:35,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:14:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 20:14:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 240. [2018-02-02 20:14:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:14:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2018-02-02 20:14:35,633 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 67 [2018-02-02 20:14:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:35,633 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2018-02-02 20:14:35,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:14:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2018-02-02 20:14:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:14:35,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:35,634 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:35,634 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1528121714, now seen corresponding path program 2 times [2018-02-02 20:14:35,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:35,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:35,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:35,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:14:35,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:35,670 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:14:35,670 INFO L182 omatonBuilderFactory]: Interpolants [16632#true, 16633#false, 16634#(= create_data_~counter~0 0), 16635#(<= create_data_~counter~0 1), 16636#(<= create_data_~counter~0 2), 16637#(<= create_data_~counter~0 3)] [2018-02-02 20:14:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:35,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:14:35,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:14:35,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:35,671 INFO L87 Difference]: Start difference. First operand 240 states and 272 transitions. Second operand 6 states. [2018-02-02 20:14:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:35,688 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2018-02-02 20:14:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:14:35,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-02-02 20:14:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:35,689 INFO L225 Difference]: With dead ends: 252 [2018-02-02 20:14:35,690 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 20:14:35,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:14:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 20:14:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 247. [2018-02-02 20:14:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 20:14:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 279 transitions. [2018-02-02 20:14:35,693 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 279 transitions. Word has length 54 [2018-02-02 20:14:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:35,694 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 279 transitions. [2018-02-02 20:14:35,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:14:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 279 transitions. [2018-02-02 20:14:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:14:35,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:35,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:35,694 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:35,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2023698147, now seen corresponding path program 1 times [2018-02-02 20:14:35,695 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:35,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:36,104 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:14:36,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:36,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 20:14:36,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:36,105 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:14:36,105 INFO L182 omatonBuilderFactory]: Interpolants [17152#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= 1 (select |#valid| |main_~#list~0.base|))), 17153#(and (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 17154#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 17155#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 17156#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))), 17157#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 17158#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base) (= |freeData_#t~mem13.base| 0)), 17159#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 17137#true, 17138#false, 17139#(= 1 (select |#valid| |main_~#list~0.base|)), 17140#(= |#valid| |old(#valid)|), 17141#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 17142#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 17143#(and (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 17144#(and (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base))))), 17145#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 17146#(= 0 (select |old(#valid)| create_data_~data~0.base)), 17147#(= 0 (select |old(#valid)| |create_data_#res.base|)), 17148#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~pointerToList.base |append_#t~ret17.base|)))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 17149#(and (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~pointerToList.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))))), 17150#(and (= 1 (select |#valid| |append_#in~pointerToList.base|)) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))))), 17151#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 1 (select |#valid| |main_~#list~0.base|)))] [2018-02-02 20:14:36,105 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:14:36,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:14:36,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:14:36,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:14:36,106 INFO L87 Difference]: Start difference. First operand 247 states and 279 transitions. Second operand 23 states. [2018-02-02 20:14:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:36,697 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2018-02-02 20:14:36,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:14:36,697 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-02-02 20:14:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:36,698 INFO L225 Difference]: With dead ends: 264 [2018-02-02 20:14:36,698 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 20:14:36,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:14:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 20:14:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 247. [2018-02-02 20:14:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 20:14:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 277 transitions. [2018-02-02 20:14:36,702 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 277 transitions. Word has length 56 [2018-02-02 20:14:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:36,703 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 277 transitions. [2018-02-02 20:14:36,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:14:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 277 transitions. [2018-02-02 20:14:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:14:36,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:36,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:36,704 INFO L371 AbstractCegarLoop]: === Iteration 52 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1689866953, now seen corresponding path program 1 times [2018-02-02 20:14:36,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:36,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:37,045 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:14:37,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:37,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 20:14:37,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:37,075 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:14:37,075 INFO L182 omatonBuilderFactory]: Interpolants [17701#true, 17702#false, 17703#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 17704#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 17705#(= |#valid| |old(#valid)|), 17706#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 17707#(= 0 (select |old(#valid)| create_data_~data~0.base)), 17708#(= 0 (select |old(#valid)| |create_data_#res.base|)), 17709#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~node~0.base |append_#t~ret17.base|))), 17710#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| append_~node~0.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base))), 17711#(and (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 17712#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 17713#(and (or (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 17714#(and (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 17715#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 17716#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 17717#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))), 17718#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 17719#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base) (= |freeData_#t~mem13.base| 0)), 17720#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 17721#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 17722#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 20:14:37,075 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:14:37,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:14:37,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:14:37,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:14:37,076 INFO L87 Difference]: Start difference. First operand 247 states and 277 transitions. Second operand 22 states. [2018-02-02 20:14:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:37,592 INFO L93 Difference]: Finished difference Result 269 states and 298 transitions. [2018-02-02 20:14:37,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:14:37,593 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-02-02 20:14:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:37,594 INFO L225 Difference]: With dead ends: 269 [2018-02-02 20:14:37,594 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 20:14:37,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:14:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 20:14:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 232. [2018-02-02 20:14:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 20:14:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 257 transitions. [2018-02-02 20:14:37,598 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 257 transitions. Word has length 57 [2018-02-02 20:14:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:37,598 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 257 transitions. [2018-02-02 20:14:37,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:14:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 257 transitions. [2018-02-02 20:14:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:14:37,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:37,599 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, 1, 1, 1, 1, 1] [2018-02-02 20:14:37,599 INFO L371 AbstractCegarLoop]: === Iteration 53 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 195535773, now seen corresponding path program 1 times [2018-02-02 20:14:37,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:37,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:37,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:37,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 20:14:37,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:37,901 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:14:37,901 INFO L182 omatonBuilderFactory]: Interpolants [18250#true, 18251#false, 18252#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 18253#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 18254#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0)), 18255#(not (= |create_data_#t~malloc1.base| 0)), 18256#(not (= create_data_~data~0.base 0)), 18257#(not (= |create_data_#res.base| 0)), 18258#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (not (= |append_#t~ret17.base| 0))), 18259#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) 0)))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 18260#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0))), 18261#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18262#(or (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0))), 18263#(or (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0))), 18264#(or (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) 0))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 18265#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= |main_#t~mem24.base| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 18266#(= freeData_~data.base |freeData_#in~data.base|), 18267#(= 0 |freeData_#in~data.base|), 18268#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 18269#(or (not (= 0 |main_#t~mem25.offset|)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 18270#(and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 20:14:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:37,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:14:37,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:14:37,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:14:37,901 INFO L87 Difference]: Start difference. First operand 232 states and 257 transitions. Second operand 21 states. [2018-02-02 20:14:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:38,458 INFO L93 Difference]: Finished difference Result 261 states and 286 transitions. [2018-02-02 20:14:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:14:38,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-02 20:14:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:38,458 INFO L225 Difference]: With dead ends: 261 [2018-02-02 20:14:38,459 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 20:14:38,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:14:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 20:14:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 237. [2018-02-02 20:14:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 20:14:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2018-02-02 20:14:38,461 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 58 [2018-02-02 20:14:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:38,461 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2018-02-02 20:14:38,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:14:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2018-02-02 20:14:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:14:38,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:38,462 INFO L351 BasicCegarLoop]: trace histogram [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:14:38,462 INFO L371 AbstractCegarLoop]: === Iteration 54 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:38,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1320961102, now seen corresponding path program 1 times [2018-02-02 20:14:38,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:38,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:14:38,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:38,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:14:38,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:14:38,627 INFO L182 omatonBuilderFactory]: Interpolants [18816#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 18817#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 18818#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (not (= |main_~#list~0.base| |main_#t~mem25.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 18805#true, 18806#false, 18807#(= append_~pointerToList.base |append_#in~pointerToList.base|), 18808#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 18809#(= 1 (select |#valid| |main_~#list~0.base|)), 18810#(= |#valid| |old(#valid)|), 18811#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 18812#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 18813#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base))), 18814#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 18815#(not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 20:14:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:14:38,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:14:38,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:14:38,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:14:38,628 INFO L87 Difference]: Start difference. First operand 237 states and 260 transitions. Second operand 14 states. [2018-02-02 20:14:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:38,914 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2018-02-02 20:14:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:14:38,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 20:14:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:38,915 INFO L225 Difference]: With dead ends: 246 [2018-02-02 20:14:38,916 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 20:14:38,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:14:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 20:14:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 191. [2018-02-02 20:14:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:14:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 207 transitions. [2018-02-02 20:14:38,919 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 207 transitions. Word has length 73 [2018-02-02 20:14:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:38,920 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 207 transitions. [2018-02-02 20:14:38,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:14:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 207 transitions. [2018-02-02 20:14:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:14:38,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:38,921 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:38,921 INFO L371 AbstractCegarLoop]: === Iteration 55 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1492741583, now seen corresponding path program 1 times [2018-02-02 20:14:38,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:38,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:39,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:14:39,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 20:14:39,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:39,698 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:14:39,698 INFO L182 omatonBuilderFactory]: Interpolants [19277#true, 19278#false, 19279#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 19280#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 19281#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (not (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)))), 19282#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~node~0.base) 1) (or (not (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)))), 19283#(= |#valid| |old(#valid)|), 19284#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 19285#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 19286#(and (= 0 create_data_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 19287#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |create_data_#res.base|) 4))), 19288#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (not (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base))) (or (= |append_#t~ret17.base| |append_#in~pointerToList.base|) (and (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|)) |append_#t~ret17.base|) 4)) (= 0 (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|)) |append_#t~ret17.base|) 4))))), 19289#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4)) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4))) (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) |append_#in~pointerToList.base|))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 19290#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) |append_#in~pointerToList.base|) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)))), 19291#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19292#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19293#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 19294#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4))) (= |main_~#list~0.base| |main_#t~mem24.base|)), 19295#(= freeData_~data.base |freeData_#in~data.base|), 19296#(or (and (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 19297#(or (and (= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 19298#(or (and (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|) (or (not (= (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))))) (not (= 0 freeData_~data.offset))), 19299#(and (or (not (= (select (select |#memory_$Pointer$.offset| |freeData_#in~data.base|) 4) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4)))) (= 0 (select |#valid| |freeData_#in~data.base|))), 19300#(or (= 0 (select |#valid| |main_~#list~0.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19301#(and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 19302#(and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 20:14:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:39,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:14:39,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:14:39,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:14:39,700 INFO L87 Difference]: Start difference. First operand 191 states and 207 transitions. Second operand 26 states. [2018-02-02 20:14:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:40,834 INFO L93 Difference]: Finished difference Result 215 states and 234 transitions. [2018-02-02 20:14:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:14:40,834 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 20:14:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:40,835 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:14:40,835 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:14:40,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=279, Invalid=2583, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:14:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:14:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2018-02-02 20:14:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:14:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-02-02 20:14:40,837 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 61 [2018-02-02 20:14:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:40,837 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-02-02 20:14:40,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:14:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2018-02-02 20:14:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:14:40,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:40,838 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:40,838 INFO L371 AbstractCegarLoop]: === Iteration 56 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -722214450, now seen corresponding path program 3 times [2018-02-02 20:14:40,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:40,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:40,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:40,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:14:40,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:40,863 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:14:40,863 INFO L182 omatonBuilderFactory]: Interpolants [19765#true, 19766#false, 19767#(= create_data_~counter~0 0), 19768#(<= create_data_~counter~0 1), 19769#(<= create_data_~counter~0 2), 19770#(<= create_data_~counter~0 3), 19771#(<= create_data_~counter~0 4)] [2018-02-02 20:14:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:40,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:14:40,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:14:40,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:40,864 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand 7 states. [2018-02-02 20:14:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:40,879 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2018-02-02 20:14:40,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:14:40,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-02-02 20:14:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:40,880 INFO L225 Difference]: With dead ends: 203 [2018-02-02 20:14:40,880 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 20:14:40,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:14:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 20:14:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2018-02-02 20:14:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 20:14:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 213 transitions. [2018-02-02 20:14:40,901 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 213 transitions. Word has length 61 [2018-02-02 20:14:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:40,901 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 213 transitions. [2018-02-02 20:14:40,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:14:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 213 transitions. [2018-02-02 20:14:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:14:40,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:40,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:14:40,902 INFO L371 AbstractCegarLoop]: === Iteration 57 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash 823786890, now seen corresponding path program 1 times [2018-02-02 20:14:40,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:40,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:41,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:41,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:14:41,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:41,513 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:14:41,513 INFO L182 omatonBuilderFactory]: Interpolants [20192#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base))), 20193#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base))), 20194#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 20195#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.base| 0)), 20173#true, 20174#false, 20175#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 20176#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20177#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20178#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20179#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 20180#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 20181#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~node~0.base) 1) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))) (= append_~node~0.base append_~pointerToList.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 20182#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20183#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20184#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20185#(and (= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base)))), 20186#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 20187#(and (= 0 append_~node~0.offset) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)))))), 20188#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (and (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 20189#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))))), 20190#(and (= 0 |main_#t~mem21.offset|) (or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 20191#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|)))] [2018-02-02 20:14:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:41,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:14:41,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:14:41,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:14:41,514 INFO L87 Difference]: Start difference. First operand 198 states and 213 transitions. Second operand 23 states. [2018-02-02 20:14:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:42,355 INFO L93 Difference]: Finished difference Result 226 states and 245 transitions. [2018-02-02 20:14:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:14:42,355 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-02-02 20:14:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:42,356 INFO L225 Difference]: With dead ends: 226 [2018-02-02 20:14:42,356 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 20:14:42,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:14:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 20:14:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-02-02 20:14:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 20:14:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2018-02-02 20:14:42,358 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 64 [2018-02-02 20:14:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:42,359 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2018-02-02 20:14:42,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:14:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2018-02-02 20:14:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:14:42,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:42,359 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-02-02 20:14:42,359 INFO L371 AbstractCegarLoop]: === Iteration 58 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:42,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1226100464, now seen corresponding path program 1 times [2018-02-02 20:14:42,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:42,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:42,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:42,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:14:42,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:42,996 INFO L182 omatonBuilderFactory]: Interpolants [20672#(= |#valid| |old(#valid)|), 20673#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 20674#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 20675#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 20676#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 20677#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= (select |old(#valid)| |append_#t~malloc14.base|) 0) (= |#valid| (store |old(#valid)| |append_#t~malloc14.base| (select |#valid| |append_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 20678#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (not (= 0 append_~node~0.base)) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| append_~node~0.base) 0)), 20679#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (not (= 0 append_~node~0.base)) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| append_~node~0.base) 0) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|)), 20680#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (not (= 0 append_~node~0.base)) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= (select |old(#valid)| append_~node~0.base) 0) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))), 20681#(and (= 0 append_~node~0.offset) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4))) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= (select |old(#valid)| append_~node~0.base) 0))) (not (= 0 append_~node~0.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 20682#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 20683#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 20684#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.offset| 0)), 20685#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_#t~mem22.base|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 20686#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) main_~next~0.base)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 20687#(and (or (= 1 (select (store |#valid| |main_#t~mem25.base| 0) main_~next~0.base)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= 0 |main_#t~mem25.base|))), 20688#(or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))), 20689#(= 1 (select |#valid| |main_#t~mem21.base|)), 20667#true, 20668#false, 20669#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 20670#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| |append_#t~malloc14.base|))), 20671#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base)))] [2018-02-02 20:14:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:42,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:14:42,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:14:42,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:14:42,997 INFO L87 Difference]: Start difference. First operand 217 states and 234 transitions. Second operand 23 states. [2018-02-02 20:14:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:44,066 INFO L93 Difference]: Finished difference Result 252 states and 277 transitions. [2018-02-02 20:14:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:14:44,066 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 20:14:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:44,067 INFO L225 Difference]: With dead ends: 252 [2018-02-02 20:14:44,067 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 20:14:44,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=1762, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:14:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 20:14:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 227. [2018-02-02 20:14:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-02 20:14:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 246 transitions. [2018-02-02 20:14:44,069 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 246 transitions. Word has length 71 [2018-02-02 20:14:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:44,069 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 246 transitions. [2018-02-02 20:14:44,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:14:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 246 transitions. [2018-02-02 20:14:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:14:44,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:44,070 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-02-02 20:14:44,070 INFO L371 AbstractCegarLoop]: === Iteration 59 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1226100465, now seen corresponding path program 1 times [2018-02-02 20:14:44,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:44,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:44,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:44,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:14:44,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:44,832 INFO L182 omatonBuilderFactory]: Interpolants [21216#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 21217#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 21218#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 21219#(= |old(#length)| |#length|), 21220#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 21221#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 21222#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21223#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21224#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= (store |old(#length)| |append_#t~malloc14.base| (select |#length| |append_#t~malloc14.base|)) |#length|) (= (select |#length| |append_#t~malloc14.base|) 8) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21225#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= 0 append_~node~0.offset) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 21226#(and (= 0 append_~node~0.offset) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= |append_#t~mem16.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 21227#(and (= 0 append_~node~0.offset) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 21228#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 21229#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 21230#(and (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.offset| 0)), 21231#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.offset|) (<= 8 (select |#length| |main_#t~mem22.base|)))), 21232#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset))), 21233#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset))), 21234#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21235#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 21236#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|))), 21214#true, 21215#false] [2018-02-02 20:14:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:44,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:14:44,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:14:44,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:14:44,833 INFO L87 Difference]: Start difference. First operand 227 states and 246 transitions. Second operand 23 states. [2018-02-02 20:14:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:46,068 INFO L93 Difference]: Finished difference Result 277 states and 308 transitions. [2018-02-02 20:14:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:14:46,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 20:14:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:46,069 INFO L225 Difference]: With dead ends: 277 [2018-02-02 20:14:46,069 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 20:14:46,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:14:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 20:14:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 250. [2018-02-02 20:14:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 20:14:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2018-02-02 20:14:46,073 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 71 [2018-02-02 20:14:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:46,074 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2018-02-02 20:14:46,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:14:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2018-02-02 20:14:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:14:46,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:46,075 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:46,075 INFO L371 AbstractCegarLoop]: === Iteration 60 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233511, now seen corresponding path program 1 times [2018-02-02 20:14:46,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:46,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:46,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:46,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:14:46,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:46,960 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:14:46,960 INFO L182 omatonBuilderFactory]: Interpolants [21824#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (= (store (store (store |#valid| |main_#t~mem24.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= |main_~#list~0.base| |main_#t~mem24.base|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21825#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 21826#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 21827#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= freeData_~data.base |freeData_#in~data.base|)), 21828#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 21829#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem13.base| 0) (= freeData_~data.base |freeData_#in~data.base|)), 21830#(and (= |old(#valid)| (store |#valid| |freeData_#in~data.base| (select |old(#valid)| |freeData_#in~data.base|))) (= 0 (select |#valid| |freeData_#in~data.base|))), 21831#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 0 (select |#valid| |main_~#list~0.base|)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21832#(and (not (= 0 |main_#t~mem25.base|)) (or (and (= (store (store |#valid| |main_#t~mem25.base| (select (store |#valid| |main_#t~mem25.base| 0) |main_#t~mem25.base|)) |main_~#list~0.base| 0) |old(#valid)|) (not (= |main_#t~mem25.base| |main_~#list~0.base|))) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 21833#(or (= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21807#true, 21808#false, 21809#(= |#valid| |old(#valid)|), 21810#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 21811#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 21812#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |old(#valid)| (store |#valid| |append_#t~malloc14.base| (select |old(#valid)| |append_#t~malloc14.base|)))), 21813#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (not (= 0 append_~node~0.base)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (or (= |#valid| |old(#valid)|) (= append_~node~0.base (@diff |#valid| |old(#valid)|)))), 21814#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (not (= 0 append_~node~0.base)) (= (select |#valid| append_~node~0.base) 1) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)), 21815#(and (= (store |#valid| |create_data_#t~malloc1.base| (select |old(#valid)| |create_data_#t~malloc1.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 21816#(and (= (store |#valid| create_data_~data~0.base (select |old(#valid)| create_data_~data~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| create_data_~data~0.base))), 21817#(and (= |old(#valid)| (store |#valid| |create_data_#res.base| (select |old(#valid)| |create_data_#res.base|))) (= 0 (select |old(#valid)| |create_data_#res.base|))), 21818#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= 0 (select |old(#valid)| append_~node~0.base)) (not (= append_~node~0.base |append_#t~ret17.base|)) (= 0 (select |old(#valid)| |append_#t~ret17.base|)) (= (store (store |#valid| append_~node~0.base (select |old(#valid)| append_~node~0.base)) |append_#t~ret17.base| (select |old(#valid)| |append_#t~ret17.base|)) |old(#valid)|)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#t~ret17.base| |append_#in~pointerToList.base|)))), 21819#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) |append_#in~pointerToList.base|)) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= (store (store |#valid| append_~node~0.base (select |old(#valid)| append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) |old(#valid)|) (not (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))))) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21820#(and (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) |append_#in~pointerToList.base|) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 21821#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) |old(#valid)|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21822#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) |old(#valid)|) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 21823#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) |old(#valid)|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-02 20:14:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:46,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:14:46,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:14:46,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:14:46,961 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand 27 states. [2018-02-02 20:14:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:48,133 INFO L93 Difference]: Finished difference Result 258 states and 285 transitions. [2018-02-02 20:14:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:14:48,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-02-02 20:14:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:48,134 INFO L225 Difference]: With dead ends: 258 [2018-02-02 20:14:48,134 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 20:14:48,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:14:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 20:14:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-02-02 20:14:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 20:14:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 256 transitions. [2018-02-02 20:14:48,138 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 256 transitions. Word has length 66 [2018-02-02 20:14:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:48,138 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 256 transitions. [2018-02-02 20:14:48,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:14:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 256 transitions. [2018-02-02 20:14:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:14:48,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:48,139 INFO L351 BasicCegarLoop]: trace histogram [2, 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] [2018-02-02 20:14:48,139 INFO L371 AbstractCegarLoop]: === Iteration 61 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1460521485, now seen corresponding path program 1 times [2018-02-02 20:14:48,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:48,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:48,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:48,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:14:48,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:48,560 INFO L182 omatonBuilderFactory]: Interpolants [22368#(and (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4)))))), 22369#(or (and (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 22370#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))))), 22371#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))))), 22372#(or (not (= 0 |main_#t~mem22.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22373#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 main_~next~0.base))), 22374#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 main_~next~0.base))), 22375#(or (not (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22376#(not (= 0 |main_#t~mem27.base|)), 22355#true, 22356#false, 22357#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 22358#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 22359#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 22360#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 22361#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 22362#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 22363#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 22364#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 22365#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 22366#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|)), 22367#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))))] [2018-02-02 20:14:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:48,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:14:48,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:14:48,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:14:48,560 INFO L87 Difference]: Start difference. First operand 233 states and 256 transitions. Second operand 22 states. [2018-02-02 20:14:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:49,380 INFO L93 Difference]: Finished difference Result 262 states and 290 transitions. [2018-02-02 20:14:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:14:49,380 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-02 20:14:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:49,381 INFO L225 Difference]: With dead ends: 262 [2018-02-02 20:14:49,381 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 20:14:49,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:14:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 20:14:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 233. [2018-02-02 20:14:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 20:14:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 254 transitions. [2018-02-02 20:14:49,384 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 254 transitions. Word has length 73 [2018-02-02 20:14:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:49,385 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 254 transitions. [2018-02-02 20:14:49,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:14:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 254 transitions. [2018-02-02 20:14:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:14:49,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:49,386 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:14:49,386 INFO L371 AbstractCegarLoop]: === Iteration 62 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1937872819, now seen corresponding path program 1 times [2018-02-02 20:14:49,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:49,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:49,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:49,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:14:49,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:49,830 INFO L182 omatonBuilderFactory]: Interpolants [22919#true, 22920#false, 22921#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 22922#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 22923#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 22924#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 22925#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 22926#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 22927#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22928#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22929#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22930#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22931#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 22932#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= append_~node~0.offset 0))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 22933#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 22934#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22935#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= |main_#t~mem21.offset| 0))), 22936#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 |main_#t~mem22.offset|)), 22937#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 22938#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 22939#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22940#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 22941#(and (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 22942#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22943#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 8) (select |#length| |main_#t~mem23.base|)))] [2018-02-02 20:14:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:49,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:14:49,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:14:49,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:14:49,830 INFO L87 Difference]: Start difference. First operand 233 states and 254 transitions. Second operand 25 states. [2018-02-02 20:14:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:50,993 INFO L93 Difference]: Finished difference Result 256 states and 278 transitions. [2018-02-02 20:14:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:14:50,993 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-02-02 20:14:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:50,994 INFO L225 Difference]: With dead ends: 256 [2018-02-02 20:14:50,994 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 20:14:50,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=370, Invalid=2710, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:14:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 20:14:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-02-02 20:14:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-02 20:14:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 257 transitions. [2018-02-02 20:14:50,999 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 257 transitions. Word has length 74 [2018-02-02 20:14:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:50,999 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 257 transitions. [2018-02-02 20:14:50,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:14:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 257 transitions. [2018-02-02 20:14:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:14:51,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:51,000 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:51,000 INFO L371 AbstractCegarLoop]: === Iteration 63 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash 753297906, now seen corresponding path program 4 times [2018-02-02 20:14:51,001 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:51,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:51,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:51,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:14:51,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:51,041 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:14:51,041 INFO L182 omatonBuilderFactory]: Interpolants [23504#(<= create_data_~counter~0 3), 23505#(<= create_data_~counter~0 4), 23506#(<= create_data_~counter~0 5), 23499#true, 23500#false, 23501#(= create_data_~counter~0 0), 23502#(<= create_data_~counter~0 1), 23503#(<= create_data_~counter~0 2)] [2018-02-02 20:14:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:51,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:14:51,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:14:51,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:14:51,042 INFO L87 Difference]: Start difference. First operand 236 states and 257 transitions. Second operand 8 states. [2018-02-02 20:14:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:51,065 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2018-02-02 20:14:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:14:51,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-02-02 20:14:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:51,066 INFO L225 Difference]: With dead ends: 248 [2018-02-02 20:14:51,066 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 20:14:51,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:14:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 20:14:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 243. [2018-02-02 20:14:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:14:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2018-02-02 20:14:51,068 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 68 [2018-02-02 20:14:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:51,068 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2018-02-02 20:14:51,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:14:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2018-02-02 20:14:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:14:51,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:51,069 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:14:51,069 INFO L371 AbstractCegarLoop]: === Iteration 64 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash -612890950, now seen corresponding path program 1 times [2018-02-02 20:14:51,069 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:51,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:52,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:52,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 20:14:52,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:52,163 INFO L182 omatonBuilderFactory]: Interpolants [24000#(= (select |#valid| |main_~#list~0.base|) 1), 24001#(= |#valid| |old(#valid)|), 24002#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 24003#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 24004#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (= append_~node~0.offset 0))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 24005#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 24006#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (= 0 |append_#t~ret17.offset|) (= append_~node~0.offset 0) (= 0 |append_#t~ret17.base|)))), 24007#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= 0 append_~node~0.offset) (= |append_#in~pointerToList.base| append_~pointerToList.base) (= (select |#valid| append_~node~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) 0))) (= append_~pointerToList.base append_~node~0.base))), 24008#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 1) (not (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)))), 24009#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 24010#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24011#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24012#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24013#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 24014#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |append_#t~mem16.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 24015#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 24016#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24017#(and (or (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |append_#in~pointerToList.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 24018#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 24019#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.offset| 0)), 24020#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) 0)) (not (= |main_~#list~0.base| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) 0)))), 24021#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0)))), 24022#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0)))), 24023#(or (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24024#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))), 24025#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))), 24026#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24027#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 24028#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 24029#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 24030#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 24031#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0)), 23998#true, 23999#false] [2018-02-02 20:14:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:52,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 20:14:52,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 20:14:52,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1038, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:14:52,163 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand 34 states. [2018-02-02 20:14:53,085 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 111 DAG size of output 110 [2018-02-02 20:14:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:14:55,260 INFO L93 Difference]: Finished difference Result 295 states and 327 transitions. [2018-02-02 20:14:55,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:14:55,261 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 78 [2018-02-02 20:14:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:14:55,261 INFO L225 Difference]: With dead ends: 295 [2018-02-02 20:14:55,261 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 20:14:55,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=366, Invalid=4326, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 20:14:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 20:14:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 274. [2018-02-02 20:14:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 20:14:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 300 transitions. [2018-02-02 20:14:55,264 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 300 transitions. Word has length 78 [2018-02-02 20:14:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:14:55,264 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 300 transitions. [2018-02-02 20:14:55,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 20:14:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 300 transitions. [2018-02-02 20:14:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:14:55,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:14:55,265 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-02-02 20:14:55,265 INFO L371 AbstractCegarLoop]: === Iteration 65 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:14:55,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1381540370, now seen corresponding path program 1 times [2018-02-02 20:14:55,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:14:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:14:55,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:14:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:56,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:14:56,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 20:14:56,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:14:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:56,769 INFO L182 omatonBuilderFactory]: Interpolants [24704#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 24705#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem13.base| 0) (= freeData_~data.base |freeData_#in~data.base|)), 24706#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (store |#valid| freeData_~data.base 0) (store |old(#valid)| freeData_~data.base (select (store |#valid| freeData_~data.base 0) freeData_~data.base))) (= freeData_~data.base |freeData_#in~data.base|)), 24707#(and (= |#valid| (store |old(#valid)| |freeData_#in~data.base| (select |#valid| |freeData_#in~data.base|))) (= 0 (select |#valid| |freeData_#in~data.base|))), 24708#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24709#(and (or (= 0 (select |#valid| |main_#t~mem25.base|)) (= 1 (select (store |#valid| |main_#t~mem25.base| 0) main_~next~0.base)) (not (= |main_#t~mem25.offset| 0)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0)))), 24710#(or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))), 24711#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 24712#(= 1 (select |#valid| |main_#t~mem21.base|)), 24671#true, 24672#false, 24673#(= (select |#valid| 0) 0), 24674#(= (select |old(#valid)| 0) (select |#valid| 0)), 24675#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0))), 24676#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| append_~node~0.base))), 24677#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 24678#(and (= (select |#valid| 0) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24679#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24680#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24681#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#valid| (store |old(#valid)| |append_#t~malloc14.base| (select |#valid| |append_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24682#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24683#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |append_#t~mem16.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24684#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0) (= (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24685#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |old(#valid)| (store |#valid| |create_data_#t~malloc1.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24686#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (store |#valid| create_data_~data~0.base 0) |old(#valid)|)), 24687#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base))) (= (store |#valid| create_data_~data~0.base 0) |old(#valid)|)), 24688#(and (= (store |#valid| |create_data_#res.base| 0) |old(#valid)|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 24689#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#t~ret17.base| append_~node~0.base) (and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |old(#valid)| (store |#valid| |append_#t~ret17.base| 0)) (= 0 (select |old(#valid)| (@diff |old(#valid)| (store |#valid| |append_#t~ret17.base| 0))))) (= (store |old(#valid)| (@diff |old(#valid)| (store |#valid| |append_#t~ret17.base| 0)) (select (store |#valid| |append_#t~ret17.base| 0) (@diff |old(#valid)| (store |#valid| |append_#t~ret17.base| 0)))) (store |#valid| |append_#t~ret17.base| 0)) (= (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0)), 24690#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (store |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) 0) (store |old(#valid)| (@diff |old(#valid)| (store |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) 0)) (select (store |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) 0) (@diff |old(#valid)| (store |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) 0))))) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (or (= (store |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) 0) |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| (store |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) 0)))))) (and (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0)))), 24691#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (and (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (store |old(#valid)| (@diff |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0)) (select (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0) (@diff |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0)))) (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0)) (or (= 0 (select |old(#valid)| (@diff |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0)))) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (select |old(#valid)| 0) (select |#valid| 0)))), 24692#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 24693#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24694#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24695#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))))) (and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= 0 |main_#t~mem21.offset|)) (or (not (= 0 |main_#t~mem21.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24696#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0) |main_#t~mem22.base|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24697#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0) main_~next~0.base))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24698#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0) main_~next~0.base)) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24699#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| |main_#t~mem24.base| 0) main_~next~0.base))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24700#(= |#valid| |old(#valid)|), 24701#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 24702#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 24703#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= freeData_~data.base |freeData_#in~data.base|))] [2018-02-02 20:14:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:14:56,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 20:14:56,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 20:14:56,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:14:56,769 INFO L87 Difference]: Start difference. First operand 274 states and 300 transitions. Second operand 42 states. [2018-02-02 20:14:57,775 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 83 DAG size of output 74 [2018-02-02 20:15:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:00,732 INFO L93 Difference]: Finished difference Result 309 states and 343 transitions. [2018-02-02 20:15:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 20:15:00,733 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2018-02-02 20:15:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:00,734 INFO L225 Difference]: With dead ends: 309 [2018-02-02 20:15:00,734 INFO L226 Difference]: Without dead ends: 309 [2018-02-02 20:15:00,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=786, Invalid=9114, Unknown=0, NotChecked=0, Total=9900 [2018-02-02 20:15:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-02 20:15:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 284. [2018-02-02 20:15:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:15:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 312 transitions. [2018-02-02 20:15:00,737 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 312 transitions. Word has length 84 [2018-02-02 20:15:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:00,737 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 312 transitions. [2018-02-02 20:15:00,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 20:15:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 312 transitions. [2018-02-02 20:15:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:15:00,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:00,739 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-02-02 20:15:00,739 INFO L371 AbstractCegarLoop]: === Iteration 66 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1381540371, now seen corresponding path program 1 times [2018-02-02 20:15:00,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:00,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:15:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:02,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:02,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:15:02,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:02,161 INFO L182 omatonBuilderFactory]: Interpolants [25422#true, 25423#false, 25424#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 25425#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 25426#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 25427#(= |old(#length)| |#length|), 25428#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 25429#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 25430#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25431#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25432#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= (store |old(#length)| |append_#t~malloc14.base| (select |#length| |append_#t~malloc14.base|)) |#length|) (= (select |#length| |append_#t~malloc14.base|) 8) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25433#(and (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.base (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= append_~node~0.base append_~pointerToList.base))), 25434#(and (= append_~node~0.offset 0) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.base (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 25435#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.base (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))))) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 25436#(and (= (select |#length| |create_data_#t~malloc1.base|) 8) (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25437#(and (or (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25438#(and (or (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8))), 25439#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |create_data_#res.base| (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 25440#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) 8) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset))) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~ret17.base| append_~node~0.base)) (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 25441#(and (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) 8) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8))) (= append_~node~0.base append_~pointerToList.base) (and (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 25442#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) 8) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 25443#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 25444#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 25445#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 25446#(and (or (not (= |main_#t~mem21.offset| 0)) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0))), 25447#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 |main_#t~mem22.offset|) (<= 8 (select |#length| |main_#t~mem22.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25448#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25449#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25450#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25451#(= freeData_~data.base |freeData_#in~data.base|), 25452#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)), 25453#(= 0 (select |#valid| |freeData_#in~data.base|)), 25454#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25455#(or (and (not (= |main_#t~mem25.base| 0)) (or (= 0 (select |#valid| |main_#t~mem25.base|)) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (not (= |main_#t~mem25.offset| 0))), 25456#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 25457#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 25458#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|)))] [2018-02-02 20:15:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:02,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 20:15:02,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 20:15:02,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1234, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:15:02,162 INFO L87 Difference]: Start difference. First operand 284 states and 312 transitions. Second operand 37 states. [2018-02-02 20:15:03,405 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 81 DAG size of output 79 [2018-02-02 20:15:03,907 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 87 DAG size of output 86 [2018-02-02 20:15:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:05,676 INFO L93 Difference]: Finished difference Result 352 states and 397 transitions. [2018-02-02 20:15:05,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:15:05,677 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 84 [2018-02-02 20:15:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:05,677 INFO L225 Difference]: With dead ends: 352 [2018-02-02 20:15:05,677 INFO L226 Difference]: Without dead ends: 352 [2018-02-02 20:15:05,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=436, Invalid=4820, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:15:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-02 20:15:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 307. [2018-02-02 20:15:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-02-02 20:15:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 341 transitions. [2018-02-02 20:15:05,680 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 341 transitions. Word has length 84 [2018-02-02 20:15:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:05,680 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 341 transitions. [2018-02-02 20:15:05,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 20:15:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 341 transitions. [2018-02-02 20:15:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:15:05,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:05,681 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-02-02 20:15:05,681 INFO L371 AbstractCegarLoop]: === Iteration 67 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1253326230, now seen corresponding path program 1 times [2018-02-02 20:15:05,681 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:05,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:15:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:06,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:06,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:15:06,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:06,601 INFO L182 omatonBuilderFactory]: Interpolants [26191#true, 26192#false, 26193#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 26194#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 26195#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 26196#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1) (= 8 (select |#length| append_~node~0.base))), 26197#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 26198#(and (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 26199#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 26200#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 26201#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 26202#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26203#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26204#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= (store |old(#length)| |append_#t~malloc14.base| (select |#length| |append_#t~malloc14.base|)) |#length|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26205#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 26206#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |append_#t~mem16.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= append_~node~0.base append_~pointerToList.base))), 26207#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 26208#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26209#(or (and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|)), 26210#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 26211#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26212#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26213#(and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0)) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (not (= |main_#t~mem21.offset| 0)) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 26214#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.offset|) (<= 8 (select |#length| |main_#t~mem22.base|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 26215#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 26216#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (not (= |main_#t~mem25.offset| 0)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26217#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26218#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 26219#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 26220#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|)))] [2018-02-02 20:15:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:06,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:15:06,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:15:06,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:15:06,602 INFO L87 Difference]: Start difference. First operand 307 states and 341 transitions. Second operand 30 states. [2018-02-02 20:15:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:08,401 INFO L93 Difference]: Finished difference Result 353 states and 395 transitions. [2018-02-02 20:15:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:15:08,401 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 78 [2018-02-02 20:15:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:08,402 INFO L225 Difference]: With dead ends: 353 [2018-02-02 20:15:08,402 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 20:15:08,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=309, Invalid=2771, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:15:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 20:15:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 305. [2018-02-02 20:15:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 20:15:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 336 transitions. [2018-02-02 20:15:08,405 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 336 transitions. Word has length 78 [2018-02-02 20:15:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:08,405 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 336 transitions. [2018-02-02 20:15:08,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:15:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 336 transitions. [2018-02-02 20:15:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:15:08,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:08,406 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-02 20:15:08,406 INFO L371 AbstractCegarLoop]: === Iteration 68 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash 514415791, now seen corresponding path program 1 times [2018-02-02 20:15:08,406 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:08,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:15:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:09,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:09,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 20:15:09,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:09,449 INFO L182 omatonBuilderFactory]: Interpolants [26944#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26945#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|)), 26946#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))), 26947#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base)))), 26948#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 26949#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#t~ret17.base| append_~node~0.base) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0)), 26950#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= append_~node~0.offset 0) (or (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4)))))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 26951#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (and (or (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (select |old(#valid)| 0) (select |#valid| 0)))), 26952#(or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 26953#(and (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 26954#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26955#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0)) (or (not (= |main_#t~mem21.offset| 0)) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26956#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 |main_#t~mem22.base|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26957#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0)) (not (= 0 main_~next~0.base)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26958#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 main_~next~0.base)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26959#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| 0) 0)) (not (= 0 main_~next~0.base)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26960#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 26961#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 26962#(and (= (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)) |freeData_#t~mem12.base|) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 26963#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 26964#(and (= 0 |freeData_#t~mem13.base|) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 26965#(or (and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)) (= (select |old(#valid)| 0) 1)), 26966#(or (= (select |old(#valid)| 0) 1) (= 0 (select |#valid| |freeData_#in~data.base|))), 26967#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= 0 main_~next~0.base)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26968#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (or (not (= 1 (select |#valid| |main_#t~mem25.base|))) (not (= 0 main_~next~0.base)) (not (= |main_#t~mem25.offset| 0)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 26969#(or (not (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26970#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 26971#(not (= 0 |main_#t~mem27.base|)), 26932#true, 26933#false, 26934#(= (select |#valid| 0) 0), 26935#(= (select |old(#valid)| 0) (select |#valid| 0)), 26936#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0))), 26937#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= (select |old(#valid)| 0) (select |#valid| 0))), 26938#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base)) (= (select |old(#valid)| 0) (select |#valid| 0))), 26939#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 26940#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= (select |#valid| 0) 0)), 26941#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26942#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26943#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))] [2018-02-02 20:15:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:09,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 20:15:09,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 20:15:09,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1422, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:15:09,450 INFO L87 Difference]: Start difference. First operand 305 states and 336 transitions. Second operand 40 states. [2018-02-02 20:15:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:11,947 INFO L93 Difference]: Finished difference Result 338 states and 376 transitions. [2018-02-02 20:15:11,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 20:15:11,948 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 86 [2018-02-02 20:15:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:11,948 INFO L225 Difference]: With dead ends: 338 [2018-02-02 20:15:11,949 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 20:15:11,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=824, Invalid=6658, Unknown=0, NotChecked=0, Total=7482 [2018-02-02 20:15:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 20:15:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 305. [2018-02-02 20:15:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 20:15:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 334 transitions. [2018-02-02 20:15:11,951 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 334 transitions. Word has length 86 [2018-02-02 20:15:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:11,952 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 334 transitions. [2018-02-02 20:15:11,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 20:15:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 334 transitions. [2018-02-02 20:15:11,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:15:11,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:11,952 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-02-02 20:15:11,952 INFO L371 AbstractCegarLoop]: === Iteration 69 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1202378261, now seen corresponding path program 1 times [2018-02-02 20:15:11,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:11,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:15:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:12,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:12,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:15:12,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:12,760 INFO L182 omatonBuilderFactory]: Interpolants [27712#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 27713#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 27714#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 27715#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 27716#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 27717#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27718#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27719#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 27720#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= append_~node~0.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= append_~node~0.base append_~pointerToList.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 27721#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= append_~node~0.base append_~pointerToList.base))), 27722#(= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|), 27723#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 27724#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= |append_#t~ret17.base| append_~node~0.base))) (= append_~node~0.base append_~pointerToList.base))), 27725#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= append_~node~0.base append_~pointerToList.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 27726#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 27727#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 27728#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27729#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27730#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (or (not (= |main_#t~mem21.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27731#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= 0 |main_#t~mem22.offset|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27732#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27733#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 27734#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27735#(= freeData_~data.base |freeData_#in~data.base|), 27736#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)), 27737#(= 0 (select |#valid| |freeData_#in~data.base|)), 27738#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27739#(and (or (= 0 (select |#valid| |main_#t~mem25.base|)) (= 0 main_~next~0.offset) (not (= |main_#t~mem25.offset| 0)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0)))), 27740#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27741#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 27742#(and (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 27743#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27744#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 8) (select |#length| |main_#t~mem23.base|))), 27709#true, 27710#false, 27711#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))] [2018-02-02 20:15:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:12,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:15:12,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:15:12,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1164, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:15:12,760 INFO L87 Difference]: Start difference. First operand 305 states and 334 transitions. Second operand 36 states. [2018-02-02 20:15:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:15,067 INFO L93 Difference]: Finished difference Result 328 states and 358 transitions. [2018-02-02 20:15:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 20:15:15,067 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 87 [2018-02-02 20:15:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:15,068 INFO L225 Difference]: With dead ends: 328 [2018-02-02 20:15:15,068 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 20:15:15,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=574, Invalid=5588, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 20:15:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 20:15:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 285. [2018-02-02 20:15:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 20:15:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 313 transitions. [2018-02-02 20:15:15,070 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 313 transitions. Word has length 87 [2018-02-02 20:15:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:15,071 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 313 transitions. [2018-02-02 20:15:15,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:15:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 313 transitions. [2018-02-02 20:15:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:15:15,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:15,071 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:15:15,071 INFO L371 AbstractCegarLoop]: === Iteration 70 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1109930390, now seen corresponding path program 1 times [2018-02-02 20:15:15,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:15,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:15:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:15,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:15,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:15:15,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:15,512 INFO L182 omatonBuilderFactory]: Interpolants [28448#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 28449#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 28450#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 28451#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 28452#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 28453#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 28454#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28455#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28456#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28457#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28458#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 28459#(and (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= append_~pointerToList.base append_~node~0.base))), 28460#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 28461#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 28462#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= |main_#t~mem21.offset| 0))), 28463#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 |main_#t~mem22.offset|)), 28464#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 28465#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 28466#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 28467#(or (= 0 (select |#valid| |main_~#list~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 28468#(= |#valid| |old(#valid)|), 28469#(= 0 |main_#t~mem25.offset|), 28446#true, 28447#false] [2018-02-02 20:15:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:15,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:15:15,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:15:15,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:15:15,512 INFO L87 Difference]: Start difference. First operand 285 states and 313 transitions. Second operand 24 states. [2018-02-02 20:15:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:16,436 INFO L93 Difference]: Finished difference Result 331 states and 363 transitions. [2018-02-02 20:15:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:15:16,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 20:15:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:16,437 INFO L225 Difference]: With dead ends: 331 [2018-02-02 20:15:16,437 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 20:15:16,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=2047, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:15:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 20:15:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2018-02-02 20:15:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 20:15:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 348 transitions. [2018-02-02 20:15:16,441 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 348 transitions. Word has length 82 [2018-02-02 20:15:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:16,441 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 348 transitions. [2018-02-02 20:15:16,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:15:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 348 transitions. [2018-02-02 20:15:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:15:16,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:16,442 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:16,442 INFO L371 AbstractCegarLoop]: === Iteration 71 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1674235570, now seen corresponding path program 5 times [2018-02-02 20:15:16,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:16,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:15:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:16,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:16,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:15:16,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:16,494 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:15:16,494 INFO L182 omatonBuilderFactory]: Interpolants [29168#true, 29169#false, 29170#(= create_data_~counter~0 0), 29171#(<= create_data_~counter~0 1), 29172#(<= create_data_~counter~0 2), 29173#(<= create_data_~counter~0 3), 29174#(<= create_data_~counter~0 4), 29175#(<= create_data_~counter~0 5), 29176#(<= create_data_~counter~0 6)] [2018-02-02 20:15:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:16,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:15:16,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:15:16,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:15:16,495 INFO L87 Difference]: Start difference. First operand 315 states and 348 transitions. Second operand 9 states. [2018-02-02 20:15:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:16,516 INFO L93 Difference]: Finished difference Result 327 states and 360 transitions. [2018-02-02 20:15:16,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:15:16,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-02-02 20:15:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:16,517 INFO L225 Difference]: With dead ends: 327 [2018-02-02 20:15:16,517 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 20:15:16,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:15:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 20:15:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2018-02-02 20:15:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 20:15:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 355 transitions. [2018-02-02 20:15:16,520 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 355 transitions. Word has length 75 [2018-02-02 20:15:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:16,520 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 355 transitions. [2018-02-02 20:15:16,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:15:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 355 transitions. [2018-02-02 20:15:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 20:15:16,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:16,521 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:15:16,521 INFO L371 AbstractCegarLoop]: === Iteration 72 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:16,521 INFO L82 PathProgramCache]: Analyzing trace with hash -726087336, now seen corresponding path program 1 times [2018-02-02 20:15:16,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:16,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:15:17,592 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 73 DAG size of output 64 [2018-02-02 20:15:17,778 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-02-02 20:15:18,244 WARN L146 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 94 DAG size of output 87 [2018-02-02 20:15:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:19,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:19,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-02 20:15:19,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:19,748 INFO L182 omatonBuilderFactory]: Interpolants [29826#true, 29827#false, 29828#(= (select |#valid| 0) 0), 29829#(and (= (select |#valid| 0) 0) (= (select |#valid| |main_~#list~0.base|) 1)), 29830#(= |#valid| |old(#valid)|), 29831#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 29832#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= (select |old(#valid)| 0) (select |#valid| 0))), 29833#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 0 (select |old(#valid)| append_~node~0.base)) (= (select |old(#valid)| 0) (select |#valid| 0))), 29834#(= (select |old(#valid)| 0) (select |#valid| 0)), 29835#(and (= 0 |create_data_#res.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |create_data_#res.offset|)), 29836#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (and (= 0 (select |old(#valid)| append_~node~0.base)) (= 0 |append_#t~ret17.offset|) (= 0 |append_#t~ret17.base|)) (= append_~pointerToList.base append_~node~0.base)) (= (select |old(#valid)| 0) (select |#valid| 0))), 29837#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select |old(#valid)| 0) (select |#valid| 0)) (or (= append_~pointerToList.base append_~node~0.base) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= 1 (select |#valid| append_~node~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) 0))))), 29838#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 29839#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))), 29840#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29841#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29842#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#valid| (store |old(#valid)| |append_#t~malloc14.base| (select |#valid| |append_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29843#(and (= 0 append_~node~0.offset) (= (select |old(#valid)| 0) (select |#valid| 0)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))))), 29844#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 29845#(and (= 0 append_~node~0.offset) (= (select |old(#valid)| 0) (select |#valid| 0)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= append_~node~0.base append_~pointerToList.base))), 29846#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29847#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29848#(and (= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base)))), 29849#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 29850#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (= (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))))) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~ret17.base| append_~node~0.base)) (= append_~node~0.base append_~pointerToList.base)) (= (select |old(#valid)| 0) (select |#valid| 0)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 29851#(and (= 0 append_~node~0.offset) (= (select |old(#valid)| 0) (select |#valid| 0)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))))))), 29852#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (or (and (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |append_#in~pointerToList.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 29853#(and (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select |#valid| 0))), 29854#(and (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |#valid| 0))), 29855#(and (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select |#valid| 0))), 29856#(and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0)) (or (not (= |main_#t~mem21.offset| 0)) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select |#valid| 0))))), 29857#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= 0 (select |#valid| 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) 0)) (not (= |main_~#list~0.base| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) 0))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem22.base|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29858#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select |#valid| 0))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29859#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select |#valid| 0))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29860#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select |#valid| 0))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29861#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 29862#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 29863#(and (= (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)) |freeData_#t~mem12.base|) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 29864#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 29865#(and (= 0 |freeData_#t~mem13.base|) (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= freeData_~data.base |freeData_#in~data.base|)), 29866#(or (and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)) (= (select |old(#valid)| 0) 1)), 29867#(or (= (select |old(#valid)| 0) 1) (= 0 (select |#valid| |freeData_#in~data.base|))), 29868#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29869#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (or (= 0 (select |#valid| |main_#t~mem25.base|)) (not (= 0 |main_#t~mem25.offset|)) (and (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29870#(or (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (and (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 29871#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29872#(or (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)))), 29873#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29874#(or (not (= 1 (select |#valid| |main_#t~mem21.base|))) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 29875#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 29876#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 29877#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 29878#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 29879#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0))] [2018-02-02 20:15:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:15:19,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 20:15:19,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 20:15:19,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:15:19,749 INFO L87 Difference]: Start difference. First operand 322 states and 355 transitions. Second operand 54 states. [2018-02-02 20:15:21,630 WARN L143 SmtUtils]: Spent 246ms on a formula simplification that was a NOOP. DAG size: 136 [2018-02-02 20:15:22,196 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 71 DAG size of output 71 [2018-02-02 20:15:22,490 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 90 DAG size of output 89 [2018-02-02 20:15:22,680 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 76 DAG size of output 76 [2018-02-02 20:15:23,066 WARN L143 SmtUtils]: Spent 184ms on a formula simplification that was a NOOP. DAG size: 102 [2018-02-02 20:15:26,282 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 81 DAG size of output 75 [2018-02-02 20:15:26,589 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 83 DAG size of output 78 [2018-02-02 20:15:28,341 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 85 DAG size of output 78 [2018-02-02 20:15:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:28,723 INFO L93 Difference]: Finished difference Result 367 states and 407 transitions. [2018-02-02 20:15:28,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 20:15:28,724 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 91 [2018-02-02 20:15:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:28,725 INFO L225 Difference]: With dead ends: 367 [2018-02-02 20:15:28,725 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 20:15:28,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3415 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=898, Invalid=12212, Unknown=0, NotChecked=0, Total=13110 [2018-02-02 20:15:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 20:15:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 351. [2018-02-02 20:15:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 20:15:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 386 transitions. [2018-02-02 20:15:28,728 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 386 transitions. Word has length 91 [2018-02-02 20:15:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:28,729 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 386 transitions. [2018-02-02 20:15:28,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 20:15:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 386 transitions. [2018-02-02 20:15:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:15:28,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:28,729 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:15:28,729 INFO L371 AbstractCegarLoop]: === Iteration 73 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1491213077, now seen corresponding path program 1 times [2018-02-02 20:15:28,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:28,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:15:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:15:28,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:15:28,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:15:28,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:15:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:15:28,881 INFO L182 omatonBuilderFactory]: Interpolants [30720#true, 30721#false, 30722#(= |main_~#list~0.offset| 0), 30723#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) 0))), 30724#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) 0) 0)))), 30725#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) 0) 0)))), 30726#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (not (= |main_#t~mem24.base| 0)) (not (= (select |#memory_$Pointer$.base| |main_~#list~0.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))))), 30727#(= freeData_~data.base |freeData_#in~data.base|), 30728#(= 0 |freeData_#in~data.base|), 30729#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select |#memory_$Pointer$.base| |main_~#list~0.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))))), 30730#(or (not (= 0 |main_#t~mem25.offset|)) (and (not (= |main_#t~mem25.base| 0)) (not (= |main_~#list~0.base| |main_#t~mem25.base|)) (= 1 (select |#valid| |main_~#list~0.base|)))), 30731#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 20:15:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:15:28,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:15:28,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:15:28,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:15:28,881 INFO L87 Difference]: Start difference. First operand 351 states and 386 transitions. Second operand 12 states. [2018-02-02 20:15:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:15:29,288 INFO L93 Difference]: Finished difference Result 354 states and 388 transitions. [2018-02-02 20:15:29,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:15:29,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2018-02-02 20:15:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:15:29,289 INFO L225 Difference]: With dead ends: 354 [2018-02-02 20:15:29,289 INFO L226 Difference]: Without dead ends: 354 [2018-02-02 20:15:29,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:15:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-02 20:15:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2018-02-02 20:15:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 20:15:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 383 transitions. [2018-02-02 20:15:29,295 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 383 transitions. Word has length 84 [2018-02-02 20:15:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:15:29,295 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 383 transitions. [2018-02-02 20:15:29,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:15:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 383 transitions. [2018-02-02 20:15:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:15:29,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:15:29,296 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:15:29,296 INFO L371 AbstractCegarLoop]: === Iteration 74 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:15:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1315095669, now seen corresponding path program 1 times [2018-02-02 20:15:29,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:15:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:15:29,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:15:29,386 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 20:15:29,388 INFO L168 Benchmark]: Toolchain (without parser) took 72375.79 ms. Allocated memory was 404.8 MB in the beginning and 1.4 GB in the end (delta: 995.6 MB). Free memory was 361.4 MB in the beginning and 599.2 MB in the end (delta: -237.7 MB). Peak memory consumption was 757.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:15:29,389 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 404.8 MB. Free memory is still 368.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:15:29,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.03 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:15:29,390 INFO L168 Benchmark]: Boogie Preprocessor took 22.28 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:15:29,390 INFO L168 Benchmark]: RCFGBuilder took 354.33 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 314.9 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:15:29,390 INFO L168 Benchmark]: TraceAbstraction took 71843.48 ms. Allocated memory was 404.8 MB in the beginning and 1.4 GB in the end (delta: 995.6 MB). Free memory was 314.9 MB in the beginning and 599.2 MB in the end (delta: -284.3 MB). Peak memory consumption was 711.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:15:29,391 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.17 ms. Allocated memory is still 404.8 MB. Free memory is still 368.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.03 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.28 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 354.33 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 314.9 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71843.48 ms. Allocated memory was 404.8 MB in the beginning and 1.4 GB in the end (delta: 995.6 MB). Free memory was 314.9 MB in the beginning and 599.2 MB in the end (delta: -284.3 MB). Peak memory consumption was 711.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-15-29-397.csv Completed graceful shutdown