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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:05:51,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:05:51,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:05:51,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:05:51,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:05:51,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:05:51,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:05:51,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:05:51,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:05:51,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:05:51,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:05:51,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:05:51,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:05:51,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:05:51,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:05:51,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:05:51,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:05:51,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:05:51,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:05:51,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:05:51,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:05:51,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:05:51,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:05:51,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:05:51,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:05:51,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:05:51,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:05:51,049 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:05:51,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:05:51,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:05:51,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:05:51,050 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:05:51,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:05:51,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:05:51,060 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:05:51,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:05:51,060 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:05:51,060 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:05:51,060 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:05:51,060 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:05:51,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:05:51,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:05:51,062 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:05:51,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:05:51,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:05:51,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:05:51,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:05:51,097 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:05:51,099 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:05:51,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:05:51,101 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:05:51,101 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_true-valid-memsafety.i [2018-02-02 10:05:51,221 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:05:51,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:05:51,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:05:51,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:05:51,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:05:51,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3938e7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51, skipping insertion in model container [2018-02-02 10:05:51,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,241 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:05:51,270 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:05:51,361 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:05:51,379 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:05:51,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51 WrapperNode [2018-02-02 10:05:51,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:05:51,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:05:51,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:05:51,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:05:51,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (1/1) ... [2018-02-02 10:05:51,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:05:51,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:05:51,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:05:51,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:05:51,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (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 10:05:51,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:05:51,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:05:51,456 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 10:05:51,457 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 10:05:51,457 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 10:05:51,457 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:05:51,457 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:05:51,457 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:05:51,457 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:05:51,457 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 10:05:51,458 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 10:05:51,459 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:05:51,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:05:51,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:05:51,795 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:05:51,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:05:51 BoogieIcfgContainer [2018-02-02 10:05:51,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:05:51,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:05:51,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:05:51,798 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:05:51,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:05:51" (1/3) ... [2018-02-02 10:05:51,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2530da7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:05:51, skipping insertion in model container [2018-02-02 10:05:51,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:51" (2/3) ... [2018-02-02 10:05:51,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2530da7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:05:51, skipping insertion in model container [2018-02-02 10:05:51,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:05:51" (3/3) ... [2018-02-02 10:05:51,800 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-02-02 10:05:51,806 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:05:51,811 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-02 10:05:51,834 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:05:51,834 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:05:51,834 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:05:51,834 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:05:51,834 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:05:51,834 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:05:51,834 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:05:51,834 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:05:51,835 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:05:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-02-02 10:05:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:05:51,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:51,851 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:51,851 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 10:05:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash -548983798, now seen corresponding path program 1 times [2018-02-02 10:05:51,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:51,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:51,957 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 10:05:51,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:51,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:05:51,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:51,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 10:05:51,961 INFO L182 omatonBuilderFactory]: Interpolants [124#true, 125#false, 126#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 10:05:51,961 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 10:05:51,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:05:51,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:05:51,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:51,972 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2018-02-02 10:05:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:52,166 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-02 10:05:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:05:52,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:05:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:52,177 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:05:52,177 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:05:52,179 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 10:05:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:05:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-02 10:05:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:05:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 10:05:52,208 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2018-02-02 10:05:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:52,208 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 10:05:52,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:05:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 10:05:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:05:52,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:52,209 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:52,209 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 10:05:52,209 INFO L82 PathProgramCache]: Analyzing trace with hash -548983797, now seen corresponding path program 1 times [2018-02-02 10:05:52,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:52,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:52,255 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 10:05:52,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:52,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:05:52,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:52,255 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 10:05:52,256 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 10:05:52,256 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 10:05:52,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:05:52,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:05:52,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:52,257 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 3 states. [2018-02-02 10:05:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:52,317 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-02-02 10:05:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:05:52,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:05:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:52,319 INFO L225 Difference]: With dead ends: 118 [2018-02-02 10:05:52,319 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 10:05:52,320 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 10:05:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 10:05:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-02-02 10:05:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:05:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-02 10:05:52,327 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2018-02-02 10:05:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:52,327 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-02 10:05:52,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:05:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-02 10:05:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:05:52,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:52,328 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:52,328 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 10:05:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977305, now seen corresponding path program 1 times [2018-02-02 10:05:52,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:52,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:52,388 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 10:05:52,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:52,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:52,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:52,389 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 10:05:52,389 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 10:05:52,389 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 10:05:52,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:52,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:52,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:52,390 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-02-02 10:05:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:52,592 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 10:05:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:52,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:05:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:52,594 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:05:52,594 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:05:52,594 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 10:05:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:05:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-02-02 10:05:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:05:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-02 10:05:52,600 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 14 [2018-02-02 10:05:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:52,600 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-02 10:05:52,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-02 10:05:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:05:52,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:52,601 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:52,601 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 10:05:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977306, now seen corresponding path program 1 times [2018-02-02 10:05:52,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:52,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:52,682 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 10:05:52,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:52,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:05:52,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:52,684 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 10:05:52,684 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 10:05:52,684 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 10:05:52,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:52,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:52,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:52,685 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-02 10:05:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:52,894 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-02 10:05:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:52,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 10:05:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:52,896 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:05:52,896 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:05:52,896 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 10:05:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:05:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-02 10:05:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:05:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-02 10:05:52,903 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2018-02-02 10:05:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:52,904 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-02 10:05:52,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-02 10:05:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:05:52,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:52,904 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:52,904 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 10:05:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash 150721727, now seen corresponding path program 1 times [2018-02-02 10:05:52,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:52,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:52,938 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 10:05:52,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:52,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:52,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:52,939 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 10:05:52,939 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 10:05:52,939 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 10:05:52,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:52,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:52,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:52,940 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2018-02-02 10:05:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:53,010 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 10:05:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:53,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:05:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:53,011 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:05:53,011 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:05:53,011 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 10:05:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:05:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-02 10:05:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:05:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-02 10:05:53,016 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 15 [2018-02-02 10:05:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:53,017 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-02 10:05:53,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-02 10:05:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:05:53,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:53,017 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:53,017 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 10:05:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 150721728, now seen corresponding path program 1 times [2018-02-02 10:05:53,018 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:53,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:53,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:53,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:53,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:53,083 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 10:05:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:53,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:53,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:53,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:53,084 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2018-02-02 10:05:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:53,132 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-02 10:05:53,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:53,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:05:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:53,133 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:05:53,133 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:05:53,133 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 10:05:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:05:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 10:05:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:05:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 10:05:53,137 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 15 [2018-02-02 10:05:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:53,138 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 10:05:53,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 10:05:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:05:53,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:53,138 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 10:05:53,139 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 10:05:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099981, now seen corresponding path program 1 times [2018-02-02 10:05:53,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:53,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:53,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 10:05:53,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:53,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:53,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:53,196 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 10:05:53,196 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 10:05:53,196 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 10:05:53,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:53,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:53,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:53,197 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2018-02-02 10:05:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:53,328 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-02-02 10:05:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:53,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 10:05:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:53,330 INFO L225 Difference]: With dead ends: 135 [2018-02-02 10:05:53,330 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 10:05:53,330 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 10:05:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 10:05:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-02-02 10:05:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:05:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-02 10:05:53,336 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2018-02-02 10:05:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:53,336 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-02 10:05:53,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-02 10:05:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:05:53,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:53,337 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 10:05:53,337 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 10:05:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099982, now seen corresponding path program 1 times [2018-02-02 10:05:53,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:53,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:53,384 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 10:05:53,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:53,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:53,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:53,384 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 10:05:53,384 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 10:05:53,385 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 10:05:53,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:53,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:53,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:53,385 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 5 states. [2018-02-02 10:05:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:53,490 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-02 10:05:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:53,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 10:05:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:53,491 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:05:53,491 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:05:53,491 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 10:05:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:05:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-02-02 10:05:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:05:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 10:05:53,494 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 22 [2018-02-02 10:05:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:53,494 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 10:05:53,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 10:05:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:05:53,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:53,495 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 10:05:53,495 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 10:05:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 4873111, now seen corresponding path program 1 times [2018-02-02 10:05:53,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:53,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:53,517 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 10:05:53,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:53,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:53,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:53,518 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 10:05:53,518 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 10:05:53,518 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 10:05:53,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:53,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:53,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:53,519 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 4 states. [2018-02-02 10:05:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:53,573 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 10:05:53,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:53,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 10:05:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:53,574 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:05:53,574 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:05:53,574 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 10:05:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:05:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 10:05:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:05:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 10:05:53,577 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 23 [2018-02-02 10:05:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:53,577 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 10:05:53,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 10:05:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:05:53,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:53,578 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 10:05:53,578 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 10:05:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash 4873112, now seen corresponding path program 1 times [2018-02-02 10:05:53,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:53,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:53,616 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 10:05:53,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:53,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:53,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:53,617 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 10:05:53,618 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 10:05:53,618 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 10:05:53,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:53,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:53,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:53,618 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-02 10:05:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:53,668 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-02-02 10:05:53,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:53,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 10:05:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:53,669 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:05:53,669 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:05:53,669 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 10:05:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:05:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-02-02 10:05:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:05:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 10:05:53,672 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 23 [2018-02-02 10:05:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:53,672 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 10:05:53,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 10:05:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:05:53,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:53,673 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 10:05:53,673 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 10:05:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 167210254, now seen corresponding path program 1 times [2018-02-02 10:05:53,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:53,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:53,706 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 10:05:53,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:53,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:53,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:53,707 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 10:05:53,707 INFO L182 omatonBuilderFactory]: Interpolants [2631#true, 2632#false, 2633#(= 1 (select |#valid| append_~pointerToList.base)), 2634#(= |#valid| |old(#valid)|)] [2018-02-02 10:05:53,708 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 10:05:53,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:53,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:53,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:53,708 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 4 states. [2018-02-02 10:05:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:53,793 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-02-02 10:05:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:53,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-02-02 10:05:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:53,795 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:05:53,795 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:05:53,795 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 10:05:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:05:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-02-02 10:05:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:05:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-02 10:05:53,798 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 24 [2018-02-02 10:05:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:53,801 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-02 10:05:53,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-02 10:05:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:05:53,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:53,802 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 10:05:53,802 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 10:05:53,803 INFO L82 PathProgramCache]: Analyzing trace with hash 167210255, now seen corresponding path program 1 times [2018-02-02 10:05:53,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:53,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:53,866 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 10:05:53,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:53,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:05:53,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:53,867 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 10:05:53,867 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 10:05:53,868 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 10:05:53,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:53,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:53,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:53,868 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-02 10:05:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:54,064 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-02-02 10:05:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:05:54,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 10:05:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:54,065 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:05:54,065 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:05:54,066 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 10:05:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:05:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-02 10:05:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:05:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-02 10:05:54,069 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2018-02-02 10:05:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:54,069 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-02 10:05:54,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-02 10:05:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:05:54,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:54,070 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 10:05:54,070 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 10:05:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash 151037655, now seen corresponding path program 1 times [2018-02-02 10:05:54,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:54,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:54,193 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 10:05:54,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:54,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:54,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:54,194 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 10:05:54,194 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 10:05:54,194 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 10:05:54,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:54,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:54,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:54,195 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 5 states. [2018-02-02 10:05:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:54,318 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 10:05:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:54,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 10:05:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:54,320 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:05:54,320 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:05:54,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:05:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:05:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-02 10:05:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:05:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-02 10:05:54,323 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-02-02 10:05:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:54,324 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-02 10:05:54,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-02 10:05:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:05:54,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:54,325 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 10:05:54,325 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 10:05:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005000, now seen corresponding path program 1 times [2018-02-02 10:05:54,326 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:54,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:54,400 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 10:05:54,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:54,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:05:54,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:54,401 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 10:05:54,401 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 10:05:54,401 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 10:05:54,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:54,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:54,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:54,402 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 7 states. [2018-02-02 10:05:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:54,616 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-02 10:05:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:05:54,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 10:05:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:54,617 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:05:54,617 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:05:54,618 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 10:05:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:05:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 10:05:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:05:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-02 10:05:54,621 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 29 [2018-02-02 10:05:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:54,621 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-02 10:05:54,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-02 10:05:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:05:54,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:54,622 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 10:05:54,622 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 10:05:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005001, now seen corresponding path program 1 times [2018-02-02 10:05:54,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:54,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:54,715 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 10:05:54,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:54,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:05:54,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:54,716 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 10:05:54,716 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 10:05:54,716 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 10:05:54,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:54,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:54,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:54,717 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2018-02-02 10:05:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:54,951 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-02 10:05:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:54,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 10:05:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:54,953 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:05:54,953 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:05:54,953 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 10:05:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:05:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 10:05:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:05:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 10:05:54,956 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 29 [2018-02-02 10:05:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:54,957 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 10:05:54,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 10:05:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:05:54,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:54,958 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 10:05:54,958 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 10:05:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344885, now seen corresponding path program 1 times [2018-02-02 10:05:54,959 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:54,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:54,989 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 10:05:54,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:54,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:54,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:54,990 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 10:05:54,990 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 10:05:54,990 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 10:05:54,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:54,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:54,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:54,991 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-02-02 10:05:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:55,091 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 10:05:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:55,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 10:05:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:55,092 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:05:55,092 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:05:55,093 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 10:05:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:05:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 10:05:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:05:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-02 10:05:55,096 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-02-02 10:05:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:55,096 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-02 10:05:55,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-02 10:05:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:05:55,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:55,097 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 10:05:55,097 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 10:05:55,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344886, now seen corresponding path program 1 times [2018-02-02 10:05:55,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:55,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:55,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:55,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:05:55,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:55,170 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 10:05:55,170 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 10:05:55,170 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 10:05:55,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:05:55,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:05:55,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:05:55,171 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-02 10:05:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:55,304 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 10:05:55,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:55,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:05:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:55,305 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:05:55,306 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:05:55,306 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 10:05:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:05:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-02-02 10:05:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:05:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 10:05:55,308 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2018-02-02 10:05:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:55,308 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 10:05:55,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:05:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 10:05:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:05:55,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:55,309 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 10:05:55,309 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 10:05:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765284, now seen corresponding path program 1 times [2018-02-02 10:05:55,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:55,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:55,345 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 10:05:55,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:55,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:55,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:55,346 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 10:05:55,346 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 10:05:55,346 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 10:05:55,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:55,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:55,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:55,346 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2018-02-02 10:05:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:55,468 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-02 10:05:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:55,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 10:05:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:55,474 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:05:55,474 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:05:55,474 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 10:05:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:05:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-02-02 10:05:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:05:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 10:05:55,477 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 30 [2018-02-02 10:05:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:55,477 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 10:05:55,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 10:05:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:05:55,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:55,478 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 10:05:55,478 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 10:05:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765283, now seen corresponding path program 1 times [2018-02-02 10:05:55,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:55,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:55,541 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 10:05:55,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:55,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:05:55,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:55,542 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 10:05:55,542 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 10:05:55,542 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 10:05:55,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:05:55,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:05:55,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:05:55,543 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2018-02-02 10:05:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:55,661 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 10:05:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:55,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:05:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:55,662 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:05:55,662 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:05:55,662 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 10:05:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:05:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-02 10:05:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:05:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 10:05:55,665 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-02-02 10:05:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:55,665 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 10:05:55,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:05:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 10:05:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:05:55,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:55,666 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 10:05:55,666 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 10:05:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 660985097, now seen corresponding path program 1 times [2018-02-02 10:05:55,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:55,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:55,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:55,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:05:55,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:55,737 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 10:05:55,737 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 10:05:55,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:05:55,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:05:55,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:05:55,737 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2018-02-02 10:05:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:55,991 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-02 10:05:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:05:55,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 10:05:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:55,992 INFO L225 Difference]: With dead ends: 134 [2018-02-02 10:05:55,992 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:05:55,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:05:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-02-02 10:05:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:05:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-02 10:05:55,996 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 31 [2018-02-02 10:05:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:55,996 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-02 10:05:55,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:05:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-02 10:05:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:05:55,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:55,997 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 10:05:55,997 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 10:05:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash 660985098, now seen corresponding path program 1 times [2018-02-02 10:05:55,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:56,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:56,089 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 10:05:56,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:56,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:05:56,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:56,090 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 10:05:56,090 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 10:05:56,090 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 10:05:56,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:05:56,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:05:56,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:05:56,091 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 10 states. [2018-02-02 10:05:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:56,372 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-02 10:05:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:05:56,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 10:05:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:56,387 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:05:56,388 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:05:56,388 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 10:05:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:05:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-02-02 10:05:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:05:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-02 10:05:56,391 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 31 [2018-02-02 10:05:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:56,391 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-02 10:05:56,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:05:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-02 10:05:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:05:56,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:56,391 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 10:05:56,391 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 10:05:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash -184722078, now seen corresponding path program 1 times [2018-02-02 10:05:56,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:56,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:56,496 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 10:05:56,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:56,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:05:56,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:56,497 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 10:05:56,497 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 10:05:56,498 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 10:05:56,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:56,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:56,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:56,498 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 9 states. [2018-02-02 10:05:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:56,660 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 10:05:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:05:56,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 10:05:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:56,662 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:05:56,662 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:05:56,662 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 10:05:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:05:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-02-02 10:05:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:05:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-02 10:05:56,665 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 34 [2018-02-02 10:05:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:56,665 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-02 10:05:56,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-02 10:05:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:05:56,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:56,666 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 10:05:56,666 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 10:05:56,666 INFO L82 PathProgramCache]: Analyzing trace with hash 501156800, now seen corresponding path program 1 times [2018-02-02 10:05:56,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:56,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:56,727 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 10:05:56,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:56,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:05:56,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:56,728 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 10:05:56,728 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 10:05:56,728 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 10:05:56,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:56,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:56,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:56,729 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 7 states. [2018-02-02 10:05:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:56,842 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-02 10:05:56,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:05:56,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-02 10:05:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:56,843 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:05:56,843 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:05:56,843 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 10:05:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:05:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-02-02 10:05:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:05:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-02 10:05:56,845 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 33 [2018-02-02 10:05:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:56,845 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-02 10:05:56,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-02 10:05:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:05:56,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:56,845 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 10:05:56,845 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 10:05:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash 501156801, now seen corresponding path program 1 times [2018-02-02 10:05:56,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:56,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:56,929 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 10:05:56,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:56,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:05:56,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:56,930 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 10:05:56,930 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 10:05:56,930 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 10:05:56,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:56,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:56,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:56,930 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 9 states. [2018-02-02 10:05:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:57,149 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-02-02 10:05:57,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:05:57,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 10:05:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:57,151 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:05:57,151 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:05:57,151 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 10:05:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:05:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2018-02-02 10:05:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:05:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-02-02 10:05:57,155 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 33 [2018-02-02 10:05:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:57,155 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-02-02 10:05:57,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-02-02 10:05:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:05:57,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:57,156 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 10:05:57,156 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 10:05:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash 574362333, now seen corresponding path program 1 times [2018-02-02 10:05:57,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:57,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:57,215 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 10:05:57,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:57,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:05:57,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:57,215 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 10:05:57,215 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 10:05:57,215 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 10:05:57,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:05:57,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:05:57,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:05:57,216 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 8 states. [2018-02-02 10:05:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:57,308 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-02-02 10:05:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:05:57,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-02 10:05:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:57,309 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:05:57,309 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:05:57,309 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 10:05:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:05:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2018-02-02 10:05:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:05:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-02-02 10:05:57,312 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 35 [2018-02-02 10:05:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:57,312 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-02-02 10:05:57,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:05:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-02-02 10:05:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:05:57,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:57,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, 1, 1, 1] [2018-02-02 10:05:57,313 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 10:05:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash 655964540, now seen corresponding path program 1 times [2018-02-02 10:05:57,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:57,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:57,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 10:05:57,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:57,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:57,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:57,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 10:05:57,348 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 10:05:57,349 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 10:05:57,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:57,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:57,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:57,349 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states. [2018-02-02 10:05:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:57,438 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-02 10:05:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:57,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-02 10:05:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:57,440 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:05:57,440 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:05:57,440 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 10:05:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:05:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 10:05:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:05:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-02-02 10:05:57,442 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 36 [2018-02-02 10:05:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:57,443 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-02-02 10:05:57,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-02-02 10:05:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:05:57,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:57,443 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 10:05:57,443 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 10:05:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash 655964541, now seen corresponding path program 1 times [2018-02-02 10:05:57,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:57,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:57,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 10:05:57,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:57,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:05:57,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:57,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 10:05:57,589 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 10:05:57,589 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 10:05:57,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:05:57,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:05:57,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:05:57,589 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 10 states. [2018-02-02 10:05:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:57,862 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-02-02 10:05:57,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:05:57,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 10:05:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:57,863 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:05:57,863 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:05:57,863 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 10:05:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:05:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2018-02-02 10:05:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:05:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-02-02 10:05:57,865 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 36 [2018-02-02 10:05:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:57,865 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-02-02 10:05:57,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:05:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-02-02 10:05:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:05:57,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:57,866 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 10:05:57,866 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 10:05:57,866 INFO L82 PathProgramCache]: Analyzing trace with hash -747720392, now seen corresponding path program 1 times [2018-02-02 10:05:57,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:57,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:57,919 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 10:05:57,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:57,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:05:57,919 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:57,919 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 10:05:57,919 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 10:05:57,919 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 10:05:57,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:57,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:57,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:57,920 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 9 states. [2018-02-02 10:05:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:58,151 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 10:05:58,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:58,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-02-02 10:05:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:58,152 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:05:58,152 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:05:58,152 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 10:05:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:05:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-02 10:05:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:05:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-02-02 10:05:58,154 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 37 [2018-02-02 10:05:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:58,154 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-02-02 10:05:58,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-02-02 10:05:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:05:58,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:58,154 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 10:05:58,154 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 10:05:58,155 INFO L82 PathProgramCache]: Analyzing trace with hash -747720391, now seen corresponding path program 1 times [2018-02-02 10:05:58,155 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:58,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:58,303 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 10:05:58,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:58,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:05:58,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:58,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 10:05:58,303 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 10:05:58,303 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 10:05:58,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:05:58,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:05:58,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:58,304 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 11 states. [2018-02-02 10:05:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:58,526 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-02-02 10:05:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:05:58,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-02 10:05:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:58,527 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:05:58,527 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:05:58,527 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 10:05:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:05:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-02-02 10:05:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:05:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-02-02 10:05:58,529 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 37 [2018-02-02 10:05:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:58,529 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-02-02 10:05:58,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:05:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-02-02 10:05:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:05:58,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:58,530 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 10:05:58,530 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 10:05:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 484884458, now seen corresponding path program 1 times [2018-02-02 10:05:58,530 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:58,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:58,733 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 10:05:58,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:58,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:05:58,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:58,734 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 10:05:58,735 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 10:05:58,735 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 10:05:58,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:05:58,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:05:58,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:05:58,736 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 17 states. [2018-02-02 10:05:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:59,607 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2018-02-02 10:05:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:05:59,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-02 10:05:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:59,608 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:05:59,609 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:05:59,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:05:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:05:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-02 10:05:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:05:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-02-02 10:05:59,622 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 40 [2018-02-02 10:05:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:59,623 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-02-02 10:05:59,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:05:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-02-02 10:05:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:05:59,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:59,624 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 10:05:59,624 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 10:05:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1287024166, now seen corresponding path program 1 times [2018-02-02 10:05:59,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:59,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:59,767 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 10:05:59,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:59,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:05:59,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:59,768 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 10:05:59,768 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 10:05:59,768 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 10:05:59,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:05:59,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:05:59,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:05:59,769 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 12 states. [2018-02-02 10:06:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:00,230 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2018-02-02 10:06:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:06:00,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 10:06:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:00,231 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:06:00,231 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:06:00,232 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 10:06:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:06:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 155. [2018-02-02 10:06:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:06:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2018-02-02 10:06:00,239 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 40 [2018-02-02 10:06:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:00,239 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2018-02-02 10:06:00,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:06:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2018-02-02 10:06:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:06:00,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:00,240 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 10:06:00,240 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 10:06:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash 268633466, now seen corresponding path program 1 times [2018-02-02 10:06:00,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:00,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:00,262 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 10:06:00,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:00,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:06:00,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:00,262 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 10:06:00,263 INFO L182 omatonBuilderFactory]: Interpolants [8454#true, 8455#false, 8456#(= create_data_~counter~0 0), 8457#(<= create_data_~counter~0 1)] [2018-02-02 10:06:00,263 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 10:06:00,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:06:00,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:06:00,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:06:00,263 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 4 states. [2018-02-02 10:06:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:00,285 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-02-02 10:06:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:06:00,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-02 10:06:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:00,289 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:06:00,289 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:06:00,289 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 10:06:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:06:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-02-02 10:06:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:06:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2018-02-02 10:06:00,294 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 60 [2018-02-02 10:06:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:00,295 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2018-02-02 10:06:00,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:06:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2018-02-02 10:06:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:06:00,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:00,295 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 10:06:00,296 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 10:06:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash -907645030, now seen corresponding path program 1 times [2018-02-02 10:06:00,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:00,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:00,354 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 10:06:00,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:00,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:06:00,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:00,354 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 10:06:00,355 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 10:06:00,355 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 10:06:00,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:06:00,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:06:00,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:06:00,355 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand 8 states. [2018-02-02 10:06:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:00,478 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2018-02-02 10:06:00,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:06:00,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-02-02 10:06:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:00,479 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:06:00,479 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:06:00,480 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 10:06:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:06:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2018-02-02 10:06:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:06:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2018-02-02 10:06:00,483 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 44 [2018-02-02 10:06:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:00,483 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2018-02-02 10:06:00,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:06:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2018-02-02 10:06:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:06:00,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:06:00,484 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 10:06:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash -907645029, now seen corresponding path program 1 times [2018-02-02 10:06:00,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:00,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:00,519 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 10:06:00,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:00,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:06:00,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:00,520 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 10:06:00,520 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 10:06:00,520 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 10:06:00,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:06:00,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:06:00,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:06:00,521 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand 6 states. [2018-02-02 10:06:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:00,648 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2018-02-02 10:06:00,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:06:00,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 10:06:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:00,649 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:06:00,650 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:06:00,650 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 10:06:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:06:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-02-02 10:06:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 10:06:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2018-02-02 10:06:00,654 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 44 [2018-02-02 10:06:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:00,654 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2018-02-02 10:06:00,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:06:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2018-02-02 10:06:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:06:00,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:00,655 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 10:06:00,655 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 10:06:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash 563904760, now seen corresponding path program 1 times [2018-02-02 10:06:00,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:00,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:00,755 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 10:06:00,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:00,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:06:00,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:00,756 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 10:06:00,756 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 10:06:00,756 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 10:06:00,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:06:00,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:06:00,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:06:00,757 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand 10 states. [2018-02-02 10:06:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:00,980 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2018-02-02 10:06:00,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:06:00,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-02-02 10:06:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:00,981 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:06:00,981 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:06:00,982 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 10:06:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:06:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2018-02-02 10:06:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:06:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2018-02-02 10:06:00,986 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 43 [2018-02-02 10:06:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:00,986 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2018-02-02 10:06:00,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:06:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2018-02-02 10:06:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:06:00,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:00,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] [2018-02-02 10:06:00,987 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 10:06:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash -368510437, now seen corresponding path program 1 times [2018-02-02 10:06:00,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:00,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:01,112 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 10:06:01,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:01,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:06:01,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:01,112 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 10:06:01,113 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 10:06:01,113 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 10:06:01,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:06:01,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:06:01,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:06:01,113 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand 12 states. [2018-02-02 10:06:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:01,400 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2018-02-02 10:06:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:06:01,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-02-02 10:06:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:01,401 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:06:01,401 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:06:01,401 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 10:06:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:06:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2018-02-02 10:06:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 10:06:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-02-02 10:06:01,405 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 46 [2018-02-02 10:06:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:01,405 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-02-02 10:06:01,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:06:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-02-02 10:06:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:06:01,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:01,406 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 10:06:01,406 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 10:06:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash 221499877, now seen corresponding path program 1 times [2018-02-02 10:06:01,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:01,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:01,639 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 10:06:01,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:01,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:06:01,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:01,640 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 10:06:01,640 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 10:06:01,641 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 10:06:01,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:06:01,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:06:01,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:06:01,641 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 18 states. [2018-02-02 10:06:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:02,576 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2018-02-02 10:06:02,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:06:02,576 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-02 10:06:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:02,577 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:06:02,577 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:06:02,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:06:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:06:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2018-02-02 10:06:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:06:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-02 10:06:02,581 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 47 [2018-02-02 10:06:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:02,581 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-02 10:06:02,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:06:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-02 10:06:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:06:02,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:02,582 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 10:06:02,582 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 10:06:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 221499878, now seen corresponding path program 1 times [2018-02-02 10:06:02,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:02,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:02,864 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 10:06:02,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:02,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:06:02,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:02,865 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 10:06:02,865 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 10:06:02,865 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 10:06:02,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:06:02,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:06:02,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:06:02,866 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 19 states. [2018-02-02 10:06:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:03,879 INFO L93 Difference]: Finished difference Result 232 states and 262 transitions. [2018-02-02 10:06:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:06:03,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-02 10:06:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:03,880 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:06:03,880 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:06:03,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:06:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:06:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2018-02-02 10:06:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 10:06:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2018-02-02 10:06:03,883 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 47 [2018-02-02 10:06:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:03,884 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2018-02-02 10:06:03,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:06:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2018-02-02 10:06:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:06:03,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:03,884 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 10:06:03,884 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 10:06:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1594265010, now seen corresponding path program 1 times [2018-02-02 10:06:03,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:03,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:03,920 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 10:06:03,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:03,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:06:03,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:03,920 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 10:06:03,921 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 10:06:03,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:06:03,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:06:03,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:06:03,921 INFO L87 Difference]: Start difference. First operand 211 states and 242 transitions. Second operand 5 states. [2018-02-02 10:06:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:03,971 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-02 10:06:03,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:06:03,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 10:06:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:03,972 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:06:03,973 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:06:03,973 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 10:06:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:06:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2018-02-02 10:06:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:06:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 249 transitions. [2018-02-02 10:06:03,977 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 249 transitions. Word has length 47 [2018-02-02 10:06:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:03,978 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 249 transitions. [2018-02-02 10:06:03,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:06:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 249 transitions. [2018-02-02 10:06:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:06:03,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:03,982 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 10:06:03,982 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 10:06:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162428, now seen corresponding path program 1 times [2018-02-02 10:06:03,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:03,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:04,408 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 10:06:04,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:04,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 10:06:04,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:04,408 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 10:06:04,408 INFO L182 omatonBuilderFactory]: Interpolants [11712#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (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_#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|))), 11713#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))), 11714#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) 4)) (= 0 |main_#t~mem24.offset|)), 11715#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |freeData_#in~data.base|) 4))), 11716#(and (= 0 freeData_~data.offset) (= 0 (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)))), 11717#(= |freeData_#t~mem13.offset| 0), 11695#true, 11696#false, 11697#(= (select |#valid| |main_~#list~0.base|) 1), 11698#(= |#valid| |old(#valid)|), 11699#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 11700#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 11701#(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 (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11702#(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 |#valid| append_~pointerToList.base) 1))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11703#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) 1) (= (select |#valid| append_~node~0.base) 1)) (= append_~node~0.base append_~pointerToList.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11704#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 11705#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 11706#(and (= 0 create_data_~data~0.offset) (= 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)))), 11707#(and (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |create_data_#res.base|) 4)) (= 0 |create_data_#res.offset|)), 11708#(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_~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 |append_#t~ret17.offset|) (not (= append_~pointerToList.base |append_#t~ret17.base|))) (= append_~node~0.base append_~pointerToList.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11709#(and (or (= append_~node~0.base append_~pointerToList.base) (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)) 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)) (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 (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11710#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 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)) (= 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|))))), 11711#(and (= 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|))) (= 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)))] [2018-02-02 10:06:04,408 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 10:06:04,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:06:04,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:06:04,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:06:04,409 INFO L87 Difference]: Start difference. First operand 218 states and 249 transitions. Second operand 23 states. [2018-02-02 10:06:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:05,403 INFO L93 Difference]: Finished difference Result 274 states and 311 transitions. [2018-02-02 10:06:05,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:06:05,404 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-02-02 10:06:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:05,405 INFO L225 Difference]: With dead ends: 274 [2018-02-02 10:06:05,405 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 10:06:05,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=2043, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:06:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 10:06:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 242. [2018-02-02 10:06:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:06:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 280 transitions. [2018-02-02 10:06:05,410 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 280 transitions. Word has length 50 [2018-02-02 10:06:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:05,410 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 280 transitions. [2018-02-02 10:06:05,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:06:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 280 transitions. [2018-02-02 10:06:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:06:05,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:05,411 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 10:06:05,411 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 10:06:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162429, now seen corresponding path program 1 times [2018-02-02 10:06:05,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:05,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:05,813 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 10:06:05,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:05,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 10:06:05,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:05,814 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 10:06:05,814 INFO L182 omatonBuilderFactory]: Interpolants [12288#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 12289#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 12290#(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|)))), 12291#(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|) (= (select |#valid| append_~pointerToList.base) 1)))), 12292#(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|) (= (select |#valid| append_~pointerToList.base) 1) (= (select |#valid| append_~node~0.base) 1)) (= append_~node~0.base append_~pointerToList.base))), 12293#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 12294#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 12295#(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))), 12296#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 |create_data_#res.offset|)), 12297#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 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)) (= 0 |append_#t~ret17.offset|) (not (= append_~pointerToList.base |append_#t~ret17.base|)))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 12298#(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|) (= 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)) (= 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))), 12299#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (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| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 12300#(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| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12301#(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)) (= 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|))), 12302#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))), 12303#(and (= 0 |main_#t~mem24.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4))), 12304#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))), 12305#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)), 12306#(= |freeData_#t~mem13.base| 0), 12284#true, 12285#false, 12286#(= (select |#valid| |main_~#list~0.base|) 1), 12287#(= |#valid| |old(#valid)|)] [2018-02-02 10:06:05,814 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 10:06:05,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:06:05,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:06:05,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:06:05,815 INFO L87 Difference]: Start difference. First operand 242 states and 280 transitions. Second operand 23 states. [2018-02-02 10:06:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:06,783 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2018-02-02 10:06:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:06:06,783 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-02-02 10:06:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:06,784 INFO L225 Difference]: With dead ends: 273 [2018-02-02 10:06:06,784 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 10:06:06,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:06:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 10:06:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 242. [2018-02-02 10:06:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:06:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-02-02 10:06:06,787 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 50 [2018-02-02 10:06:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:06,787 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-02-02 10:06:06,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:06:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-02-02 10:06:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:06:06,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:06,788 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 10:06:06,788 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 10:06:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash -420728712, now seen corresponding path program 1 times [2018-02-02 10:06:06,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:06,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:07,177 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 10:06:07,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:07,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:06:07,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:07,178 INFO L182 omatonBuilderFactory]: Interpolants [12870#true, 12871#false, 12872#(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|))), 12873#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12874#(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)|)), 12875#(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)|)), 12876#(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)))), 12877#(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)))), 12878#(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)))))), 12879#(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|)))), 12880#(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|))), 12881#(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|)))), 12882#(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|)))), 12883#(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|)))), 12884#(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))), 12885#(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))), 12886#(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|)))), 12887#(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|)))), 12888#(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 10:06:07,178 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 10:06:07,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:06:07,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:06:07,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:06:07,179 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 19 states. [2018-02-02 10:06:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:07,886 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2018-02-02 10:06:07,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:06:07,887 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 10:06:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:07,887 INFO L225 Difference]: With dead ends: 257 [2018-02-02 10:06:07,887 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 10:06:07,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:06:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 10:06:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2018-02-02 10:06:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:06:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2018-02-02 10:06:07,891 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 51 [2018-02-02 10:06:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:07,891 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2018-02-02 10:06:07,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:06:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2018-02-02 10:06:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:06:07,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:07,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, 1, 1, 1, 1, 1, 1, 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 10:06:07,892 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 10:06:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1806033505, now seen corresponding path program 1 times [2018-02-02 10:06:07,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:07,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:08,466 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 10:06:08,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:08,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 10:06:08,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:08,467 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 10:06:08,467 INFO L182 omatonBuilderFactory]: Interpolants [13440#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))), 13441#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)), 13442#(or (and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)) (= freeData_~data.base 0)), 13443#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)) (= freeData_~data.base 0)) (= |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))) (= 1 (select |#valid| freeData_~data.base))), 13444#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)) (= freeData_~data.base 0)) (= 1 (select |#valid| freeData_~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)))))), 13445#(and (or (not (= 0 |freeData_#t~mem13.base|)) (not (= |freeData_#t~mem13.offset| 0))) (or (not (= freeData_~data.base |freeData_#t~mem13.base|)) (= freeData_~data.base 0)) (or (= freeData_~data.base |freeData_#t~mem13.base|) (= 1 (select |#valid| freeData_~data.base)))), 13446#(or (= 1 (select |#valid| freeData_~data.base)) (= freeData_~data.base 0)), 13420#true, 13421#false, 13422#(= 1 (select |#valid| |main_~#list~0.base|)), 13423#(= |#valid| |old(#valid)|), 13424#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 13425#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 13426#(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|)))), 13427#(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_~pointerToList.base))))), 13428#(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_~pointerToList.base)) (= 1 (select |#valid| append_~node~0.base))))), 13429#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 13430#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 13431#(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))), 13432#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 |create_data_#res.offset|)), 13433#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 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)) (= 0 |append_#t~ret17.offset|) (not (= append_~pointerToList.base |append_#t~ret17.base|)))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 13434#(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|) (= 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)) (= 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))), 13435#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (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| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 13436#(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| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 13437#(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)) (= 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|))), 13438#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))), 13439#(and (= 0 |main_#t~mem24.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4)))] [2018-02-02 10:06:08,467 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 10:06:08,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:06:08,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:06:08,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:06:08,468 INFO L87 Difference]: Start difference. First operand 250 states and 286 transitions. Second operand 27 states. [2018-02-02 10:06:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:09,645 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-02-02 10:06:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:06:09,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-02-02 10:06:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:09,647 INFO L225 Difference]: With dead ends: 280 [2018-02-02 10:06:09,647 INFO L226 Difference]: Without dead ends: 280 [2018-02-02 10:06:09,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=3006, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:06:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-02 10:06:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2018-02-02 10:06:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:06:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2018-02-02 10:06:09,652 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 52 [2018-02-02 10:06:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:09,653 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2018-02-02 10:06:09,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:06:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2018-02-02 10:06:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:06:09,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:09,653 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 10:06:09,654 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 10:06:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash -594351723, now seen corresponding path program 1 times [2018-02-02 10:06:09,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:09,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:09,922 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 10:06:09,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:09,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:06:09,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:09,923 INFO L182 omatonBuilderFactory]: Interpolants [14048#(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)))), 14049#(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|)))), 14037#true, 14038#false, 14039#(= |#valid| |old(#valid)|), 14040#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 14041#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 14042#(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|)))), 14043#(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)))), 14044#(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)|))), 14045#(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|))), 14046#(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|)))), 14047#(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|))))] [2018-02-02 10:06:09,923 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 10:06:09,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:06:09,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:06:09,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:06:09,924 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand 13 states. [2018-02-02 10:06:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:10,268 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2018-02-02 10:06:10,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:06:10,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 10:06:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:10,269 INFO L225 Difference]: With dead ends: 257 [2018-02-02 10:06:10,269 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:06:10,269 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 10:06:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:06:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2018-02-02 10:06:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-02 10:06:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 260 transitions. [2018-02-02 10:06:10,274 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 260 transitions. Word has length 53 [2018-02-02 10:06:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:10,274 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 260 transitions. [2018-02-02 10:06:10,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:06:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 260 transitions. [2018-02-02 10:06:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:06:10,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:10,275 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 10:06:10,275 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 10:06:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 419691716, now seen corresponding path program 1 times [2018-02-02 10:06:10,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:10,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:10,589 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 10:06:10,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:10,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 10:06:10,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:10,590 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 10:06:10,590 INFO L182 omatonBuilderFactory]: Interpolants [14560#(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|))), 14561#(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|))), 14562#(and (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 14563#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14564#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14565#(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|))))), 14546#true, 14547#false, 14548#(= 1 (select |#valid| |main_~#list~0.base|)), 14549#(= |#valid| |old(#valid)|), 14550#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 14551#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 14552#(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|)))), 14553#(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))))), 14554#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 14555#(= 0 (select |old(#valid)| create_data_~data~0.base)), 14556#(= 0 (select |old(#valid)| |create_data_#res.base|)), 14557#(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|)))), 14558#(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)))))), 14559#(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|))))))] [2018-02-02 10:06:10,590 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 10:06:10,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:06:10,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:06:10,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:06:10,590 INFO L87 Difference]: Start difference. First operand 227 states and 260 transitions. Second operand 20 states. [2018-02-02 10:06:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:11,201 INFO L93 Difference]: Finished difference Result 258 states and 298 transitions. [2018-02-02 10:06:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:06:11,202 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-02 10:06:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:11,202 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:06:11,202 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:06:11,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:06:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:06:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2018-02-02 10:06:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:06:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 281 transitions. [2018-02-02 10:06:11,206 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 281 transitions. Word has length 53 [2018-02-02 10:06:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:11,207 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 281 transitions. [2018-02-02 10:06:11,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:06:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 281 transitions. [2018-02-02 10:06:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:06:11,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:11,207 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 10:06:11,207 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 10:06:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash 125541378, now seen corresponding path program 1 times [2018-02-02 10:06:11,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:11,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:11,504 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 10:06:11,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:11,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:06:11,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:11,505 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 10:06:11,505 INFO L182 omatonBuilderFactory]: Interpolants [15104#(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))), 15105#(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|)))), 15106#(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|)))), 15107#(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|)))), 15108#(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|)))), 15109#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 15110#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 15111#(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|))))), 15112#(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|))), 15113#(= 1 (select |#valid| |main_#t~mem25.base|)), 15095#true, 15096#false, 15097#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 15098#(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 (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))))), 15099#(= |#valid| |old(#valid)|), 15100#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 15101#(= 0 (select |old(#valid)| create_data_~data~0.base)), 15102#(= 0 (select |old(#valid)| |create_data_#res.base|)), 15103#(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 (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~node~0.base |append_#t~ret17.base|)))))] [2018-02-02 10:06:11,505 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 10:06:11,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:06:11,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:06:11,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:06:11,506 INFO L87 Difference]: Start difference. First operand 243 states and 281 transitions. Second operand 19 states. [2018-02-02 10:06:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:12,004 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2018-02-02 10:06:12,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:06:12,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-02 10:06:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:12,005 INFO L225 Difference]: With dead ends: 257 [2018-02-02 10:06:12,005 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 10:06:12,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 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 10:06:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 10:06:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235. [2018-02-02 10:06:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-02 10:06:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2018-02-02 10:06:12,008 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 54 [2018-02-02 10:06:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:12,008 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2018-02-02 10:06:12,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:06:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2018-02-02 10:06:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:06:12,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:12,009 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 10:06:12,009 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 10:06:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash 866020445, now seen corresponding path program 1 times [2018-02-02 10:06:12,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:12,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:12,289 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 10:06:12,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:12,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:06:12,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:12,401 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 10:06:12,401 INFO L182 omatonBuilderFactory]: Interpolants [15648#(= 1 (select |#valid| |freeData_#in~data.base|)), 15649#(= 1 (select |#valid| freeData_~data.base)), 15630#true, 15631#false, 15632#(= append_~pointerToList.base |append_#in~pointerToList.base|), 15633#(= (select |#valid| |append_#in~pointerToList.base|) 1), 15634#(= (select |#valid| |main_~#list~0.base|) 1), 15635#(= |#valid| |old(#valid)|), 15636#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 15637#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 15638#(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)))), 15639#(= 1 (select |#valid| create_data_~data~0.base)), 15640#(= 1 (select |#valid| |create_data_#res.base|)), 15641#(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|))), 15642#(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))), 15643#(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|))))), 15644#(= 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|)))), 15645#(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|))), 15646#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 15647#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 10:06:12,401 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 10:06:12,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:06:12,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:06:12,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:06:12,402 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand 20 states. [2018-02-02 10:06:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:12,981 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2018-02-02 10:06:12,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:06:12,981 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-02-02 10:06:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:12,982 INFO L225 Difference]: With dead ends: 270 [2018-02-02 10:06:12,982 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 10:06:12,982 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 10:06:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 10:06:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 239. [2018-02-02 10:06:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:06:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 276 transitions. [2018-02-02 10:06:12,985 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 276 transitions. Word has length 67 [2018-02-02 10:06:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:12,985 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 276 transitions. [2018-02-02 10:06:12,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:06:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 276 transitions. [2018-02-02 10:06:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:06:12,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:12,986 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 10:06:12,986 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 10:06:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash -688882574, now seen corresponding path program 1 times [2018-02-02 10:06:12,986 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:12,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:13,270 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 10:06:13,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:13,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:06:13,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:13,271 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 10:06:13,271 INFO L182 omatonBuilderFactory]: Interpolants [16201#true, 16202#false, 16203#(= append_~pointerToList.base |append_#in~pointerToList.base|), 16204#(= (select |#valid| |append_#in~pointerToList.base|) 1), 16205#(= (select |#valid| |main_~#list~0.base|) 1), 16206#(= |#valid| |old(#valid)|), 16207#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 16208#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 16209#(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|)))), 16210#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 16211#(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|)))), 16212#(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|)))), 16213#(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|))))), 16214#(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|)))), 16215#(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|))), 16216#(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|))), 16217#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 16218#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 16219#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0))] [2018-02-02 10:06:13,271 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 10:06:13,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:06:13,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:06:13,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:06:13,271 INFO L87 Difference]: Start difference. First operand 239 states and 276 transitions. Second operand 19 states. [2018-02-02 10:06:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:13,862 INFO L93 Difference]: Finished difference Result 265 states and 301 transitions. [2018-02-02 10:06:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:06:13,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 10:06:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:13,863 INFO L225 Difference]: With dead ends: 265 [2018-02-02 10:06:13,863 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 10:06:13,863 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 10:06:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 10:06:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2018-02-02 10:06:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:06:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 277 transitions. [2018-02-02 10:06:13,867 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 277 transitions. Word has length 60 [2018-02-02 10:06:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:13,868 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 277 transitions. [2018-02-02 10:06:13,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:06:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2018-02-02 10:06:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:06:13,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:13,868 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 10:06:13,869 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 10:06:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash 866020446, now seen corresponding path program 1 times [2018-02-02 10:06:13,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:13,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:14,222 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 10:06:14,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:14,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:06:14,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:14,223 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 10:06:14,224 INFO L182 omatonBuilderFactory]: Interpolants [16771#true, 16772#false, 16773#(= append_~pointerToList.base |append_#in~pointerToList.base|), 16774#(= (select |#valid| |append_#in~pointerToList.base|) 1), 16775#(= (select |#valid| |main_~#list~0.base|) 1), 16776#(= |#valid| |old(#valid)|), 16777#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 16778#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 16779#(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|)))), 16780#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 16781#(and (= 0 create_data_~data~0.offset) (= 8 (select |#length| create_data_~data~0.base))), 16782#(and (= 0 |create_data_#res.offset|) (= 8 (select |#length| |create_data_#res.base|))), 16783#(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))), 16784#(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))), 16785#(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|))))), 16786#(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|)))), 16787#(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|))), 16788#(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|)))), 16789#(and (= 8 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 16790#(and (= 0 |freeData_#in~data.offset|) (= 8 (select |#length| |freeData_#in~data.base|))), 16791#(and (= (select |#length| freeData_~data.base) 8) (= 0 freeData_~data.offset))] [2018-02-02 10:06:14,224 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 10:06:14,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:06:14,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:06:14,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:06:14,225 INFO L87 Difference]: Start difference. First operand 243 states and 277 transitions. Second operand 21 states. [2018-02-02 10:06:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:15,084 INFO L93 Difference]: Finished difference Result 282 states and 318 transitions. [2018-02-02 10:06:15,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:06:15,084 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-02-02 10:06:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:15,085 INFO L225 Difference]: With dead ends: 282 [2018-02-02 10:06:15,085 INFO L226 Difference]: Without dead ends: 282 [2018-02-02 10:06:15,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:06:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-02 10:06:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2018-02-02 10:06:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:06:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 275 transitions. [2018-02-02 10:06:15,089 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 275 transitions. Word has length 67 [2018-02-02 10:06:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:15,090 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 275 transitions. [2018-02-02 10:06:15,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:06:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 275 transitions. [2018-02-02 10:06:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:06:15,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:15,091 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 10:06:15,091 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 10:06:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1528121714, now seen corresponding path program 2 times [2018-02-02 10:06:15,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:15,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:15,134 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 10:06:15,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:15,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:06:15,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:15,134 INFO L182 omatonBuilderFactory]: Interpolants [17365#true, 17366#false, 17367#(= create_data_~counter~0 0), 17368#(<= create_data_~counter~0 1), 17369#(<= create_data_~counter~0 2), 17370#(<= create_data_~counter~0 3)] [2018-02-02 10:06:15,134 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 10:06:15,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:06:15,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:06:15,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:06:15,135 INFO L87 Difference]: Start difference. First operand 243 states and 275 transitions. Second operand 6 states. [2018-02-02 10:06:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:15,149 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2018-02-02 10:06:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:06:15,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-02-02 10:06:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:15,152 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:06:15,152 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:06:15,152 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 10:06:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:06:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 250. [2018-02-02 10:06:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:06:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 282 transitions. [2018-02-02 10:06:15,156 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 282 transitions. Word has length 54 [2018-02-02 10:06:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:15,156 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 282 transitions. [2018-02-02 10:06:15,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:06:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 282 transitions. [2018-02-02 10:06:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:06:15,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:15,157 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 10:06:15,157 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 10:06:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2023698147, now seen corresponding path program 1 times [2018-02-02 10:06:15,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:15,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:15,779 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 10:06:15,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:15,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-02 10:06:15,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:15,780 INFO L182 omatonBuilderFactory]: Interpolants [17876#true, 17877#false, 17878#(not (= |main_~#list~0.base| 0)), 17879#(and (not (= |main_~#list~0.base| 0)) (= (select |#valid| |main_~#list~0.base|) 1)), 17880#(= |#valid| |old(#valid)|), 17881#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 17882#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 17883#(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)))), 17884#(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))), 17885#(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)) (= (select |#valid| append_~node~0.base) 1)), 17886#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 17887#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 17888#(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))), 17889#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|))), 17890#(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))) (= 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)) (not (= append_~pointerToList.base |append_#t~ret17.base|))), 17891#(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|) (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))) (= 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))))), 17892#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (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)) (= 1 (select |#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|)))))), 17893#(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|)))) (not (= |main_~#list~0.base| (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))) (= 1 (select |#valid| |main_~#list~0.base|))), 17894#(and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |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|)))) (not (= |main_~#list~0.base| (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))) (= 1 (select |#valid| |main_~#list~0.base|))), 17895#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 17896#(and (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 17897#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 17898#(or (and (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 17899#(or (and (= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))) (= |#valid| |old(#valid)|) (= |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))), 17900#(or (and (= |#valid| |old(#valid)|) (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))), 17901#(or (and (or (not (= 0 |freeData_#t~mem13.base|)) (not (= |freeData_#t~mem13.offset| 0))) (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)) |freeData_#t~mem13.base|) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 17902#(or (and (= |freeData_#in~data.base| freeData_~data.base) (or (= (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)) (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (not (= freeData_~data.base 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 freeData_~data.offset))), 17903#(and (or (= |freeData_#in~data.base| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (and (= (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4) (@diff |old(#valid)| |#valid|)) (= (select |#valid| |freeData_#in~data.base|) 0)) (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))))), 17904#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 10:06:15,781 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 10:06:15,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:06:15,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:06:15,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:06:15,782 INFO L87 Difference]: Start difference. First operand 250 states and 282 transitions. Second operand 29 states. [2018-02-02 10:06:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:16,729 INFO L93 Difference]: Finished difference Result 274 states and 309 transitions. [2018-02-02 10:06:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:06:16,729 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-02-02 10:06:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:16,730 INFO L225 Difference]: With dead ends: 274 [2018-02-02 10:06:16,730 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 10:06:16,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:06:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 10:06:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 254. [2018-02-02 10:06:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:06:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2018-02-02 10:06:16,733 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 56 [2018-02-02 10:06:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:16,733 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2018-02-02 10:06:16,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:06:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2018-02-02 10:06:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:06:16,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:16,734 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 10:06:16,734 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 10:06:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1689866953, now seen corresponding path program 1 times [2018-02-02 10:06:16,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:16,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:17,425 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 10:06:17,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:17,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 10:06:17,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:17,426 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 10:06:17,426 INFO L182 omatonBuilderFactory]: Interpolants [18496#(or (and (= |freeData_#in~data.base| freeData_~data.base) (not (= freeData_~data.base 0)) (or (and (= (select (store |#valid| freeData_~data.base 0) (@diff |old(#valid)| |#valid|)) 0) (= (@diff |old(#valid)| |#valid|) (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 freeData_~data.offset))), 18497#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) (select |#valid| |freeData_#in~data.base|)) (= (@diff |old(#valid)| |#valid|) (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= |freeData_#in~data.base| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (and (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (select |#valid| |freeData_#in~data.base|)) (= (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))), 18498#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select |#valid| |main_~#list~0.base|))), 18499#(= 1 (select |#valid| |main_#t~mem25.base|)), 18473#true, 18474#false, 18475#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base)), 18476#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 |append_#t~malloc14.base|)) (= |append_#in~pointerToList.base| append_~pointerToList.base)), 18477#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (not (= 0 append_~node~0.base))), 18478#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (not (= 0 append_~node~0.base)) (= (select |#valid| append_~node~0.base) 1)), 18479#(= |#valid| |old(#valid)|), 18480#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 18481#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 18482#(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))), 18483#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|))), 18484#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= append_~node~0.base |append_#t~ret17.base|)) (= |append_#in~pointerToList.base| append_~pointerToList.base) (or (= |append_#t~ret17.base| |append_#in~pointerToList.base|) (not (= (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) append_~node~0.base)))), 18485#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (or (and (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))) (= 1 (select |#valid| append_~node~0.base)) (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) append_~node~0.offset) |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)) (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_~node~0.base append_~pointerToList.base)) (= |append_#in~pointerToList.base| append_~pointerToList.base)), 18486#(or (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (and (or (not (= (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) (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|)) |append_#in~pointerToList.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (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|)))))), 18487#(or (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|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (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) (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|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18488#(or (and (or (and (not (= (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) (select (select |#memory_$Pointer$.base| |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|))) (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|)))) (= 1 (select |#valid| (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|))), 18489#(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|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4) (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|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18490#(or (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_#t~mem24.base|) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| |main_#t~mem24.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18491#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 18492#(or (and (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 18493#(or (and (= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))) (= |#valid| |old(#valid)|) (= |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))), 18494#(or (and (= |#valid| |old(#valid)|) (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))), 18495#(or (and (or (not (= 0 |freeData_#t~mem13.base|)) (not (= |freeData_#t~mem13.offset| 0))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem13.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)))] [2018-02-02 10:06:17,427 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 10:06:17,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:06:17,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:06:17,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:06:17,427 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand 27 states. [2018-02-02 10:06:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:18,490 INFO L93 Difference]: Finished difference Result 280 states and 314 transitions. [2018-02-02 10:06:18,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:06:18,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 57 [2018-02-02 10:06:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:18,491 INFO L225 Difference]: With dead ends: 280 [2018-02-02 10:06:18,491 INFO L226 Difference]: Without dead ends: 280 [2018-02-02 10:06:18,491 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=2388, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:06:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-02 10:06:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2018-02-02 10:06:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 10:06:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2018-02-02 10:06:18,494 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 57 [2018-02-02 10:06:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:18,494 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2018-02-02 10:06:18,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:06:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2018-02-02 10:06:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:06:18,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:18,494 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 10:06:18,494 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 10:06:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash 195535773, now seen corresponding path program 1 times [2018-02-02 10:06:18,495 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:18,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:18,796 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 10:06:18,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:18,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:06:18,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:18,797 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 10:06:18,797 INFO L182 omatonBuilderFactory]: Interpolants [19074#true, 19075#false, 19076#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 19077#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 19078#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0)), 19079#(not (= |create_data_#t~malloc1.base| 0)), 19080#(not (= create_data_~data~0.base 0)), 19081#(not (= |create_data_#res.base| 0)), 19082#(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))), 19083#(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)))), 19084#(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))), 19085#(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|))), 19086#(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))), 19087#(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))), 19088#(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|)))), 19089#(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|)))), 19090#(= freeData_~data.base |freeData_#in~data.base|), 19091#(= 0 |freeData_#in~data.base|), 19092#(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|)))), 19093#(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|)))), 19094#(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 10:06:18,797 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 10:06:18,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:06:18,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:06:18,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:06:18,797 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand 21 states. [2018-02-02 10:06:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:19,382 INFO L93 Difference]: Finished difference Result 275 states and 305 transitions. [2018-02-02 10:06:19,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:06:19,382 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-02 10:06:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:19,383 INFO L225 Difference]: With dead ends: 275 [2018-02-02 10:06:19,383 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 10:06:19,383 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 10:06:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 10:06:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 249. [2018-02-02 10:06:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 10:06:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 279 transitions. [2018-02-02 10:06:19,385 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 279 transitions. Word has length 58 [2018-02-02 10:06:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:19,386 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 279 transitions. [2018-02-02 10:06:19,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:06:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 279 transitions. [2018-02-02 10:06:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:06:19,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:19,386 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 10:06:19,386 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 10:06:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1320961102, now seen corresponding path program 1 times [2018-02-02 10:06:19,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:19,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:19,583 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 10:06:19,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:19,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:06:19,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:19,583 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 10:06:19,584 INFO L182 omatonBuilderFactory]: Interpolants [19655#true, 19656#false, 19657#(= append_~pointerToList.base |append_#in~pointerToList.base|), 19658#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 19659#(= 1 (select |#valid| |main_~#list~0.base|)), 19660#(= |#valid| |old(#valid)|), 19661#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 19662#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 19663#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base))), 19664#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 19665#(not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 19666#(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|)))), 19667#(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|)))), 19668#(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|)))] [2018-02-02 10:06:19,584 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 10:06:19,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:06:19,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:06:19,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:06:19,585 INFO L87 Difference]: Start difference. First operand 249 states and 279 transitions. Second operand 14 states. [2018-02-02 10:06:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:19,804 INFO L93 Difference]: Finished difference Result 259 states and 284 transitions. [2018-02-02 10:06:19,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:06:19,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 10:06:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:19,805 INFO L225 Difference]: With dead ends: 259 [2018-02-02 10:06:19,805 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:06:19,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:06:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:06:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2018-02-02 10:06:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 10:06:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-02-02 10:06:19,809 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 73 [2018-02-02 10:06:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:19,809 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-02-02 10:06:19,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:06:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-02-02 10:06:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:06:19,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:19,810 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 10:06:19,810 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 10:06:19,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1492741583, now seen corresponding path program 1 times [2018-02-02 10:06:19,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:19,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:20,626 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 10:06:20,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:20,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:06:20,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:20,627 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 10:06:20,627 INFO L182 omatonBuilderFactory]: Interpolants [20160#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20161#(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)))), 20162#(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|)), 20163#(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)))))), 20164#(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|))))), 20165#(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))))), 20166#(and (= |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)))) (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|))))), 20167#(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|))), 20168#(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))), 20169#(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))), 20170#(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|)))), 20171#(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)), 20149#true, 20150#false, 20151#(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|))), 20152#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20153#(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)|)), 20154#(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)|)), 20155#(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|)))), 20156#(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|)))), 20157#(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|)))), 20158#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20159#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:06:20,628 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 10:06:20,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:06:20,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:06:20,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:06:20,628 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 23 states. [2018-02-02 10:06:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:21,519 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2018-02-02 10:06:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:06:21,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-02-02 10:06:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:21,520 INFO L225 Difference]: With dead ends: 228 [2018-02-02 10:06:21,520 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 10:06:21,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:06:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 10:06:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2018-02-02 10:06:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:06:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2018-02-02 10:06:21,523 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 61 [2018-02-02 10:06:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:21,524 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2018-02-02 10:06:21,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:06:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2018-02-02 10:06:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:06:21,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:21,525 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:06:21,525 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 10:06:21,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1767716282, now seen corresponding path program 2 times [2018-02-02 10:06:21,527 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:21,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:06:21,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:21,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:06:21,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:21,580 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 10:06:21,580 INFO L182 omatonBuilderFactory]: Interpolants [20647#true, 20648#false, 20649#(= create_data_~counter~0 0), 20650#(<= create_data_~counter~0 1), 20651#(<= create_data_~counter~0 2), 20652#(<= create_data_~counter~0 3), 20653#(<= create_data_~counter~0 4)] [2018-02-02 10:06:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:06:21,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:06:21,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:06:21,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:06:21,581 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 7 states. [2018-02-02 10:06:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:21,596 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-02-02 10:06:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:06:21,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-02-02 10:06:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:21,597 INFO L225 Difference]: With dead ends: 231 [2018-02-02 10:06:21,598 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 10:06:21,598 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 10:06:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 10:06:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2018-02-02 10:06:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 10:06:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2018-02-02 10:06:21,601 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 81 [2018-02-02 10:06:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:21,601 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2018-02-02 10:06:21,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:06:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2018-02-02 10:06:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:06:21,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:21,602 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] [2018-02-02 10:06:21,602 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 10:06:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash -6569714, now seen corresponding path program 1 times [2018-02-02 10:06:21,603 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:21,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:22,483 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 10:06:22,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:22,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:06:22,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:22,483 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 10:06:22,484 INFO L182 omatonBuilderFactory]: Interpolants [21120#(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|))), 21121#(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))), 21122#(and (= |old(#valid)| (store |#valid| |create_data_#res.base| (select |old(#valid)| |create_data_#res.base|))) (= 0 (select |old(#valid)| |create_data_#res.base|))), 21123#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 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|)) (not (= |append_#in~pointerToList.base| |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)|))) (not (= 0 append_~node~0.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21124#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (or (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))) (not (= |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_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21125#(and (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| (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|)))) (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|)))) (= 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|)))))) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 21126#(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| (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) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (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|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21127#(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| (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_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |old(#valid)| (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) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (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|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21128#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (= |main_#t~mem23.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_#t~mem23.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (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|)))), 21129#(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) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21130#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 21131#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 21132#(and (= |old(#valid)| (store |#valid| |freeData_#in~data.base| (select |old(#valid)| |freeData_#in~data.base|))) (= (select |#valid| |freeData_#in~data.base|) 0)), 21133#(and (not (= 0 (select (select |#memory_$Pointer$.base| |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|)))), 21134#(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|)))) (not (= 0 |main_#t~mem25.base|))), 21135#(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|)))), 21111#true, 21112#false, 21113#(= |#valid| |old(#valid)|), 21114#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 21115#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 21116#(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|)))), 21117#(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|) (= 0 (select |old(#valid)| 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)|))))) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21118#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1) (not (= 0 append_~node~0.base)) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| 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)|))))) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21119#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1) (not (= 0 append_~node~0.base)) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) (= (select |#valid| append_~node~0.base) 1) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))] [2018-02-02 10:06:22,484 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 10:06:22,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:06:22,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:06:22,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:06:22,484 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 25 states. [2018-02-02 10:06:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:23,645 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2018-02-02 10:06:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:06:23,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-02-02 10:06:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:23,646 INFO L225 Difference]: With dead ends: 244 [2018-02-02 10:06:23,646 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:06:23,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=1419, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:06:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:06:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-02-02 10:06:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 10:06:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2018-02-02 10:06:23,649 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 63 [2018-02-02 10:06:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:23,650 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2018-02-02 10:06:23,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:06:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2018-02-02 10:06:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:06:23,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:23,651 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 10:06:23,651 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 10:06:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1226100464, now seen corresponding path program 1 times [2018-02-02 10:06:23,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:23,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:24,139 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 10:06:24,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:24,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:06:24,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:24,139 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 10:06:24,140 INFO L182 omatonBuilderFactory]: Interpolants [21639#true, 21640#false, 21641#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 21642#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| |append_#t~malloc14.base|))), 21643#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 21644#(= |#valid| |old(#valid)|), 21645#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 21646#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 21647#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21648#(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)|)), 21649#(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)|)), 21650#(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)), 21651#(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|)), 21652#(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)))), 21653#(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)))), 21654#(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|)))), 21655#(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|)))), 21656#(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)), 21657#(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|)))), 21658#(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|)))), 21659#(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|))), 21660#(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))), 21661#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 10:06:24,140 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 10:06:24,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:06:24,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:06:24,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:06:24,140 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand 23 states. [2018-02-02 10:06:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:25,071 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2018-02-02 10:06:25,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:06:25,072 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 10:06:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:25,072 INFO L225 Difference]: With dead ends: 263 [2018-02-02 10:06:25,072 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:06:25,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1762, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:06:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:06:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2018-02-02 10:06:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:06:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 263 transitions. [2018-02-02 10:06:25,077 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 263 transitions. Word has length 71 [2018-02-02 10:06:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:25,077 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 263 transitions. [2018-02-02 10:06:25,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:06:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 263 transitions. [2018-02-02 10:06:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:06:25,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:25,078 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 10:06:25,078 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 10:06:25,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1226100465, now seen corresponding path program 1 times [2018-02-02 10:06:25,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:25,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:25,746 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 10:06:25,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:25,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:06:25,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:25,747 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 10:06:25,747 INFO L182 omatonBuilderFactory]: Interpolants [22209#true, 22210#false, 22211#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 22212#(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|))), 22213#(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))), 22214#(= |old(#length)| |#length|), 22215#(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|)))), 22216#(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|))), 22217#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22218#(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)|)), 22219#(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)|)), 22220#(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|)))), 22221#(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)|)))), 22222#(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|))))), 22223#(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|))))), 22224#(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|))))), 22225#(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)), 22226#(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|)))), 22227#(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))), 22228#(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))), 22229#(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|)))), 22230#(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|))), 22231#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|)))] [2018-02-02 10:06:25,747 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 10:06:25,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:06:25,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:06:25,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:06:25,747 INFO L87 Difference]: Start difference. First operand 239 states and 263 transitions. Second operand 23 states. [2018-02-02 10:06:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:26,978 INFO L93 Difference]: Finished difference Result 289 states and 326 transitions. [2018-02-02 10:06:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:06:26,978 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 10:06:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:26,979 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:06:26,979 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:06:26,979 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 10:06:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:06:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 262. [2018-02-02 10:06:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-02 10:06:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 292 transitions. [2018-02-02 10:06:26,982 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 292 transitions. Word has length 71 [2018-02-02 10:06:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:26,982 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 292 transitions. [2018-02-02 10:06:26,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:06:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 292 transitions. [2018-02-02 10:06:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:06:26,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:26,982 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 10:06:26,982 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 10:06:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233511, now seen corresponding path program 1 times [2018-02-02 10:06:26,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:26,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:27,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:27,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-02 10:06:27,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:27,533 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 10:06:27,534 INFO L182 omatonBuilderFactory]: Interpolants [22848#(or (and (or (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (not (= |freeData_#t~mem13.offset| 0))) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 22849#(or (and (not (= freeData_~data.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 22850#(and (not (= 0 (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))) (= 0 (select |#valid| |freeData_#in~data.base|))), 22851#(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|)))), 22852#(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|))), 22853#(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|))), 22826#true, 22827#false, 22828#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 22829#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 22830#(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)))), 22831#(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)))), 22832#(= |#valid| |old(#valid)|), 22833#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 22834#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 22835#(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))), 22836#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|))), 22837#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 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)) (= |append_#t~ret17.base| |append_#in~pointerToList.base|)) (or (not (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)))), 22838#(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 (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.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)) (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 (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|)))), 22839#(or (= 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)) (= (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|))))), 22840#(or (= 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)) (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|)))), 22841#(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| (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|))) (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|)))), 22842#(or (= 0 (select (select |#memory_$Pointer$.base| (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|))), 22843#(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|))) (= |main_~#list~0.base| |main_#t~mem24.base|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4))), 22844#(= freeData_~data.base |freeData_#in~data.base|), 22845#(or (and (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 22846#(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))), 22847#(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)))] [2018-02-02 10:06:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:27,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:06:27,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:06:27,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:06:27,535 INFO L87 Difference]: Start difference. First operand 262 states and 292 transitions. Second operand 28 states. [2018-02-02 10:06:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:28,571 INFO L93 Difference]: Finished difference Result 277 states and 307 transitions. [2018-02-02 10:06:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:06:28,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2018-02-02 10:06:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:28,572 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:06:28,572 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 10:06:28,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=2990, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:06:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 10:06:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2018-02-02 10:06:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:06:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 266 transitions. [2018-02-02 10:06:28,575 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 266 transitions. Word has length 66 [2018-02-02 10:06:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:28,575 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 266 transitions. [2018-02-02 10:06:28,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:06:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 266 transitions. [2018-02-02 10:06:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:06:28,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:28,575 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 10:06:28,576 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 10:06:28,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1460521485, now seen corresponding path program 1 times [2018-02-02 10:06:28,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:28,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:28,968 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 10:06:28,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:28,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:06:28,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:28,968 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 10:06:28,969 INFO L182 omatonBuilderFactory]: Interpolants [23430#true, 23431#false, 23432#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 23433#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 23434#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 23435#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 23436#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 23437#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 23438#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 23439#(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)|)), 23440#(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)|)), 23441#(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|)), 23442#(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)))), 23443#(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)))))), 23444#(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|))))), 23445#(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))))), 23446#(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))))), 23447#(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|)))), 23448#(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))), 23449#(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))), 23450#(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|)))), 23451#(not (= 0 |main_#t~mem27.base|))] [2018-02-02 10:06:28,969 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 10:06:28,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:06:28,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:06:28,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:06:28,969 INFO L87 Difference]: Start difference. First operand 239 states and 266 transitions. Second operand 22 states. [2018-02-02 10:06:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:29,825 INFO L93 Difference]: Finished difference Result 268 states and 301 transitions. [2018-02-02 10:06:29,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:06:29,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-02 10:06:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:29,826 INFO L225 Difference]: With dead ends: 268 [2018-02-02 10:06:29,826 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 10:06:29,827 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 10:06:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 10:06:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 239. [2018-02-02 10:06:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:06:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 264 transitions. [2018-02-02 10:06:29,829 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 264 transitions. Word has length 73 [2018-02-02 10:06:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:29,829 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 264 transitions. [2018-02-02 10:06:29,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:06:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2018-02-02 10:06:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:06:29,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:29,830 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] [2018-02-02 10:06:29,830 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 10:06:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1756723881, now seen corresponding path program 1 times [2018-02-02 10:06:29,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:29,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:30,386 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 69 DAG size of output 48 [2018-02-02 10:06:31,225 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 10:06:31,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:31,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:06:31,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:31,225 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 10:06:31,226 INFO L182 omatonBuilderFactory]: Interpolants [24006#true, 24007#false, 24008#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 24009#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 24010#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 24011#(= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1), 24012#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24013#(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)|)), 24014#(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|)) (= |#valid| (store |old(#valid)| |append_#t~malloc14.base| (select |#valid| |append_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24015#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.offset 0) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24016#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.offset 0) (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|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24017#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.offset 0) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= (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|))))), 24018#(and (= |#valid| (store |old(#valid)| |create_data_#t~malloc1.base| (select |#valid| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24019#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24020#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= 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))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24021#(and (= |#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|)))) (= 0 (select |old(#valid)| |create_data_#res.base|)) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#valid| |old(#valid)|) (= |create_data_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24022#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (and (= append_~node~0.offset 0) (= |append_#t~ret17.base| append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= 0 (select |old(#valid)| |append_#t~ret17.base|)) (or (= append_~node~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |append_#t~ret17.base| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= append_~node~0.offset 0) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|) (= |append_#t~ret17.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (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))))), 24023#(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 (select |old(#valid)| 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))) (= append_~node~0.offset 0) (= 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))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |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) 0) (@diff |old(#valid)| |#valid|))) (or (= append_~node~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#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) 0) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= 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|)))), 24024#(or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (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)) (or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff |old(#valid)| |#valid|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= (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|))), 24025#(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 (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (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|))) (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| (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|))), 24026#(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 (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (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|))) (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| (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|)))), 24027#(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 (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (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|))) (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| (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|)))), 24028#(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 (= 0 |main_#t~mem21.offset|)) (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|) (= 0 |main_#t~mem21.offset|))) (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|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24029#(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|))) (not (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= 1 (select |#valid| |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|)))), 24030#(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)) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= 1 (select |#valid| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24031#(and (or (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|))) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= 1 (select |#valid| main_~next~0.base)))) (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|))))), 24032#(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|)) (and (not (= main_~next~0.base |main_#t~mem24.base|)) (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|)))), 24033#(= |#valid| |old(#valid)|), 24034#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 24035#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 24036#(and (or (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))) (= 0 (select |#valid| |freeData_#in~data.base|))), 24037#(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|)))), 24038#(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)))), 24039#(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))), 24040#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 10:06:31,226 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 10:06:31,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:06:31,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:06:31,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:06:31,226 INFO L87 Difference]: Start difference. First operand 239 states and 264 transitions. Second operand 35 states. [2018-02-02 10:06:32,030 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 75 DAG size of output 74 [2018-02-02 10:06:32,424 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 80 DAG size of output 79 [2018-02-02 10:06:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:34,252 INFO L93 Difference]: Finished difference Result 273 states and 306 transitions. [2018-02-02 10:06:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:06:34,252 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 81 [2018-02-02 10:06:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:34,253 INFO L225 Difference]: With dead ends: 273 [2018-02-02 10:06:34,253 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 10:06:34,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=319, Invalid=4511, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:06:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 10:06:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2018-02-02 10:06:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 10:06:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 273 transitions. [2018-02-02 10:06:34,256 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 273 transitions. Word has length 81 [2018-02-02 10:06:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:34,256 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 273 transitions. [2018-02-02 10:06:34,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:06:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 273 transitions. [2018-02-02 10:06:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:06:34,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:34,257 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 10:06:34,257 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 10:06:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1937872819, now seen corresponding path program 1 times [2018-02-02 10:06:34,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:34,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:34,793 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 10:06:34,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:34,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:06:34,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:34,794 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 10:06:34,794 INFO L182 omatonBuilderFactory]: Interpolants [24640#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24641#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24642#(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)|)), 24643#(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)|)), 24644#(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)|)), 24645#(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|))), 24646#(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|)))), 24647#(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|))))), 24648#(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|)))), 24649#(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))), 24650#(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|)), 24651#(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)), 24652#(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)), 24653#(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|)))), 24654#(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|))), 24655#(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)), 24656#(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|)))), 24657#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 8) (select |#length| |main_#t~mem23.base|))), 24633#true, 24634#false, 24635#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 24636#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 24637#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 24638#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 24639#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))] [2018-02-02 10:06:34,794 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 10:06:34,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:06:34,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:06:34,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:06:34,795 INFO L87 Difference]: Start difference. First operand 247 states and 273 transitions. Second operand 25 states. [2018-02-02 10:06:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:36,043 INFO L93 Difference]: Finished difference Result 272 states and 301 transitions. [2018-02-02 10:06:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:06:36,043 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-02-02 10:06:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:36,044 INFO L225 Difference]: With dead ends: 272 [2018-02-02 10:06:36,044 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 10:06:36,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=2710, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:06:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 10:06:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2018-02-02 10:06:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 10:06:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 279 transitions. [2018-02-02 10:06:36,047 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 279 transitions. Word has length 74 [2018-02-02 10:06:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:36,047 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 279 transitions. [2018-02-02 10:06:36,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:06:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 279 transitions. [2018-02-02 10:06:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:06:36,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:36,048 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] [2018-02-02 10:06:36,048 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 10:06:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1756723882, now seen corresponding path program 1 times [2018-02-02 10:06:36,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:36,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:37,393 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 10:06:37,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:37,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:06:37,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:37,394 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 10:06:37,395 INFO L182 omatonBuilderFactory]: Interpolants [25280#(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|))), 25281#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|))), 25245#true, 25246#false, 25247#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 25248#(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|))), 25249#(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))), 25250#(= |old(#length)| |#length|), 25251#(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|)))), 25252#(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|))), 25253#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25254#(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)|)), 25255#(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)|)), 25256#(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))), 25257#(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)))), 25258#(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)))), 25259#(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)|)), 25260#(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)|)), 25261#(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))), 25262#(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)|))), 25263#(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)))), 25264#(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|)))), 25265#(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|)))), 25266#(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|))), 25267#(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|))), 25268#(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|)))), 25269#(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))), 25270#(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))), 25271#(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))), 25272#(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))), 25273#(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))), 25274#(= freeData_~data.base |freeData_#in~data.base|), 25275#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)), 25276#(= 0 (select |#valid| |freeData_#in~data.base|)), 25277#(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))), 25278#(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))), 25279#(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|))))] [2018-02-02 10:06:37,395 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 10:06:37,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:06:37,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:06:37,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1234, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:06:37,396 INFO L87 Difference]: Start difference. First operand 252 states and 279 transitions. Second operand 37 states. [2018-02-02 10:06:38,011 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 80 DAG size of output 77 [2018-02-02 10:06:38,420 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 81 DAG size of output 79 [2018-02-02 10:06:38,800 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 87 DAG size of output 86 [2018-02-02 10:06:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:40,706 INFO L93 Difference]: Finished difference Result 320 states and 365 transitions. [2018-02-02 10:06:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:06:40,706 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-02-02 10:06:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:40,707 INFO L225 Difference]: With dead ends: 320 [2018-02-02 10:06:40,707 INFO L226 Difference]: Without dead ends: 320 [2018-02-02 10:06:40,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=436, Invalid=4820, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 10:06:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-02 10:06:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 275. [2018-02-02 10:06:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 10:06:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 308 transitions. [2018-02-02 10:06:40,710 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 308 transitions. Word has length 81 [2018-02-02 10:06:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:40,711 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 308 transitions. [2018-02-02 10:06:40,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:06:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 308 transitions. [2018-02-02 10:06:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:06:40,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:40,712 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 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] [2018-02-02 10:06:40,712 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 10:06:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2132843125, now seen corresponding path program 1 times [2018-02-02 10:06:40,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:40,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:06:40,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:40,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:06:40,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:06:40,769 INFO L182 omatonBuilderFactory]: Interpolants [25952#(= create_data_~counter~0 0), 25953#(<= create_data_~counter~0 1), 25954#(<= create_data_~counter~0 2), 25955#(<= create_data_~counter~0 3), 25956#(<= create_data_~counter~0 4), 25957#(<= create_data_~counter~0 5), 25950#true, 25951#false] [2018-02-02 10:06:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:06:40,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:06:40,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:06:40,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:06:40,770 INFO L87 Difference]: Start difference. First operand 275 states and 308 transitions. Second operand 8 states. [2018-02-02 10:06:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:40,793 INFO L93 Difference]: Finished difference Result 287 states and 320 transitions. [2018-02-02 10:06:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:06:40,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-02-02 10:06:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:40,795 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:06:40,795 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:06:40,795 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 10:06:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:06:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 282. [2018-02-02 10:06:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 10:06:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 315 transitions. [2018-02-02 10:06:40,799 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 315 transitions. Word has length 95 [2018-02-02 10:06:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:40,799 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 315 transitions. [2018-02-02 10:06:40,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:06:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 315 transitions. [2018-02-02 10:06:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:06:40,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:40,800 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] [2018-02-02 10:06:40,800 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 10:06:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 288516998, now seen corresponding path program 1 times [2018-02-02 10:06:40,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:40,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:41,303 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 10:06:41,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:41,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:06:41,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:41,303 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 10:06:41,304 INFO L182 omatonBuilderFactory]: Interpolants [26527#true, 26528#false, 26529#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 26530#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 26531#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 26532#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 26533#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 26534#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 26535#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26536#(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)|)), 26537#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26538#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|)), 26539#(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) (= (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)))), 26540#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26541#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26542#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26543#(and (= 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)))), 26544#(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|))))), 26545#(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 (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)))), 26546#(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) (= (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)))) (= append_~node~0.base append_~pointerToList.base))), 26547#(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| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|)), 26548#(or (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|))), 26549#(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 (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))), 26550#(or (not (= 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|)))), 26551#(or (and (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (not (= |main_#t~mem21.offset| 0))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.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|)))), 26552#(or (not (= 0 |main_#t~mem22.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))), 26553#(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|))) (not (= 0 main_~next~0.base)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 26554#(or (not (= 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|)))), 26555#(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|)))), 26556#(not (= 0 |main_#t~mem27.base|))] [2018-02-02 10:06:41,304 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 10:06:41,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:06:41,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:06:41,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:06:41,304 INFO L87 Difference]: Start difference. First operand 282 states and 315 transitions. Second operand 30 states. Received shutdown request... [2018-02-02 10:06:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:06:41,743 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:06:41,746 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:06:41,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:06:41 BoogieIcfgContainer [2018-02-02 10:06:41,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:06:41,748 INFO L168 Benchmark]: Toolchain (without parser) took 50526.27 ms. Allocated memory was 404.8 MB in the beginning and 1.3 GB in the end (delta: 915.4 MB). Free memory was 361.6 MB in the beginning and 566.6 MB in the end (delta: -205.0 MB). Peak memory consumption was 710.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:41,749 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:06:41,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.32 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 351.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:41,749 INFO L168 Benchmark]: Boogie Preprocessor took 29.65 ms. Allocated memory is still 404.8 MB. Free memory was 351.1 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:41,749 INFO L168 Benchmark]: RCFGBuilder took 378.27 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 315.6 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:41,749 INFO L168 Benchmark]: TraceAbstraction took 49951.31 ms. Allocated memory was 404.8 MB in the beginning and 1.3 GB in the end (delta: 915.4 MB). Free memory was 315.6 MB in the beginning and 566.6 MB in the end (delta: -251.0 MB). Peak memory consumption was 664.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:41,750 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.14 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.32 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 351.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.65 ms. Allocated memory is still 404.8 MB. Free memory was 351.1 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 378.27 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 315.6 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49951.31 ms. Allocated memory was 404.8 MB in the beginning and 1.3 GB in the end (delta: 915.4 MB). Free memory was 315.6 MB in the beginning and 566.6 MB in the end (delta: -251.0 MB). Peak memory consumption was 664.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 21 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 121 locations, 45 error locations. TIMEOUT Result, 49.9s OverallTime, 66 OverallIterations, 6 TraceHistogramMax, 32.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5572 SDtfs, 5295 SDslu, 27999 SDs, 0 SdLazy, 32863 SolverSat, 1341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1612 GetRequests, 153 SyntacticMatches, 48 SemanticMatches, 1410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12052 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 187/512 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 65 MinimizatonAttempts, 895 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 2968 NumberOfCodeBlocks, 2968 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2902 ConstructedInterpolants, 0 QuantifiedInterpolants, 2234608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 43 PerfectInterpolantSequences, 187/512 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-06-41-757.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-06-41-757.csv Completed graceful shutdown