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/complex_data_creation_test02_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:05:05,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:05:05,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:05:05,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:05:05,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:05:05,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:05:05,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:05:05,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:05:05,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:05:05,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:05:05,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:05:05,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:05:05,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:05:05,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:05:05,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:05:05,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:05:05,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:05:05,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:05:05,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:05:05,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:05:05,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:05:05,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:05:05,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:05:05,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:05:05,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:05:05,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:05:05,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:05:05,400 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:05:05,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:05:05,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:05:05,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:05:05,401 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:05,410 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:05:05,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:05:05,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:05:05,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:05:05,412 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:05:05,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:05:05,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:05:05,413 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:05:05,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:05:05,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:05:05,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:05:05,413 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:05:05,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:05:05,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:05:05,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:05:05,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:05:05,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:05:05,450 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:05:05,453 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:05:05,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:05:05,455 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:05:05,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_true-valid-memsafety.i [2018-02-02 10:05:05,582 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:05:05,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:05:05,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:05:05,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:05:05,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:05:05,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:05:05" (1/1) ... [2018-02-02 10:05:05,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56610e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:05, skipping insertion in model container [2018-02-02 10:05:05,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:05:05" (1/1) ... [2018-02-02 10:05:05,602 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:05:05,630 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:05:05,727 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:05:05,750 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:05:05,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:05 WrapperNode [2018-02-02 10:05:05,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:05:05,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:05:05,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:05:05,760 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:05:05,771 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:05" (1/1) ... [2018-02-02 10:05:05,771 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:05" (1/1) ... [2018-02-02 10:05:05,779 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:05" (1/1) ... [2018-02-02 10:05:05,780 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:05" (1/1) ... [2018-02-02 10:05:05,787 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:05" (1/1) ... [2018-02-02 10:05:05,790 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:05" (1/1) ... [2018-02-02 10:05:05,792 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:05" (1/1) ... [2018-02-02 10:05:05,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:05:05,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:05:05,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:05:05,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:05:05,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:05" (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:05,834 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:05:05,834 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:05:05,835 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 10:05:05,835 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 10:05:05,835 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 10:05:05,835 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:05:05,835 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:05:05,835 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:05:05,835 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 10:05:05,836 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 10:05:05,837 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 10:05:05,837 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:05:05,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:05:05,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:05:06,304 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:05:06,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:05:06 BoogieIcfgContainer [2018-02-02 10:05:06,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:05:06,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:05:06,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:05:06,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:05:06,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:05:05" (1/3) ... [2018-02-02 10:05:06,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c8fab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:05:06, skipping insertion in model container [2018-02-02 10:05:06,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:05" (2/3) ... [2018-02-02 10:05:06,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c8fab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:05:06, skipping insertion in model container [2018-02-02 10:05:06,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:05:06" (3/3) ... [2018-02-02 10:05:06,313 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_true-valid-memsafety.i [2018-02-02 10:05:06,320 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:05:06,328 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-02 10:05:06,363 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:05:06,363 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:05:06,363 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:05:06,363 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:05:06,363 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:05:06,364 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:05:06,364 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:05:06,364 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:05:06,365 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:05:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-02-02 10:05:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:05:06,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:06,390 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:06,390 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:06,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1490553648, now seen corresponding path program 1 times [2018-02-02 10:05:06,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:06,471 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:06,515 INFO L134 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:06,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:06,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:05:06,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:06,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:05:06,519 INFO L182 omatonBuilderFactory]: Interpolants [219#true, 220#false, 221#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 10:05:06,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:05:06,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:05:06,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:05:06,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:06,591 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-02-02 10:05:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:06,782 INFO L93 Difference]: Finished difference Result 211 states and 223 transitions. [2018-02-02 10:05:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:05:06,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:05:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:06,795 INFO L225 Difference]: With dead ends: 211 [2018-02-02 10:05:06,795 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:05:06,797 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:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:05:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-02 10:05:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:05:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 220 transitions. [2018-02-02 10:05:06,839 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 220 transitions. Word has length 7 [2018-02-02 10:05:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:06,840 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 220 transitions. [2018-02-02 10:05:06,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:05:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 220 transitions. [2018-02-02 10:05:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:05:06,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:06,840 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:06,840 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1490553649, now seen corresponding path program 1 times [2018-02-02 10:05:06,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:06,853 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:06,886 INFO L134 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:06,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:06,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:05:06,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:06,887 INFO L134 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:06,887 INFO L182 omatonBuilderFactory]: Interpolants [641#true, 642#false, 643#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0))] [2018-02-02 10:05:06,887 INFO L134 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:06,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:05:06,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:05:06,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:06,889 INFO L87 Difference]: Start difference. First operand 208 states and 220 transitions. Second operand 3 states. [2018-02-02 10:05:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:06,997 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2018-02-02 10:05:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:05:06,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:05:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:06,999 INFO L225 Difference]: With dead ends: 209 [2018-02-02 10:05:06,999 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:05:07,000 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:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:05:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-02-02 10:05:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 10:05:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 219 transitions. [2018-02-02 10:05:07,010 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 219 transitions. Word has length 7 [2018-02-02 10:05:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:07,010 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 219 transitions. [2018-02-02 10:05:07,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:05:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2018-02-02 10:05:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:05:07,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:07,011 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:07,011 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1508922073, now seen corresponding path program 1 times [2018-02-02 10:05:07,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:07,025 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:07,066 INFO L134 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:07,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:07,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:07,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:07,067 INFO L134 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:07,067 INFO L182 omatonBuilderFactory]: Interpolants [1060#true, 1061#false, 1062#(= 1 (select |#valid| |main_~#list~0.base|)), 1063#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 1064#(= 1 (select |#valid| append_~pointerToList.base))] [2018-02-02 10:05:07,067 INFO L134 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:07,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:07,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:07,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:07,068 INFO L87 Difference]: Start difference. First operand 207 states and 219 transitions. Second operand 5 states. [2018-02-02 10:05:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:07,251 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-02-02 10:05:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:07,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:05:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:07,253 INFO L225 Difference]: With dead ends: 205 [2018-02-02 10:05:07,253 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 10:05:07,254 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:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 10:05:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-02 10:05:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:05:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions. [2018-02-02 10:05:07,265 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 14 [2018-02-02 10:05:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:07,265 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 217 transitions. [2018-02-02 10:05:07,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 217 transitions. [2018-02-02 10:05:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:05:07,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:07,266 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:07,266 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1508922074, now seen corresponding path program 1 times [2018-02-02 10:05:07,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:07,280 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:07,360 INFO L134 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:07,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:07,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:05:07,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:07,361 INFO L134 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:07,361 INFO L182 omatonBuilderFactory]: Interpolants [1477#true, 1478#false, 1479#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 1480#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4) (= (select |#valid| |main_~#list~0.base|) 1)), 1481#(and (<= 4 (select |#length| |append_#in~pointerToList.base|)) (= 0 |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1)), 1482#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 1483#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0))] [2018-02-02 10:05:07,361 INFO L134 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:07,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:07,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:07,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:07,362 INFO L87 Difference]: Start difference. First operand 205 states and 217 transitions. Second operand 7 states. [2018-02-02 10:05:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:07,655 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-02-02 10:05:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:07,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 10:05:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:07,656 INFO L225 Difference]: With dead ends: 225 [2018-02-02 10:05:07,656 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 10:05:07,656 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:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 10:05:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2018-02-02 10:05:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:05:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-02-02 10:05:07,663 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 14 [2018-02-02 10:05:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:07,664 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-02-02 10:05:07,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-02-02 10:05:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:05:07,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:07,664 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:07,664 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash -468055759, now seen corresponding path program 1 times [2018-02-02 10:05:07,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:07,676 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:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:07,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:07,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:07,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:07,695 INFO L182 omatonBuilderFactory]: Interpolants [1925#true, 1926#false, 1927#(= 1 (select |#valid| |append_#t~malloc34.base|)), 1928#(= 1 (select |#valid| append_~node~0.base))] [2018-02-02 10:05:07,695 INFO L134 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:07,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:07,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:07,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:07,695 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 4 states. [2018-02-02 10:05:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:07,799 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2018-02-02 10:05:07,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:07,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:05:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:07,800 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:05:07,800 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:05:07,801 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:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:05:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-02-02 10:05:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 10:05:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 226 transitions. [2018-02-02 10:05:07,807 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 226 transitions. Word has length 15 [2018-02-02 10:05:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:07,807 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 226 transitions. [2018-02-02 10:05:07,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2018-02-02 10:05:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:05:07,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:07,808 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:07,808 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash -468055758, now seen corresponding path program 1 times [2018-02-02 10:05:07,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:07,817 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:07,844 INFO L134 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:07,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:07,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:07,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:07,845 INFO L134 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:07,845 INFO L182 omatonBuilderFactory]: Interpolants [2355#true, 2356#false, 2357#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 2358#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0))] [2018-02-02 10:05:07,845 INFO L134 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:07,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:07,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:07,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:07,846 INFO L87 Difference]: Start difference. First operand 212 states and 226 transitions. Second operand 4 states. [2018-02-02 10:05:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:07,956 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-02 10:05:07,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:07,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:05:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:07,958 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:05:07,958 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 10:05:07,958 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:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 10:05:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-02 10:05:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 10:05:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-02-02 10:05:07,963 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 15 [2018-02-02 10:05:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:07,963 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-02-02 10:05:07,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-02-02 10:05:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:05:07,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:07,964 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] [2018-02-02 10:05:07,964 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1490864651, now seen corresponding path program 1 times [2018-02-02 10:05:07,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:07,980 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:08,183 INFO L134 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:08,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:08,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:05:08,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:08,184 INFO L134 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:08,184 INFO L182 omatonBuilderFactory]: Interpolants [2784#(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|)) (= (select |#valid| 0) 0) (= 1 (select |#valid| |main_~#list~0.base|))), 2785#(and (= 1 (select |#valid| |append_#in~pointerToList.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select |#valid| 0) 0)), 2786#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= 1 (select |#valid| append_~pointerToList.base)) (= (select |#valid| 0) 0)), 2787#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (or (not (= append_~pointerToList.base |append_#t~malloc34.base|)) (= 1 (select |#valid| 0)))), 2788#(and (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= 1 (select |#valid| 0)))) (or (= append_~pointerToList.base append_~node~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))))), 2789#(and (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 |append_#t~mem36.base|) (= 1 (select |#valid| 0)))) (or (= append_~pointerToList.base append_~node~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))))), 2790#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (= 1 (select |#valid| 0))) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))))), 2791#(or (and (= 0 (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (= 1 (select |#valid| 0))) (and (= 0 |append_#t~mem37.base|) (= 0 |append_#t~mem37.offset|))), 2792#(and (= 0 (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (= 1 (select |#valid| 0))), 2793#(= 1 (select |#valid| |append_#t~mem40.base|)), 2781#true, 2782#false, 2783#(= (select |#valid| 0) 0)] [2018-02-02 10:05:08,184 INFO L134 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:08,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:05:08,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:05:08,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:05:08,185 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 13 states. [2018-02-02 10:05:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:08,954 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2018-02-02 10:05:08,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:05:08,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-02 10:05:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:08,956 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:05:08,956 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:05:08,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:05:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:05:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-02-02 10:05:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 10:05:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2018-02-02 10:05:08,961 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 20 [2018-02-02 10:05:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:08,961 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2018-02-02 10:05:08,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:05:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2018-02-02 10:05:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:05:08,962 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:08,962 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:08,963 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1804170703, now seen corresponding path program 1 times [2018-02-02 10:05:08,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:08,971 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:08,996 INFO L134 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:08,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:08,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:08,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:08,998 INFO L134 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:08,998 INFO L182 omatonBuilderFactory]: Interpolants [3232#(not |create_data_#t~short1|), 3229#true, 3230#false, 3231#(and (= 0 |create_data_#in~prevData.base|) (= 0 |create_data_#in~prevData.offset|))] [2018-02-02 10:05:08,998 INFO L134 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:08,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:08,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:08,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:08,999 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand 4 states. [2018-02-02 10:05:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:09,019 INFO L93 Difference]: Finished difference Result 300 states and 317 transitions. [2018-02-02 10:05:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:09,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 10:05:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:09,024 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:05:09,024 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:05:09,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:05:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 264. [2018-02-02 10:05:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-02 10:05:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 317 transitions. [2018-02-02 10:05:09,029 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 317 transitions. Word has length 22 [2018-02-02 10:05:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:09,030 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 317 transitions. [2018-02-02 10:05:09,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 317 transitions. [2018-02-02 10:05:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:05:09,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:09,030 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] [2018-02-02 10:05:09,030 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash 265371579, now seen corresponding path program 1 times [2018-02-02 10:05:09,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:09,040 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:09,066 INFO L134 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:09,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:09,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:09,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:09,067 INFO L134 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:09,067 INFO L182 omatonBuilderFactory]: Interpolants [3799#true, 3800#false, 3801#(= 1 (select |#valid| |create_data_#t~malloc3.base|)), 3802#(= 1 (select |#valid| create_data_~data~0.base))] [2018-02-02 10:05:09,068 INFO L134 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:09,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:09,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:09,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:09,068 INFO L87 Difference]: Start difference. First operand 264 states and 317 transitions. Second operand 4 states. [2018-02-02 10:05:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:09,215 INFO L93 Difference]: Finished difference Result 277 states and 323 transitions. [2018-02-02 10:05:09,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:09,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 10:05:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:09,217 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:05:09,217 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 10:05:09,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 10:05:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2018-02-02 10:05:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 10:05:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 315 transitions. [2018-02-02 10:05:09,223 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 315 transitions. Word has length 26 [2018-02-02 10:05:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:09,224 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 315 transitions. [2018-02-02 10:05:09,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 315 transitions. [2018-02-02 10:05:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:05:09,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:09,224 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] [2018-02-02 10:05:09,225 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 265371580, now seen corresponding path program 1 times [2018-02-02 10:05:09,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:09,236 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:09,277 INFO L134 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:09,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:09,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:09,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:09,277 INFO L134 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:09,278 INFO L182 omatonBuilderFactory]: Interpolants [4352#(and (= create_data_~data~0.offset 0) (= (select |#length| create_data_~data~0.base) 16)), 4348#true, 4349#false, 4350#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 0 |create_data_#t~malloc3.offset|) (= 16 (select |#length| |create_data_#t~malloc3.base|))), 4351#(and (= create_data_~data~0.offset 0) (= (select |#valid| create_data_~data~0.base) 1) (= 16 (select |#length| create_data_~data~0.base)))] [2018-02-02 10:05:09,278 INFO L134 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:09,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:09,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:09,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:09,278 INFO L87 Difference]: Start difference. First operand 266 states and 315 transitions. Second operand 5 states. [2018-02-02 10:05:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:09,443 INFO L93 Difference]: Finished difference Result 289 states and 331 transitions. [2018-02-02 10:05:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:09,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 10:05:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:09,444 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:05:09,444 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:05:09,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:05:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:05:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 267. [2018-02-02 10:05:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 10:05:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 309 transitions. [2018-02-02 10:05:09,452 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 309 transitions. Word has length 26 [2018-02-02 10:05:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:09,453 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 309 transitions. [2018-02-02 10:05:09,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 309 transitions. [2018-02-02 10:05:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:05:09,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:09,454 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] [2018-02-02 10:05:09,454 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1933498913, now seen corresponding path program 1 times [2018-02-02 10:05:09,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:09,472 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:09,509 INFO L134 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:09,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:09,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:09,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:09,510 INFO L134 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:09,510 INFO L182 omatonBuilderFactory]: Interpolants [4912#false, 4913#(= 1 (select |#valid| |create_data_#t~malloc4.base|)), 4914#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 4915#(= 1 (select |#valid| |create_data_#t~mem7.base|)), 4911#true] [2018-02-02 10:05:09,510 INFO L134 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:09,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:09,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:09,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:09,511 INFO L87 Difference]: Start difference. First operand 267 states and 309 transitions. Second operand 5 states. [2018-02-02 10:05:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:09,733 INFO L93 Difference]: Finished difference Result 338 states and 393 transitions. [2018-02-02 10:05:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:09,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 10:05:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:09,737 INFO L225 Difference]: With dead ends: 338 [2018-02-02 10:05:09,737 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 10:05:09,737 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:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 10:05:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 277. [2018-02-02 10:05:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 10:05:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 323 transitions. [2018-02-02 10:05:09,746 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 323 transitions. Word has length 32 [2018-02-02 10:05:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:09,746 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 323 transitions. [2018-02-02 10:05:09,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 323 transitions. [2018-02-02 10:05:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:05:09,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:09,748 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] [2018-02-02 10:05:09,748 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:09,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1933498914, now seen corresponding path program 1 times [2018-02-02 10:05:09,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:09,760 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:09,811 INFO L134 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:09,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:09,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:05:09,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:09,812 INFO L134 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:09,812 INFO L182 omatonBuilderFactory]: Interpolants [5537#true, 5538#false, 5539#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (= 0 |create_data_#t~malloc4.offset|)), 5540#(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))))), 5541#(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))))), 5542#(and (= create_data_~counter~0 0) (= (select |#length| |create_data_#t~mem7.base|) 80) (= |create_data_#t~mem7.offset| 0))] [2018-02-02 10:05:09,812 INFO L134 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:09,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:05:09,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:05:09,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:05:09,813 INFO L87 Difference]: Start difference. First operand 277 states and 323 transitions. Second operand 6 states. [2018-02-02 10:05:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:10,040 INFO L93 Difference]: Finished difference Result 285 states and 327 transitions. [2018-02-02 10:05:10,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:10,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 10:05:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:10,041 INFO L225 Difference]: With dead ends: 285 [2018-02-02 10:05:10,041 INFO L226 Difference]: Without dead ends: 285 [2018-02-02 10:05:10,041 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:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-02 10:05:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2018-02-02 10:05:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 10:05:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 319 transitions. [2018-02-02 10:05:10,047 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 319 transitions. Word has length 32 [2018-02-02 10:05:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:10,047 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 319 transitions. [2018-02-02 10:05:10,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:05:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 319 transitions. [2018-02-02 10:05:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:05:10,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:10,048 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] [2018-02-02 10:05:10,048 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1042211778, now seen corresponding path program 1 times [2018-02-02 10:05:10,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:10,063 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:10,126 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:10,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:10,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:05:10,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:10,126 INFO L134 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:10,127 INFO L182 omatonBuilderFactory]: Interpolants [6113#true, 6114#false, 6115#(= (select |#valid| |create_data_#t~malloc3.base|) 1), 6116#(= (select |#valid| create_data_~data~0.base) 1), 6117#(and (not (= create_data_~data~0.base |create_data_#t~malloc4.base|)) (= 1 (select |#valid| |create_data_#t~malloc4.base|))), 6118#(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))))), 6119#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 6120#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 6121#(= 1 (select |#valid| |create_data_#t~mem7.base|))] [2018-02-02 10:05:10,127 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:10,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:10,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:10,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:10,127 INFO L87 Difference]: Start difference. First operand 277 states and 319 transitions. Second operand 9 states. [2018-02-02 10:05:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:10,501 INFO L93 Difference]: Finished difference Result 298 states and 339 transitions. [2018-02-02 10:05:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:10,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:05:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:10,503 INFO L225 Difference]: With dead ends: 298 [2018-02-02 10:05:10,503 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 10:05:10,503 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:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 10:05:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 276. [2018-02-02 10:05:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:05:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2018-02-02 10:05:10,510 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 39 [2018-02-02 10:05:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:10,510 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2018-02-02 10:05:10,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2018-02-02 10:05:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:05:10,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:10,511 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] [2018-02-02 10:05:10,511 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1042211777, now seen corresponding path program 1 times [2018-02-02 10:05:10,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:10,528 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:10,711 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:10,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:10,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:05:10,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:10,712 INFO L182 omatonBuilderFactory]: Interpolants [6704#true, 6705#false, 6706#(= (select |#valid| |create_data_#t~malloc3.base|) 1), 6707#(= (select |#valid| create_data_~data~0.base) 1), 6708#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc4.base|)) (= 0 |create_data_#t~malloc4.offset|)), 6709#(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))))), 6710#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (or (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))))) (< 4 (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0)))) (= |create_data_#t~mem7.offset| 0)), 6711#(or (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))))) (<= 2 create_data_~counter~0)), 6712#(or (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))))) (<= 3 create_data_~counter~0)), 6713#(and (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 1 create_data_~counter~0) (<= create_data_~counter~0 2) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 6714#(and (= 80 (select |#length| |create_data_#t~mem7.base|)) (= |create_data_#t~mem7.offset| 0) (<= 1 create_data_~counter~0) (<= create_data_~counter~0 2))] [2018-02-02 10:05:10,712 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:10,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:05:10,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:05:10,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:10,713 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand 11 states. [2018-02-02 10:05:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:11,158 INFO L93 Difference]: Finished difference Result 289 states and 327 transitions. [2018-02-02 10:05:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:05:11,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-02-02 10:05:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:11,159 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:05:11,159 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:05:11,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:05:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:05:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2018-02-02 10:05:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:05:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 309 transitions. [2018-02-02 10:05:11,164 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 309 transitions. Word has length 39 [2018-02-02 10:05:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:11,164 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 309 transitions. [2018-02-02 10:05:11,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:05:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 309 transitions. [2018-02-02 10:05:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:05:11,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:11,165 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:11,165 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1212747529, now seen corresponding path program 1 times [2018-02-02 10:05:11,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:11,175 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:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:05:11,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:11,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:11,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:11,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:11,195 INFO L182 omatonBuilderFactory]: Interpolants [7289#true, 7290#false, 7291#(= 1 (select |#valid| |create_data_#t~malloc24.base|)), 7292#(= 1 (select |#valid| create_data_~nextData~0.base))] [2018-02-02 10:05:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:05:11,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:11,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:11,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:11,195 INFO L87 Difference]: Start difference. First operand 269 states and 309 transitions. Second operand 4 states. [2018-02-02 10:05:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:11,317 INFO L93 Difference]: Finished difference Result 271 states and 303 transitions. [2018-02-02 10:05:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:11,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-02-02 10:05:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:11,318 INFO L225 Difference]: With dead ends: 271 [2018-02-02 10:05:11,318 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 10:05:11,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 10:05:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2018-02-02 10:05:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:05:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 297 transitions. [2018-02-02 10:05:11,325 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 297 transitions. Word has length 53 [2018-02-02 10:05:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:11,325 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 297 transitions. [2018-02-02 10:05:11,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 297 transitions. [2018-02-02 10:05:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:05:11,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:11,326 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:11,326 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1212747528, now seen corresponding path program 1 times [2018-02-02 10:05:11,327 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:11,343 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:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:05:11,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:11,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:11,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:11,391 INFO L134 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:11,391 INFO L182 omatonBuilderFactory]: Interpolants [7832#true, 7833#false, 7834#(and (= 0 |create_data_#t~malloc24.offset|) (= 16 (select |#length| |create_data_#t~malloc24.base|))), 7835#(and (= (select |#length| create_data_~nextData~0.base) 16) (= create_data_~nextData~0.offset 0))] [2018-02-02 10:05:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:05:11,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:11,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:11,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:11,392 INFO L87 Difference]: Start difference. First operand 265 states and 297 transitions. Second operand 4 states. [2018-02-02 10:05:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:11,518 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-02-02 10:05:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:11,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-02-02 10:05:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:11,519 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:05:11,519 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:05:11,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:05:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2018-02-02 10:05:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:05:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 285 transitions. [2018-02-02 10:05:11,524 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 285 transitions. Word has length 53 [2018-02-02 10:05:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:11,524 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 285 transitions. [2018-02-02 10:05:11,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 285 transitions. [2018-02-02 10:05:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:05:11,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:11,525 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:05:11,525 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1058644701, now seen corresponding path program 1 times [2018-02-02 10:05:11,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:11,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:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:11,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:11,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:05:11,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:11,558 INFO L134 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:11,558 INFO L182 omatonBuilderFactory]: Interpolants [8368#false, 8369#(= create_data_~counter~0 0), 8370#(<= create_data_~counter~0 1), 8367#true] [2018-02-02 10:05:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:11,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:11,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:11,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:11,559 INFO L87 Difference]: Start difference. First operand 261 states and 285 transitions. Second operand 4 states. [2018-02-02 10:05:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:11,572 INFO L93 Difference]: Finished difference Result 285 states and 309 transitions. [2018-02-02 10:05:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:11,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-02-02 10:05:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:11,573 INFO L225 Difference]: With dead ends: 285 [2018-02-02 10:05:11,573 INFO L226 Difference]: Without dead ends: 285 [2018-02-02 10:05:11,574 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:05:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-02 10:05:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2018-02-02 10:05:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 10:05:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 299 transitions. [2018-02-02 10:05:11,577 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 299 transitions. Word has length 54 [2018-02-02 10:05:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:11,578 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 299 transitions. [2018-02-02 10:05:11,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 299 transitions. [2018-02-02 10:05:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:05:11,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:11,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:11,579 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 962380090, now seen corresponding path program 2 times [2018-02-02 10:05:11,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:11,591 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:11,618 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:05:11,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:11,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:05:11,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:11,619 INFO L134 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:11,619 INFO L182 omatonBuilderFactory]: Interpolants [8931#true, 8932#false, 8933#(= create_data_~counter~0 0), 8934#(<= create_data_~counter~0 1), 8935#(<= create_data_~counter~0 2)] [2018-02-02 10:05:11,619 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:05:11,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:11,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:11,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:11,620 INFO L87 Difference]: Start difference. First operand 275 states and 299 transitions. Second operand 5 states. [2018-02-02 10:05:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:11,635 INFO L93 Difference]: Finished difference Result 289 states and 313 transitions. [2018-02-02 10:05:11,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:11,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-02-02 10:05:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:11,637 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:05:11,637 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:05:11,637 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:05:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:05:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-02-02 10:05:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 10:05:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 313 transitions. [2018-02-02 10:05:11,642 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 313 transitions. Word has length 61 [2018-02-02 10:05:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:11,642 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 313 transitions. [2018-02-02 10:05:11,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 313 transitions. [2018-02-02 10:05:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:05:11,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:11,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:11,643 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:11,643 INFO L82 PathProgramCache]: Analyzing trace with hash -574017475, now seen corresponding path program 3 times [2018-02-02 10:05:11,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:11,659 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:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:11,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:11,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:05:11,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:11,884 INFO L134 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:11,884 INFO L182 omatonBuilderFactory]: Interpolants [9520#(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|))))), 9521#(and (= 1 (select |#valid| |create_data_#t~malloc4.base|)) (= (store (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))) |#valid|) (or (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|)) (= (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))), 9522#(and (= |#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 (= 1 (select |#valid| (@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|))))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|))), 9514#true, 9515#false, 9516#(= 1 (select |#valid| |append_#t~malloc34.base|)), 9517#(= 1 (select |#valid| append_~node~0.base)), 9518#(= |#valid| |old(#valid)|), 9519#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|)] [2018-02-02 10:05:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:11,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:11,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:11,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:11,885 INFO L87 Difference]: Start difference. First operand 289 states and 313 transitions. Second operand 9 states. [2018-02-02 10:05:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:12,501 INFO L93 Difference]: Finished difference Result 316 states and 341 transitions. [2018-02-02 10:05:12,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:05:12,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-02-02 10:05:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:12,502 INFO L225 Difference]: With dead ends: 316 [2018-02-02 10:05:12,502 INFO L226 Difference]: Without dead ends: 316 [2018-02-02 10:05:12,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:05:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-02 10:05:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 304. [2018-02-02 10:05:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-02-02 10:05:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 333 transitions. [2018-02-02 10:05:12,506 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 333 transitions. Word has length 68 [2018-02-02 10:05:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:12,506 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 333 transitions. [2018-02-02 10:05:12,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 333 transitions. [2018-02-02 10:05:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:05:12,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:12,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:12,506 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:12,507 INFO L82 PathProgramCache]: Analyzing trace with hash -574017474, now seen corresponding path program 1 times [2018-02-02 10:05:12,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:12,525 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:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:12,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:12,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:05:12,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:12,738 INFO L134 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:12,738 INFO L182 omatonBuilderFactory]: Interpolants [10160#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 10161#(and (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 10162#(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|))))), 10163#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (or (= (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)))) (= (store (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|))) |#length|)), 10164#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= 80 (select |#length| (@diff |old(#length)| |#length|))) (= |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 (= 80 (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))))), 10165#(and (<= 8 (select |#length| append_~node~0.base)) (= append_~node~0.offset 0)), 10155#true, 10156#false, 10157#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 10158#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0)), 10159#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1))] [2018-02-02 10:05:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:12,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:05:12,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:05:12,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:12,739 INFO L87 Difference]: Start difference. First operand 304 states and 333 transitions. Second operand 11 states. [2018-02-02 10:05:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:13,222 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-02-02 10:05:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:05:13,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-02 10:05:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:13,223 INFO L225 Difference]: With dead ends: 313 [2018-02-02 10:05:13,223 INFO L226 Difference]: Without dead ends: 313 [2018-02-02 10:05:13,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:05:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-02 10:05:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 304. [2018-02-02 10:05:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-02-02 10:05:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 330 transitions. [2018-02-02 10:05:13,228 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 330 transitions. Word has length 68 [2018-02-02 10:05:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:13,229 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 330 transitions. [2018-02-02 10:05:13,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:05:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 330 transitions. [2018-02-02 10:05:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:05:13,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:13,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:13,230 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:13,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1874971636, now seen corresponding path program 1 times [2018-02-02 10:05:13,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:13,256 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:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:13,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:13,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:05:13,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:13,392 INFO L182 omatonBuilderFactory]: Interpolants [10789#true, 10790#false, 10791#(= 1 (select |#valid| append_~pointerToList.base)), 10792#(= |#valid| |old(#valid)|), 10793#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 10794#(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|))))), 10795#(and (= 1 (select |#valid| |create_data_#t~malloc4.base|)) (= (store (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))) |#valid|) (or (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|)) (= (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))), 10796#(and (= |#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 (= 1 (select |#valid| (@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|))))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)))] [2018-02-02 10:05:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:13,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:05:13,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:05:13,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:05:13,393 INFO L87 Difference]: Start difference. First operand 304 states and 330 transitions. Second operand 8 states. [2018-02-02 10:05:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:13,841 INFO L93 Difference]: Finished difference Result 309 states and 333 transitions. [2018-02-02 10:05:13,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:05:13,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-02-02 10:05:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:13,843 INFO L225 Difference]: With dead ends: 309 [2018-02-02 10:05:13,843 INFO L226 Difference]: Without dead ends: 309 [2018-02-02 10:05:13,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:05:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-02 10:05:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2018-02-02 10:05:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-02-02 10:05:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 333 transitions. [2018-02-02 10:05:13,847 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 333 transitions. Word has length 70 [2018-02-02 10:05:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:13,847 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 333 transitions. [2018-02-02 10:05:13,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:05:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 333 transitions. [2018-02-02 10:05:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:05:13,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:13,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:13,847 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1874971635, now seen corresponding path program 1 times [2018-02-02 10:05:13,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:13,859 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:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:14,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:14,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:05:14,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:14,052 INFO L134 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:14,052 INFO L182 omatonBuilderFactory]: Interpolants [11424#(= 0 |append_#in~pointerToList.offset|), 11425#(= append_~pointerToList.offset 0), 11426#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= 1 (select |#valid| append_~pointerToList.base))), 11427#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 11428#(and (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 11429#(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|))))), 11430#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (or (= (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)))) (= (store (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|))) |#length|)), 11431#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= 80 (select |#length| (@diff |old(#length)| |#length|))) (= |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 (= 80 (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))))), 11432#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 11421#true, 11422#false, 11423#(= 0 |main_~#list~0.offset|)] [2018-02-02 10:05:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:14,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:05:14,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:05:14,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:05:14,052 INFO L87 Difference]: Start difference. First operand 307 states and 333 transitions. Second operand 12 states. [2018-02-02 10:05:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:14,525 INFO L93 Difference]: Finished difference Result 306 states and 330 transitions. [2018-02-02 10:05:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:05:14,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-02-02 10:05:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:14,526 INFO L225 Difference]: With dead ends: 306 [2018-02-02 10:05:14,526 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 10:05:14,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:05:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 10:05:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-02-02 10:05:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 10:05:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 330 transitions. [2018-02-02 10:05:14,532 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 330 transitions. Word has length 70 [2018-02-02 10:05:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:14,532 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 330 transitions. [2018-02-02 10:05:14,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:05:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 330 transitions. [2018-02-02 10:05:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:05:14,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:14,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:14,533 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1230059536, now seen corresponding path program 1 times [2018-02-02 10:05:14,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:14,546 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:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:14,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:14,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:14,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:14,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:05:14,590 INFO L182 omatonBuilderFactory]: Interpolants [12064#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 12065#(= 1 (select |#valid| |main_~#list~0.base|)), 12061#true, 12062#false, 12063#(= append_~pointerToList.base |append_#in~pointerToList.base|)] [2018-02-02 10:05:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:14,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:14,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:14,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:14,591 INFO L87 Difference]: Start difference. First operand 306 states and 330 transitions. Second operand 5 states. [2018-02-02 10:05:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:14,744 INFO L93 Difference]: Finished difference Result 305 states and 329 transitions. [2018-02-02 10:05:14,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:14,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-02-02 10:05:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:14,746 INFO L225 Difference]: With dead ends: 305 [2018-02-02 10:05:14,746 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 10:05:14,746 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:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 10:05:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-02-02 10:05:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 10:05:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 329 transitions. [2018-02-02 10:05:14,750 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 329 transitions. Word has length 73 [2018-02-02 10:05:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:14,750 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 329 transitions. [2018-02-02 10:05:14,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 329 transitions. [2018-02-02 10:05:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:05:14,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:14,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:14,752 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1230059535, now seen corresponding path program 1 times [2018-02-02 10:05:14,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:14,769 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:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:14,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:14,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:05:14,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:14,862 INFO L134 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:14,862 INFO L182 omatonBuilderFactory]: Interpolants [12678#true, 12679#false, 12680#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 12681#(and (or (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~pointerToList.offset 0))) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 12682#(or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0))), 12683#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|)))] [2018-02-02 10:05:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:14,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:05:14,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:05:14,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:05:14,863 INFO L87 Difference]: Start difference. First operand 305 states and 329 transitions. Second operand 6 states. [2018-02-02 10:05:15,016 WARN L143 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-02 10:05:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:15,240 INFO L93 Difference]: Finished difference Result 300 states and 324 transitions. [2018-02-02 10:05:15,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:15,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-02-02 10:05:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:15,242 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:05:15,242 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:05:15,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:05:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2018-02-02 10:05:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 10:05:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 324 transitions. [2018-02-02 10:05:15,248 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 324 transitions. Word has length 73 [2018-02-02 10:05:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:15,248 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 324 transitions. [2018-02-02 10:05:15,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:05:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 324 transitions. [2018-02-02 10:05:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:05:15,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:15,249 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, 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:15,249 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:15,249 INFO L82 PathProgramCache]: Analyzing trace with hash 522860177, now seen corresponding path program 1 times [2018-02-02 10:05:15,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:15,262 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:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:15,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:15,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:05:15,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:15,315 INFO L134 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:15,315 INFO L182 omatonBuilderFactory]: Interpolants [13286#true, 13287#false, 13288#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 13289#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 13290#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 13291#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 13292#(= 1 (select |#valid| |main_#t~mem47.base|))] [2018-02-02 10:05:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:15,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:15,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:15,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:15,316 INFO L87 Difference]: Start difference. First operand 300 states and 324 transitions. Second operand 7 states. [2018-02-02 10:05:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:15,512 INFO L93 Difference]: Finished difference Result 314 states and 340 transitions. [2018-02-02 10:05:15,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:05:15,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-02-02 10:05:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:15,513 INFO L225 Difference]: With dead ends: 314 [2018-02-02 10:05:15,513 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 10:05:15,513 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:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 10:05:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 299. [2018-02-02 10:05:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 10:05:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 323 transitions. [2018-02-02 10:05:15,516 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 323 transitions. Word has length 74 [2018-02-02 10:05:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:15,516 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 323 transitions. [2018-02-02 10:05:15,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 323 transitions. [2018-02-02 10:05:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:05:15,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:15,517 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, 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:15,517 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:15,517 INFO L82 PathProgramCache]: Analyzing trace with hash 522860178, now seen corresponding path program 1 times [2018-02-02 10:05:15,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:15,526 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:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:15,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:15,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:05:15,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:15,656 INFO L134 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:15,657 INFO L182 omatonBuilderFactory]: Interpolants [13920#(and (<= 4 (select |#length| |main_#t~mem47.base|)) (= |main_#t~mem47.offset| 0)), 13912#true, 13913#false, 13914#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 13915#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 13916#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0)), 13917#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (<= (+ append_~node~0.offset 4) (select |#length| append_~node~0.base)) (= append_~node~0.offset 0)), 13918#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 13919#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-02 10:05:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:15,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:15,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:15,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:15,657 INFO L87 Difference]: Start difference. First operand 299 states and 323 transitions. Second operand 9 states. [2018-02-02 10:05:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:15,880 INFO L93 Difference]: Finished difference Result 323 states and 349 transitions. [2018-02-02 10:05:15,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:05:15,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-02-02 10:05:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:15,881 INFO L225 Difference]: With dead ends: 323 [2018-02-02 10:05:15,881 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 10:05:15,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:05:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 10:05:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 298. [2018-02-02 10:05:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 10:05:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 322 transitions. [2018-02-02 10:05:15,884 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 322 transitions. Word has length 74 [2018-02-02 10:05:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:15,884 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 322 transitions. [2018-02-02 10:05:15,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 322 transitions. [2018-02-02 10:05:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:05:15,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:15,885 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, 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:15,885 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:15,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2069402327, now seen corresponding path program 1 times [2018-02-02 10:05:15,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:15,893 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:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:15,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:15,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:15,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:15,913 INFO L134 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:15,913 INFO L182 omatonBuilderFactory]: Interpolants [14560#(= 1 (select |#valid| |main_#t~mem49.base|)), 14556#true, 14557#false, 14558#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 14559#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 10:05:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:15,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:15,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:15,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:15,913 INFO L87 Difference]: Start difference. First operand 298 states and 322 transitions. Second operand 5 states. [2018-02-02 10:05:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:16,062 INFO L93 Difference]: Finished difference Result 313 states and 339 transitions. [2018-02-02 10:05:16,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:16,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-02-02 10:05:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:16,064 INFO L225 Difference]: With dead ends: 313 [2018-02-02 10:05:16,064 INFO L226 Difference]: Without dead ends: 313 [2018-02-02 10:05:16,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-02 10:05:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2018-02-02 10:05:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:05:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 321 transitions. [2018-02-02 10:05:16,068 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 321 transitions. Word has length 78 [2018-02-02 10:05:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:16,069 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 321 transitions. [2018-02-02 10:05:16,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 321 transitions. [2018-02-02 10:05:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:05:16,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:16,070 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, 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:16,070 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2069402328, now seen corresponding path program 1 times [2018-02-02 10:05:16,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:16,108 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:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:16,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:16,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:05:16,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:16,214 INFO L134 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:16,214 INFO L182 omatonBuilderFactory]: Interpolants [15184#(and (<= (+ |main_#t~mem49.offset| 4) (select |#length| |main_#t~mem49.base|)) (<= 0 |main_#t~mem49.offset|)), 15175#true, 15176#false, 15177#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 15178#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 15179#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 15180#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 15181#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 15182#(and (= |main_#t~mem47.offset| 0) (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 15183#(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|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-02 10:05:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:16,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:05:16,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:05:16,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:05:16,215 INFO L87 Difference]: Start difference. First operand 297 states and 321 transitions. Second operand 10 states. [2018-02-02 10:05:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:16,449 INFO L93 Difference]: Finished difference Result 322 states and 348 transitions. [2018-02-02 10:05:16,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:05:16,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-02-02 10:05:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:16,450 INFO L225 Difference]: With dead ends: 322 [2018-02-02 10:05:16,450 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 10:05:16,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:05:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 10:05:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 296. [2018-02-02 10:05:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 10:05:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 320 transitions. [2018-02-02 10:05:16,454 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 320 transitions. Word has length 78 [2018-02-02 10:05:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:16,454 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 320 transitions. [2018-02-02 10:05:16,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:05:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 320 transitions. [2018-02-02 10:05:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:05:16,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:16,455 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, 1, 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:16,455 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash -273037161, now seen corresponding path program 1 times [2018-02-02 10:05:16,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:16,472 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:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:16,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:16,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 10:05:16,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:16,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:16,716 INFO L182 omatonBuilderFactory]: Interpolants [15818#true, 15819#false, 15820#(= (select |#valid| |main_~#list~0.base|) 1), 15821#(= |#valid| |old(#valid)|), 15822#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 15823#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 15824#(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_~pointerToList.base append_~node~0.base)))), 15825#(= 1 (select |#valid| create_data_~data~0.base)), 15826#(= 1 (select |#valid| create_data_~origData~0.base)), 15827#(= 1 (select |#valid| |create_data_#res.base|)), 15828#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| |append_#t~ret38.base|)) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 15829#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~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)))))), 15830#(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|))))), 15831#(= 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|)))), 15832#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 15833#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem49.base|) |main_#t~mem49.offset|))), 15834#(= 1 (select |#valid| |main_#t~mem50.base|))] [2018-02-02 10:05:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:16,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:05:16,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:05:16,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:05:16,717 INFO L87 Difference]: Start difference. First operand 296 states and 320 transitions. Second operand 17 states. [2018-02-02 10:05:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:17,514 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2018-02-02 10:05:17,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:05:17,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-02-02 10:05:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:17,516 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:05:17,516 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 10:05:17,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:05:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 10:05:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 300. [2018-02-02 10:05:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 10:05:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 329 transitions. [2018-02-02 10:05:17,521 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 329 transitions. Word has length 79 [2018-02-02 10:05:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:17,522 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 329 transitions. [2018-02-02 10:05:17,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:05:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 329 transitions. [2018-02-02 10:05:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:05:17,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:17,523 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, 1, 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:17,523 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash -273037160, now seen corresponding path program 1 times [2018-02-02 10:05:17,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:17,540 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:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:17,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:17,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:05:17,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:17,885 INFO L182 omatonBuilderFactory]: Interpolants [16512#(= (select |#valid| |main_~#list~0.base|) 1), 16513#(= |#valid| |old(#valid)|), 16514#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 16515#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 16516#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 16517#(= 0 |create_data_#t~malloc3.offset|), 16518#(= 0 create_data_~data~0.offset), 16519#(and (= 0 create_data_~data~0.offset) (<= (+ create_data_~data~0.offset 16) (select |#length| create_data_~data~0.base))), 16520#(and (= 0 create_data_~origData~0.offset) (<= 16 (select |#length| create_data_~origData~0.base))), 16521#(and (<= 16 (select |#length| |create_data_#res.base|)) (= 0 |create_data_#res.offset|)), 16522#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret38.offset|) (<= 16 (select |#length| |append_#t~ret38.base|))) (= append_~pointerToList.base append_~node~0.base))), 16523#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~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)) (<= 16 (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)))))), 16524#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (<= 16 (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|))))), 16525#(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|))) (<= 16 (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|))))), 16526#(and (<= 16 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 16527#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem49.base|) |main_#t~mem49.offset|)) (<= 16 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem49.base|) |main_#t~mem49.offset|)))), 16528#(and (<= 16 (select |#length| |main_#t~mem50.base|)) (= |main_#t~mem50.offset| 0)), 16510#true, 16511#false] [2018-02-02 10:05:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:17,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:05:17,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:05:17,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:05:17,886 INFO L87 Difference]: Start difference. First operand 300 states and 329 transitions. Second operand 19 states. [2018-02-02 10:05:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:18,711 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2018-02-02 10:05:18,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:05:18,711 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2018-02-02 10:05:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:18,713 INFO L225 Difference]: With dead ends: 346 [2018-02-02 10:05:18,713 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 10:05:18,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:05:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 10:05:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 300. [2018-02-02 10:05:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 10:05:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 328 transitions. [2018-02-02 10:05:18,719 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 328 transitions. Word has length 79 [2018-02-02 10:05:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:18,719 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 328 transitions. [2018-02-02 10:05:18,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:05:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 328 transitions. [2018-02-02 10:05:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:05:18,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:18,720 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:18,720 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1496786919, now seen corresponding path program 1 times [2018-02-02 10:05:18,721 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:18,736 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:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:18,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:18,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:05:18,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:18,835 INFO L134 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:18,835 INFO L182 omatonBuilderFactory]: Interpolants [17209#true, 17210#false, 17211#(= 1 (select |#valid| |create_data_#t~malloc24.base|)), 17212#(= 1 (select |#valid| create_data_~nextData~0.base)), 17213#(= 1 (select |#valid| create_data_~data~0.base)), 17214#(or (= create_data_~data~0.base |create_data_#t~malloc24.base|) (= 1 (select |#valid| create_data_~data~0.base))), 17215#(or (= 1 (select |#valid| create_data_~data~0.base)) (= create_data_~data~0.base create_data_~nextData~0.base))] [2018-02-02 10:05:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:18,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:05:18,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:05:18,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:18,836 INFO L87 Difference]: Start difference. First operand 300 states and 328 transitions. Second operand 7 states. [2018-02-02 10:05:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:19,055 INFO L93 Difference]: Finished difference Result 301 states and 328 transitions. [2018-02-02 10:05:19,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:19,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-02-02 10:05:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:19,057 INFO L225 Difference]: With dead ends: 301 [2018-02-02 10:05:19,057 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 10:05:19,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 10:05:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-02-02 10:05:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 10:05:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 326 transitions. [2018-02-02 10:05:19,062 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 326 transitions. Word has length 83 [2018-02-02 10:05:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:19,062 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 326 transitions. [2018-02-02 10:05:19,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:05:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 326 transitions. [2018-02-02 10:05:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:05:19,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:19,063 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:19,063 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1496786920, now seen corresponding path program 1 times [2018-02-02 10:05:19,064 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:19,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:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:19,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:19,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:05:19,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:19,147 INFO L134 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:19,147 INFO L182 omatonBuilderFactory]: Interpolants [17824#(and (= 16 (select |#length| create_data_~nextData~0.base)) (= 0 create_data_~nextData~0.offset)), 17825#(and (= create_data_~data~0.offset 0) (= 16 (select |#length| create_data_~data~0.base))), 17821#true, 17822#false, 17823#(and (= 0 |create_data_#t~malloc24.offset|) (= 16 (select |#length| |create_data_#t~malloc24.base|)))] [2018-02-02 10:05:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:19,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:19,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:19,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:19,148 INFO L87 Difference]: Start difference. First operand 299 states and 326 transitions. Second operand 5 states. [2018-02-02 10:05:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:19,317 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2018-02-02 10:05:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:19,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-02-02 10:05:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:19,318 INFO L225 Difference]: With dead ends: 301 [2018-02-02 10:05:19,318 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 10:05:19,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:05:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 10:05:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2018-02-02 10:05:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 10:05:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 300 transitions. [2018-02-02 10:05:19,323 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 300 transitions. Word has length 83 [2018-02-02 10:05:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:19,324 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 300 transitions. [2018-02-02 10:05:19,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 300 transitions. [2018-02-02 10:05:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:05:19,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:19,324 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 10:05:19,325 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1495899267, now seen corresponding path program 1 times [2018-02-02 10:05:19,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:19,350 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:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:20,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:20,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:05:20,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:20,104 INFO L182 omatonBuilderFactory]: Interpolants [18409#true, 18410#false, 18411#(= 1 (select |#valid| |append_#t~malloc34.base|)), 18412#(= 1 (select |#valid| append_~node~0.base)), 18413#(= |#valid| |old(#valid)|), 18414#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 18415#(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|))))), 18416#(and (= 1 (select |#valid| |create_data_#t~malloc4.base|)) (= (store (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))) |#valid|) (or (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|)) (= (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))), 18417#(and (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.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|))))) (= |#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 (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)))), 18418#(and (= |#valid| (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)))) (or (= create_data_~data~0.base (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)) (= |#valid| (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|)))) (= 1 (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)))) (or (= |#valid| (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|))) (= 1 (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|)))), 18419#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= create_data_~nextData~0.base (@diff |old(#valid)| |#valid|))) (or (= |#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|)))) (= create_data_~data~0.base (@diff (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|))) |#valid|)) (= create_data_~nextData~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= create_data_~nextData~0.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|)))))), 18420#(and (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.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|))))) (or (= |#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|)))) (= create_data_~data~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (= 1 (select |#valid| create_data_~nextData~0.base)) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)))), 18421#(and (or (= 1 (select |#valid| (@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|))))) (or (= |#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|)))) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= 1 (select |#valid| create_data_~nextData~0.base))), 18422#(and (or (= 1 (select |#valid| (@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|))))) (or (= |#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|)))) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)))] [2018-02-02 10:05:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:20,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:05:20,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:05:20,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:05:20,106 INFO L87 Difference]: Start difference. First operand 277 states and 300 transitions. Second operand 14 states. [2018-02-02 10:05:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:21,323 INFO L93 Difference]: Finished difference Result 336 states and 364 transitions. [2018-02-02 10:05:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:05:21,323 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-02-02 10:05:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:21,325 INFO L225 Difference]: With dead ends: 336 [2018-02-02 10:05:21,325 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 10:05:21,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 10:05:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 315. [2018-02-02 10:05:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 10:05:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 342 transitions. [2018-02-02 10:05:21,331 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 342 transitions. Word has length 83 [2018-02-02 10:05:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:21,331 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 342 transitions. [2018-02-02 10:05:21,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:05:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 342 transitions. [2018-02-02 10:05:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:05:21,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:21,332 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 10:05:21,332 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1495899268, now seen corresponding path program 1 times [2018-02-02 10:05:21,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:21,369 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:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:21,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:21,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:05:21,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:21,816 INFO L134 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:21,816 INFO L182 omatonBuilderFactory]: Interpolants [19092#true, 19093#false, 19094#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= (select |#valid| |append_#t~malloc34.base|) 1) (= 0 |append_#t~malloc34.offset|)), 19095#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1)), 19096#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 19097#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 19098#(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|)))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 19099#(and (or (= (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)))) (= 0 (select |old(#valid)| |create_data_#t~malloc4.base|)) (= (store (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|))) |#length|)), 19100#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#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|))))), 19101#(and (or (= |#length| (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|)))) (or (= (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (= 0 (select |old(#valid)| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|)))) (= |#length| (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|)))) (= 16 (select |#length| |create_data_#t~malloc24.base|))), 19102#(and (or (= 16 (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= 16 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|)))) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= 16 (select |#length| (@diff (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|))) |#length|))))), 19103#(and (<= 8 (select |#length| append_~node~0.base)) (= append_~node~0.offset 0))] [2018-02-02 10:05:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:21,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:05:21,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:05:21,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:05:21,817 INFO L87 Difference]: Start difference. First operand 315 states and 342 transitions. Second operand 12 states. [2018-02-02 10:05:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:22,688 INFO L93 Difference]: Finished difference Result 338 states and 367 transitions. [2018-02-02 10:05:22,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:05:22,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2018-02-02 10:05:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:22,689 INFO L225 Difference]: With dead ends: 338 [2018-02-02 10:05:22,689 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 10:05:22,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:05:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 10:05:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 315. [2018-02-02 10:05:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 10:05:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 340 transitions. [2018-02-02 10:05:22,693 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 340 transitions. Word has length 83 [2018-02-02 10:05:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:22,693 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 340 transitions. [2018-02-02 10:05:22,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:05:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 340 transitions. [2018-02-02 10:05:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:05:22,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:22,694 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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:05:22,694 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1254840622, now seen corresponding path program 1 times [2018-02-02 10:05:22,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:22,711 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:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:23,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:23,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:05:23,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:23,310 INFO L134 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:23,310 INFO L182 omatonBuilderFactory]: Interpolants [19763#true, 19764#false, 19765#(= 1 (select |#valid| append_~pointerToList.base)), 19766#(= |#valid| |old(#valid)|), 19767#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 19768#(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|))))), 19769#(and (= 1 (select |#valid| |create_data_#t~malloc4.base|)) (= (store (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))) |#valid|) (or (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|)) (= (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))), 19770#(and (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.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|))))) (= |#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 (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)))), 19771#(and (= |#valid| (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)))) (or (= create_data_~data~0.base (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)) (= |#valid| (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|)))) (= 1 (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)))) (or (= |#valid| (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|))) (= 1 (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|)))), 19772#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= create_data_~nextData~0.base (@diff |old(#valid)| |#valid|))) (or (= |#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|)))) (= create_data_~data~0.base (@diff (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|))) |#valid|)) (= create_data_~nextData~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= create_data_~nextData~0.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|)))))), 19773#(and (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.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|))))) (or (= |#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|)))) (= create_data_~data~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)))), 19774#(and (or (= 1 (select |#valid| (@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|))))) (or (= |#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|)))) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)))] [2018-02-02 10:05:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:23,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:05:23,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:05:23,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:05:23,311 INFO L87 Difference]: Start difference. First operand 315 states and 340 transitions. Second operand 12 states. [2018-02-02 10:05:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:24,221 INFO L93 Difference]: Finished difference Result 329 states and 355 transitions. [2018-02-02 10:05:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:05:24,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-02-02 10:05:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:24,222 INFO L225 Difference]: With dead ends: 329 [2018-02-02 10:05:24,222 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 10:05:24,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:05:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 10:05:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 319. [2018-02-02 10:05:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-02 10:05:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 346 transitions. [2018-02-02 10:05:24,226 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 346 transitions. Word has length 85 [2018-02-02 10:05:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:24,226 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 346 transitions. [2018-02-02 10:05:24,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:05:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 346 transitions. [2018-02-02 10:05:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:05:24,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:24,227 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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:05:24,227 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1254840621, now seen corresponding path program 1 times [2018-02-02 10:05:24,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:24,254 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:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:24,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:24,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:05:24,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:24,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:05:24,781 INFO L182 omatonBuilderFactory]: Interpolants [20448#(and (or (= 16 (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= 16 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|)))) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= 16 (select |#length| (@diff (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|))) |#length|))))), 20449#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 20436#true, 20437#false, 20438#(= 0 |main_~#list~0.offset|), 20439#(= 0 |append_#in~pointerToList.offset|), 20440#(= append_~pointerToList.offset 0), 20441#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= 1 (select |#valid| append_~pointerToList.base))), 20442#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 20443#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|) (= 16 (select |#length| |create_data_#t~malloc3.base|)) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 20444#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (and (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= (select |#valid| create_data_~data~0.base) 1) (= 16 (select |#length| create_data_~data~0.base))) (= |old(#length)| |#length|)) (or (and (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= (select |#valid| create_data_~data~0.base) 1) (= 16 (select |#length| create_data_~data~0.base))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 20445#(and (or (and (= create_data_~data~0.base (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) (= 16 (select |#length| create_data_~data~0.base))) (= (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) (or (= 0 (select |old(#valid)| |create_data_#t~malloc4.base|)) (and (= create_data_~data~0.base |create_data_#t~malloc4.base|) (= 16 (select |#length| create_data_~data~0.base)))) (= (store (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|))) |#length|)), 20446#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (and (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= 1 (select |#valid| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))) (= |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 (and (= 1 (select |#valid| create_data_~data~0.base)) (= create_data_~data~0.base (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) (= 16 (select |#length| create_data_~data~0.base))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))))), 20447#(and (or (= (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (= 0 (select |old(#valid)| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))) (and (= create_data_~data~0.base (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|)) (= 16 (select |#length| create_data_~data~0.base)))) (= |#length| (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|)))) (or (= |#length| (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|))) (and (= create_data_~data~0.base (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|)) (= 16 (select |#length| create_data_~data~0.base))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|)))) (= 16 (select |#length| |create_data_#t~malloc24.base|)))] [2018-02-02 10:05:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:24,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:05:24,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:05:24,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:05:24,781 INFO L87 Difference]: Start difference. First operand 319 states and 346 transitions. Second operand 14 states. [2018-02-02 10:05:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:25,625 INFO L93 Difference]: Finished difference Result 328 states and 353 transitions. [2018-02-02 10:05:25,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:05:25,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-02-02 10:05:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:25,626 INFO L225 Difference]: With dead ends: 328 [2018-02-02 10:05:25,626 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 10:05:25,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:05:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 10:05:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 307. [2018-02-02 10:05:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-02-02 10:05:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 332 transitions. [2018-02-02 10:05:25,629 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 332 transitions. Word has length 85 [2018-02-02 10:05:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:25,629 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 332 transitions. [2018-02-02 10:05:25,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:05:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 332 transitions. [2018-02-02 10:05:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:05:25,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:25,630 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,630 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1604659804, now seen corresponding path program 1 times [2018-02-02 10:05:25,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:25,641 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:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:25,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:25,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:05:25,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:25,693 INFO L182 omatonBuilderFactory]: Interpolants [21107#true, 21108#false, 21109#(not |main_#t~short52|), 21110#(= main_~dataNotFinished~0 0), 21111#(not |main_#t~short46|)] [2018-02-02 10:05:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:25,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:25,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:25,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:25,694 INFO L87 Difference]: Start difference. First operand 307 states and 332 transitions. Second operand 5 states. [2018-02-02 10:05:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:25,712 INFO L93 Difference]: Finished difference Result 360 states and 392 transitions. [2018-02-02 10:05:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:05:25,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-02-02 10:05:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:25,713 INFO L225 Difference]: With dead ends: 360 [2018-02-02 10:05:25,713 INFO L226 Difference]: Without dead ends: 360 [2018-02-02 10:05:25,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-02-02 10:05:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 310. [2018-02-02 10:05:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 10:05:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 335 transitions. [2018-02-02 10:05:25,718 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 335 transitions. Word has length 86 [2018-02-02 10:05:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:25,718 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 335 transitions. [2018-02-02 10:05:25,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 335 transitions. [2018-02-02 10:05:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:05:25,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:25,719 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,719 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash 795313178, now seen corresponding path program 1 times [2018-02-02 10:05:25,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:25,733 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:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:25,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:25,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:05:25,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:25,973 INFO L134 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:25,973 INFO L182 omatonBuilderFactory]: Interpolants [21792#(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_~pointerToList.base append_~node~0.base)))), 21793#(not (= |create_data_#t~malloc3.base| 0)), 21794#(not (= create_data_~data~0.base 0)), 21795#(not (= create_data_~origData~0.base 0)), 21796#(not (= |create_data_#res.base| 0)), 21797#(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_~pointerToList.base append_~node~0.base))) (not (= |append_#t~ret38.base| 0))), 21798#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~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) append_~node~0.offset) 0))))), 21799#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= (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))), 21800#(not (= (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)), 21801#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 21802#(not (= |main_#t~mem48.base| 0)), 21803#|main_#t~short52|, 21786#true, 21787#false, 21788#(= (select |#valid| |main_~#list~0.base|) 1), 21789#(= |#valid| |old(#valid)|), 21790#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 21791#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|)))] [2018-02-02 10:05:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:25,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:05:25,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:05:25,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:05:25,973 INFO L87 Difference]: Start difference. First operand 310 states and 335 transitions. Second operand 18 states. [2018-02-02 10:05:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:26,833 INFO L93 Difference]: Finished difference Result 359 states and 386 transitions. [2018-02-02 10:05:26,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:05:26,833 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2018-02-02 10:05:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:26,834 INFO L225 Difference]: With dead ends: 359 [2018-02-02 10:05:26,834 INFO L226 Difference]: Without dead ends: 359 [2018-02-02 10:05:26,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:05:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-02 10:05:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 310. [2018-02-02 10:05:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 10:05:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 334 transitions. [2018-02-02 10:05:26,837 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 334 transitions. Word has length 86 [2018-02-02 10:05:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:26,837 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 334 transitions. [2018-02-02 10:05:26,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:05:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 334 transitions. [2018-02-02 10:05:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 10:05:26,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:26,838 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,838 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1478778326, now seen corresponding path program 1 times [2018-02-02 10:05:26,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:26,873 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:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:27,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:27,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:05:27,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:27,006 INFO L134 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:27,006 INFO L182 omatonBuilderFactory]: Interpolants [22512#false, 22513#(= 0 |main_~#list~0.offset|), 22514#(= append_~pointerToList.base |append_#in~pointerToList.base|), 22515#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= 1 (select |#valid| |main_~#list~0.base|))), 22516#(and (<= 4 (select |#length| |main_~#list~0.base|)) (or (= main_~dataNotFinished~0 0) (= main_~dataNotFinished~0 (select |#valid| |main_~#list~0.base|))) (= 0 |main_~#list~0.offset|)), 22517#(and (or (not |main_#t~short46|) (and (<= 4 (select |#length| |main_~#list~0.base|)) (not (= (select |#valid| |main_~#list~0.base|) 0)))) (= 0 |main_~#list~0.offset|)), 22518#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (not (= (select |#valid| |main_~#list~0.base|) 0))), 22519#(and (<= 4 (select |#length| |append_#in~pointerToList.base|)) (= 0 |append_#in~pointerToList.offset|) (not (= (select |#valid| |append_#in~pointerToList.base|) 0))), 22520#(and (<= 4 (select |#length| append_~pointerToList.base)) (not (= (select |#valid| append_~pointerToList.base) 0)) (= append_~pointerToList.offset 0)), 22521#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 22511#true] [2018-02-02 10:05:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:27,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:05:27,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:05:27,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:27,007 INFO L87 Difference]: Start difference. First operand 310 states and 334 transitions. Second operand 11 states. [2018-02-02 10:05:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:27,227 INFO L93 Difference]: Finished difference Result 324 states and 350 transitions. [2018-02-02 10:05:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:05:27,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-02-02 10:05:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:27,228 INFO L225 Difference]: With dead ends: 324 [2018-02-02 10:05:27,228 INFO L226 Difference]: Without dead ends: 324 [2018-02-02 10:05:27,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:05:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-02 10:05:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 309. [2018-02-02 10:05:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 10:05:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 333 transitions. [2018-02-02 10:05:27,231 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 333 transitions. Word has length 90 [2018-02-02 10:05:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:27,232 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 333 transitions. [2018-02-02 10:05:27,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:05:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 333 transitions. [2018-02-02 10:05:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:05:27,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:27,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,233 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1218787216, now seen corresponding path program 1 times [2018-02-02 10:05:27,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:27,241 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:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:27,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:27,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:27,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:27,287 INFO L134 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:27,287 INFO L182 omatonBuilderFactory]: Interpolants [23159#true, 23160#false, 23161#|main_#t~short46|] [2018-02-02 10:05:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:27,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:05:27,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:05:27,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:27,288 INFO L87 Difference]: Start difference. First operand 309 states and 333 transitions. Second operand 3 states. [2018-02-02 10:05:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:27,291 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2018-02-02 10:05:27,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:05:27,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-02-02 10:05:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:27,292 INFO L225 Difference]: With dead ends: 310 [2018-02-02 10:05:27,292 INFO L226 Difference]: Without dead ends: 310 [2018-02-02 10:05:27,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-02-02 10:05:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-02-02 10:05:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 10:05:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 334 transitions. [2018-02-02 10:05:27,295 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 334 transitions. Word has length 89 [2018-02-02 10:05:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:27,295 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 334 transitions. [2018-02-02 10:05:27,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:05:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 334 transitions. [2018-02-02 10:05:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:05:27,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:27,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,296 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash 556220146, now seen corresponding path program 1 times [2018-02-02 10:05:27,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:27,304 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:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:27,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:27,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:27,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:27,327 INFO L134 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:27,327 INFO L182 omatonBuilderFactory]: Interpolants [23782#true, 23783#false, 23784#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 23785#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 23786#(= 1 (select |#valid| |main_#t~mem53.base|))] [2018-02-02 10:05:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:27,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:27,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:27,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:27,328 INFO L87 Difference]: Start difference. First operand 310 states and 334 transitions. Second operand 5 states. [2018-02-02 10:05:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:27,457 INFO L93 Difference]: Finished difference Result 324 states and 350 transitions. [2018-02-02 10:05:27,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:27,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-02-02 10:05:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:27,458 INFO L225 Difference]: With dead ends: 324 [2018-02-02 10:05:27,458 INFO L226 Difference]: Without dead ends: 324 [2018-02-02 10:05:27,458 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:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-02 10:05:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 315. [2018-02-02 10:05:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 10:05:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 341 transitions. [2018-02-02 10:05:27,461 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 341 transitions. Word has length 89 [2018-02-02 10:05:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:27,461 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 341 transitions. [2018-02-02 10:05:27,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 341 transitions. [2018-02-02 10:05:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:05:27,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:27,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,462 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash 556220147, now seen corresponding path program 1 times [2018-02-02 10:05:27,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:27,514 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:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:05:28,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:28,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:05:28,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:28,144 INFO L182 omatonBuilderFactory]: Interpolants [24448#(and (= (select |#length| |main_#t~mem49.base|) 8) (<= 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|) 0) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 24449#(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|)))), 24450#(and (<= (+ |main_#t~mem53.offset| 8) (select |#length| |main_#t~mem53.base|)) (<= 0 |main_#t~mem53.offset|)), 24430#true, 24431#false, 24432#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 24433#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| |append_#t~malloc34.base|)) (= (select |#valid| |append_#t~malloc34.base|) 1) (= 0 |append_#t~malloc34.offset|)), 24434#(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))), 24435#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 1 (select |#valid| append_~pointerToList.base)) (= 8 (select |#length| append_~node~0.base)) (= (select |#valid| append_~pointerToList.base) (select |#valid| append_~node~0.base))), 24436#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 24437#(and (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 24438#(and (or (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24439#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (or (= create_data_~data~0.base (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) (= (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) (= 0 (select |old(#valid)| |create_data_#t~malloc4.base|)) (= (store (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|))) |#length|)), 24440#(and (or (and (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) (or (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= create_data_~data~0.base (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#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 (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (and (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)) (@diff |old(#length)| |#length|)) (or (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))))) (= |old(#length)| |#length|))), 24441#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#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 (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (and (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)) (@diff |old(#length)| |#length|)) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (= 0 (select |old(#valid)| |create_data_#t~mem7.base|)) (= create_data_~data~0.base |create_data_#t~mem7.base|))) (= |old(#length)| |#length|)) (or (and (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (= 0 (select |old(#valid)| |create_data_#t~mem7.base|)) (= create_data_~data~0.base |create_data_#t~mem7.base|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= create_data_~data~0.base (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))), 24442#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| create_data_~data~0.base)) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#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|))))), 24443#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#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|))))), 24444#(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))), 24445#(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|)))), 24446#(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|))), 24447#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem47.offset| 0) (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 10:05:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:05:28,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:05:28,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:05:28,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:05:28,145 INFO L87 Difference]: Start difference. First operand 315 states and 341 transitions. Second operand 21 states. [2018-02-02 10:05:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:29,492 INFO L93 Difference]: Finished difference Result 395 states and 433 transitions. [2018-02-02 10:05:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:05:29,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-02-02 10:05:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:29,493 INFO L225 Difference]: With dead ends: 395 [2018-02-02 10:05:29,493 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 10:05:29,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:05:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 10:05:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 359. [2018-02-02 10:05:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:05:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 394 transitions. [2018-02-02 10:05:29,496 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 394 transitions. Word has length 89 [2018-02-02 10:05:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:29,497 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 394 transitions. [2018-02-02 10:05:29,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:05:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 394 transitions. [2018-02-02 10:05:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 10:05:29,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:29,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,497 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1950634351, now seen corresponding path program 1 times [2018-02-02 10:05:29,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:29,505 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:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:29,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:29,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:05:29,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:29,604 INFO L182 omatonBuilderFactory]: Interpolants [25235#true, 25236#false, 25237#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 25238#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc34.base|))), 25239#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 25240#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 25241#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 25242#(not (= 0 |main_#t~mem59.base|))] [2018-02-02 10:05:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:29,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:05:29,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:05:29,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:05:29,605 INFO L87 Difference]: Start difference. First operand 359 states and 394 transitions. Second operand 8 states. [2018-02-02 10:05:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:29,762 INFO L93 Difference]: Finished difference Result 375 states and 408 transitions. [2018-02-02 10:05:29,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:05:29,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-02-02 10:05:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:29,763 INFO L225 Difference]: With dead ends: 375 [2018-02-02 10:05:29,763 INFO L226 Difference]: Without dead ends: 375 [2018-02-02 10:05:29,763 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:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-02 10:05:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2018-02-02 10:05:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:05:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 392 transitions. [2018-02-02 10:05:29,767 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 392 transitions. Word has length 91 [2018-02-02 10:05:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:29,767 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 392 transitions. [2018-02-02 10:05:29,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:05:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 392 transitions. [2018-02-02 10:05:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:05:29,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:29,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,768 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash 370724265, now seen corresponding path program 1 times [2018-02-02 10:05:29,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:29,780 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:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:29,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:29,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:29,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:29,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:05:29,814 INFO L182 omatonBuilderFactory]: Interpolants [25987#true, 25988#false, 25989#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 25990#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 25991#(= 1 (select |#valid| |main_#t~mem55.base|))] [2018-02-02 10:05:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:29,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:29,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:29,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:29,815 INFO L87 Difference]: Start difference. First operand 359 states and 392 transitions. Second operand 5 states. [2018-02-02 10:05:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:29,922 INFO L93 Difference]: Finished difference Result 365 states and 398 transitions. [2018-02-02 10:05:29,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:29,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-02-02 10:05:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:29,923 INFO L225 Difference]: With dead ends: 365 [2018-02-02 10:05:29,923 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 10:05:29,923 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:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 10:05:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-02-02 10:05:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 10:05:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 396 transitions. [2018-02-02 10:05:29,926 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 396 transitions. Word has length 92 [2018-02-02 10:05:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:29,926 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 396 transitions. [2018-02-02 10:05:29,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 396 transitions. [2018-02-02 10:05:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:05:29,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:29,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,927 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash 370724266, now seen corresponding path program 1 times [2018-02-02 10:05:29,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:29,942 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:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:30,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:30,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:05:30,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:30,381 INFO L182 omatonBuilderFactory]: Interpolants [26723#true, 26724#false, 26725#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 26726#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| |append_#t~malloc34.base|)) (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 26727#(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)) (= 1 (select |#valid| append_~node~0.base))), 26728#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 26729#(and (= (select |old(#valid)| |create_data_#t~malloc3.base|) 0) (= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 26730#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0) (= |old(#length)| |#length|)) (or (= |#valid| |old(#valid)|) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 26731#(and (or (= (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) 0) (= (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) (= (select |old(#valid)| |create_data_#t~malloc4.base|) 0) (= (store (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|))) |#length|)), 26732#(and (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) 0)) (or (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0) (= |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|))))), 26733#(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))), 26734#(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|)))), 26735#(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|))), 26736#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem47.offset| 0) (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 26737#(and (= (select |#length| |main_#t~mem49.base|) 8) (<= 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|) 0) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 26738#(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|)))), 26739#(or (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|)))) (not (= main_~dataNotFinished~0 0))), 26740#(or (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|)))) |main_#t~short46|), 26741#(and (<= 0 |main_#t~mem55.offset|) (<= (+ |main_#t~mem55.offset| 8) (select |#length| |main_#t~mem55.base|)))] [2018-02-02 10:05:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:30,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:05:30,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:05:30,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:05:30,382 INFO L87 Difference]: Start difference. First operand 362 states and 396 transitions. Second operand 19 states. [2018-02-02 10:05:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:31,362 INFO L93 Difference]: Finished difference Result 393 states and 430 transitions. [2018-02-02 10:05:31,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:05:31,362 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-02-02 10:05:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:31,363 INFO L225 Difference]: With dead ends: 393 [2018-02-02 10:05:31,363 INFO L226 Difference]: Without dead ends: 393 [2018-02-02 10:05:31,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:05:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-02 10:05:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 365. [2018-02-02 10:05:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 10:05:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 399 transitions. [2018-02-02 10:05:31,367 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 399 transitions. Word has length 92 [2018-02-02 10:05:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:31,367 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 399 transitions. [2018-02-02 10:05:31,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:05:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 399 transitions. [2018-02-02 10:05:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:05:31,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:31,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,368 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:31,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1885925861, now seen corresponding path program 1 times [2018-02-02 10:05:31,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:31,377 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:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:31,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:31,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:05:31,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:31,457 INFO L134 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:31,457 INFO L182 omatonBuilderFactory]: Interpolants [27520#true, 27521#false, 27522#(and (= |main_#t~mem49.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 27523#(= |main_#t~mem50.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|))), 27524#(= 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|)))), 27525#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|))), 27526#(= 1 (select |#valid| |main_#t~mem56.base|)), 27527#(= 1 (select |#valid| |freeData_#in~data.base|)), 27528#(= 1 (select |#valid| freeData_~data.base))] [2018-02-02 10:05:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:31,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:31,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:31,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:31,458 INFO L87 Difference]: Start difference. First operand 365 states and 399 transitions. Second operand 9 states. [2018-02-02 10:05:31,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:31,707 INFO L93 Difference]: Finished difference Result 394 states and 435 transitions. [2018-02-02 10:05:31,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:05:31,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-02-02 10:05:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:31,708 INFO L225 Difference]: With dead ends: 394 [2018-02-02 10:05:31,708 INFO L226 Difference]: Without dead ends: 394 [2018-02-02 10:05:31,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:05:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-02-02 10:05:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 386. [2018-02-02 10:05:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-02 10:05:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 426 transitions. [2018-02-02 10:05:31,712 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 426 transitions. Word has length 95 [2018-02-02 10:05:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:31,712 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 426 transitions. [2018-02-02 10:05:31,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 426 transitions. [2018-02-02 10:05:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:05:31,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:31,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,712 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1885925862, now seen corresponding path program 1 times [2018-02-02 10:05:31,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:31,724 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:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:32,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:32,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 10:05:32,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:32,084 INFO L134 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:32,084 INFO L182 omatonBuilderFactory]: Interpolants [28320#false, 28321#(= (select |#valid| |main_~#list~0.base|) 1), 28322#(= |#valid| |old(#valid)|), 28323#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 28324#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 28325#(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_~pointerToList.base append_~node~0.base)))), 28326#(= 0 |create_data_#t~malloc3.offset|), 28327#(= 0 create_data_~data~0.offset), 28328#(= 0 create_data_~origData~0.offset), 28329#(= 0 |create_data_#res.offset|), 28330#(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_~pointerToList.base append_~node~0.base))) (= 0 |append_#t~ret38.offset|)), 28331#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~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))))), 28332#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= 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|)))), 28333#(= 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|))), 28334#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 28335#(and (= |main_#t~mem49.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|))) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 28336#(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|))) (= |main_#t~mem50.offset| (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|))) (= |main_#t~mem50.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|)))), 28337#(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|))) (<= (+ (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|)) 12) (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|))))), 28338#(and (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|))), 28339#(and (= 0 |main_#t~mem56.offset|) (<= (+ |main_#t~mem56.offset| 12) (select |#length| |main_#t~mem56.base|))), 28340#(and (= 0 |freeData_#in~data.offset|) (<= (+ |freeData_#in~data.offset| 12) (select |#length| |freeData_#in~data.base|))), 28341#(and (= freeData_~data.offset 0) (<= (+ freeData_~data.offset 12) (select |#length| freeData_~data.base))), 28319#true] [2018-02-02 10:05:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:32,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:05:32,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:05:32,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:32,085 INFO L87 Difference]: Start difference. First operand 386 states and 426 transitions. Second operand 23 states. [2018-02-02 10:05:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:33,107 INFO L93 Difference]: Finished difference Result 447 states and 492 transitions. [2018-02-02 10:05:33,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:05:33,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2018-02-02 10:05:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:33,108 INFO L225 Difference]: With dead ends: 447 [2018-02-02 10:05:33,108 INFO L226 Difference]: Without dead ends: 447 [2018-02-02 10:05:33,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=2044, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:05:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-02-02 10:05:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 420. [2018-02-02 10:05:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-02-02 10:05:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 469 transitions. [2018-02-02 10:05:33,112 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 469 transitions. Word has length 95 [2018-02-02 10:05:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:33,112 INFO L432 AbstractCegarLoop]: Abstraction has 420 states and 469 transitions. [2018-02-02 10:05:33,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:05:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 469 transitions. [2018-02-02 10:05:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:05:33,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:33,113 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,114 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash -251418617, now seen corresponding path program 1 times [2018-02-02 10:05:33,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:33,126 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:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:33,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:33,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:05:33,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:33,280 INFO L134 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:33,280 INFO L182 omatonBuilderFactory]: Interpolants [29264#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 29265#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))), 29266#(or (= |append_#t~malloc34.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)))), 29267#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))) (= append_~node~0.base (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))), 29268#(or (= append_~node~0.base |append_#t~mem36.base|) (= 1 (select |#valid| |append_#t~mem36.base|))), 29269#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))), 29270#(= 1 (select |#valid| |append_#t~mem40.base|)), 29259#true, 29260#false, 29261#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 29262#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 29263#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))] [2018-02-02 10:05:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:33,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:05:33,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:05:33,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:05:33,281 INFO L87 Difference]: Start difference. First operand 420 states and 469 transitions. Second operand 12 states. [2018-02-02 10:05:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:33,712 INFO L93 Difference]: Finished difference Result 423 states and 474 transitions. [2018-02-02 10:05:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:05:33,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-02-02 10:05:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:33,713 INFO L225 Difference]: With dead ends: 423 [2018-02-02 10:05:33,713 INFO L226 Difference]: Without dead ends: 423 [2018-02-02 10:05:33,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:05:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-02 10:05:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2018-02-02 10:05:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-02-02 10:05:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 468 transitions. [2018-02-02 10:05:33,716 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 468 transitions. Word has length 96 [2018-02-02 10:05:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:33,716 INFO L432 AbstractCegarLoop]: Abstraction has 419 states and 468 transitions. [2018-02-02 10:05:33,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:05:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 468 transitions. [2018-02-02 10:05:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:05:33,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:33,717 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,717 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:33,717 INFO L82 PathProgramCache]: Analyzing trace with hash -251418616, now seen corresponding path program 1 times [2018-02-02 10:05:33,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:33,727 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:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:33,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:33,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:05:33,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:33,991 INFO L134 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:33,991 INFO L182 omatonBuilderFactory]: Interpolants [30125#true, 30126#false, 30127#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 30128#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 30129#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0)), 30130#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (<= (+ append_~node~0.offset 4) (select |#length| append_~node~0.base)) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1)), 30131#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 30132#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 30133#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= main_~dataNotFinished~0 0) (= main_~dataNotFinished~0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 30134#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (not |main_#t~short46|) (and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))))), 30135#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 30136#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0))), 30137#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) 0))), 30138#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)))), 30139#(and (<= 4 (select |#length| |append_#t~mem36.base|)) (= 0 |append_#t~mem36.offset|)), 30140#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)))), 30141#(and (<= 4 (select |#length| |append_#t~mem40.base|)) (= |append_#t~mem40.offset| 0))] [2018-02-02 10:05:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:33,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:05:33,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:05:33,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:05:33,992 INFO L87 Difference]: Start difference. First operand 419 states and 468 transitions. Second operand 17 states. [2018-02-02 10:05:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:34,557 INFO L93 Difference]: Finished difference Result 438 states and 489 transitions. [2018-02-02 10:05:34,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:05:34,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-02-02 10:05:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:34,559 INFO L225 Difference]: With dead ends: 438 [2018-02-02 10:05:34,559 INFO L226 Difference]: Without dead ends: 438 [2018-02-02 10:05:34,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:05:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-02 10:05:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 418. [2018-02-02 10:05:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-02 10:05:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 467 transitions. [2018-02-02 10:05:34,564 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 467 transitions. Word has length 96 [2018-02-02 10:05:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:34,565 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 467 transitions. [2018-02-02 10:05:34,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:05:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 467 transitions. [2018-02-02 10:05:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:05:34,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:34,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,566 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1665840238, now seen corresponding path program 1 times [2018-02-02 10:05:34,567 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:34,595 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:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:05:35,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:35,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:05:35,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:35,305 INFO L182 omatonBuilderFactory]: Interpolants [31040#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~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))))), 31041#(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|))))), 31042#(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))), 31043#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 31044#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|))), 31045#(and (= 0 |main_#t~mem56.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem56.base|) 4))), 31046#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |freeData_#in~data.base|) 4))), 31047#(and (= 0 freeData_~data.offset) (= 0 (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)))), 31048#(= |freeData_#t~mem33.offset| 0), 31021#true, 31022#false, 31023#(= (select |#valid| |main_~#list~0.base|) 1), 31024#(= |#valid| |old(#valid)|), 31025#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 31026#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 31027#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 31028#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (= 1 (select |#valid| append_~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|)))), 31029#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) (select |#valid| append_~node~0.base)))) (= 1 (select |#valid| append_~pointerToList.base))), 31030#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= 0 |create_data_#t~malloc3.offset|)), 31031#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= (select |#valid| create_data_~data~0.base) 1)), 31032#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (not (= create_data_~data~0.base |create_data_#t~malloc4.base|)) (= 0 |create_data_#t~malloc4.offset|)), 31033#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 31034#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 create_data_~data~0.offset) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 31035#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 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)))), 31036#(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)))), 31037#(and (= 0 create_data_~origData~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~origData~0.base) 4)) (= 0 (select |old(#valid)| create_data_~origData~0.base))), 31038#(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|)), 31039#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret38.offset|) (= 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~ret38.offset|)) |append_#t~ret38.base|) 4)) (not (= append_~pointerToList.base |append_#t~ret38.base|)))))] [2018-02-02 10:05:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:05:35,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:05:35,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:05:35,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:05:35,305 INFO L87 Difference]: Start difference. First operand 418 states and 467 transitions. Second operand 28 states. [2018-02-02 10:05:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:36,793 INFO L93 Difference]: Finished difference Result 453 states and 506 transitions. [2018-02-02 10:05:36,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:05:36,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 96 [2018-02-02 10:05:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:36,794 INFO L225 Difference]: With dead ends: 453 [2018-02-02 10:05:36,794 INFO L226 Difference]: Without dead ends: 453 [2018-02-02 10:05:36,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=275, Invalid=2917, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:05:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-02 10:05:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 426. [2018-02-02 10:05:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-02 10:05:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 477 transitions. [2018-02-02 10:05:36,798 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 477 transitions. Word has length 96 [2018-02-02 10:05:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:36,798 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 477 transitions. [2018-02-02 10:05:36,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:05:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 477 transitions. [2018-02-02 10:05:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:05:36,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:36,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,799 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1665840237, now seen corresponding path program 1 times [2018-02-02 10:05:36,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:36,818 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:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:05:37,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:37,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:05:37,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:37,402 INFO L134 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:37,402 INFO L182 omatonBuilderFactory]: Interpolants [32000#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (not (= create_data_~data~0.base (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)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 32001#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 32002#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 32003#(and (= 0 create_data_~origData~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~origData~0.base) 4))) (= 0 (select |old(#valid)| create_data_~origData~0.base))), 32004#(and (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 |create_data_#res.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)))), 32005#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret38.offset|) (not (= append_~pointerToList.base |append_#t~ret38.base|)) (= 1 (select |#valid| (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~ret38.base|)) |append_#t~ret38.base|) 4)))))), 32006#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~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)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4))) (= 0 (select (select (store |#memory_$Pointer$.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))))), 32007#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 1 (select |#valid| (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|))))), 32008#(and (= 1 (select |#valid| (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|)))), 32009#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 32010#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|)) 4)))), 32011#(and (= 0 |main_#t~mem56.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) 4)))), 32012#(and (= 0 |freeData_#in~data.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4)))), 32013#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (= 0 freeData_~data.offset)), 32014#(= 1 (select |#valid| |freeData_#t~mem33.base|)), 31986#true, 31987#false, 31988#(= (select |#valid| |main_~#list~0.base|) 1), 31989#(= |#valid| |old(#valid)|), 31990#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 31991#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 31992#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 31993#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base))))), 31994#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base)) (= (select |#valid| append_~pointerToList.base) (select |#valid| append_~node~0.base))))), 31995#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= 0 |create_data_#t~malloc3.offset|)), 31996#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= (select |#valid| create_data_~data~0.base) 1)), 31997#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (not (= create_data_~data~0.base |create_data_#t~malloc4.base|)) (= 1 (select |#valid| |create_data_#t~malloc4.base|))), 31998#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (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)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 31999#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 create_data_~data~0.offset) (= |create_data_#t~mem7.base| (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)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))))] [2018-02-02 10:05:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:05:37,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:05:37,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:05:37,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:05:37,403 INFO L87 Difference]: Start difference. First operand 426 states and 477 transitions. Second operand 29 states. [2018-02-02 10:05:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:38,922 INFO L93 Difference]: Finished difference Result 442 states and 496 transitions. [2018-02-02 10:05:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:05:38,922 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 96 [2018-02-02 10:05:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:38,923 INFO L225 Difference]: With dead ends: 442 [2018-02-02 10:05:38,923 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 10:05:38,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=2610, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:05:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 10:05:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 426. [2018-02-02 10:05:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-02 10:05:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 476 transitions. [2018-02-02 10:05:38,926 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 476 transitions. Word has length 96 [2018-02-02 10:05:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:38,927 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 476 transitions. [2018-02-02 10:05:38,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:05:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 476 transitions. [2018-02-02 10:05:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 10:05:38,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:38,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,927 INFO L371 AbstractCegarLoop]: === Iteration 52 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1150339668, now seen corresponding path program 1 times [2018-02-02 10:05:38,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:38,947 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:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:39,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:39,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-02-02 10:05:39,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:39,815 INFO L134 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:39,815 INFO L182 omatonBuilderFactory]: Interpolants [32960#(and (not (= freeData_~data.base (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (= 0 freeData_~data.offset) (= 1 (select |#valid| freeData_~data.base))), 32961#(and (not (= freeData_~data.base |freeData_#t~mem33.base|)) (= 1 (select |#valid| freeData_~data.base))), 32962#(= 1 (select |#valid| freeData_~data.base)), 32933#true, 32934#false, 32935#(= (select |#valid| |main_~#list~0.base|) 1), 32936#(= |#valid| |old(#valid)|), 32937#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 32938#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 32939#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 32940#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base))))), 32941#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base)) (= 1 (select |#valid| append_~node~0.base))))), 32942#(and (= 1 (select |#valid| |create_data_#t~malloc3.base|)) (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= 0 |create_data_#t~malloc3.offset|)), 32943#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| create_data_~data~0.base))), 32944#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (not (= create_data_~data~0.base |create_data_#t~malloc4.base|))), 32945#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (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))), 32946#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (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))), 32947#(and (= 0 create_data_~origData~0.offset) (not (= create_data_~origData~0.base (select (select |#memory_$Pointer$.base| create_data_~origData~0.base) 4))) (= 0 (select |old(#valid)| create_data_~origData~0.base))), 32948#(and (= 0 (select |old(#valid)| |create_data_#res.base|)) (not (= |create_data_#res.base| (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4))) (= 0 |create_data_#res.offset|)), 32949#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret38.offset|) (not (= |append_#t~ret38.base| (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~ret38.base|)) |append_#t~ret38.base|) 4))) (not (= append_~pointerToList.base |append_#t~ret38.base|))))), 32950#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~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)) (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) 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)) (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)))))), 32951#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.base| (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|))))), 32952#(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|))) (not (= (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|)) (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)))), 32953#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |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|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 32954#(and (= |main_#t~mem49.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (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|)) (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))) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 32955#(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|))) (= |main_#t~mem50.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 (= (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|)) (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)))), 32956#(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|))) (= 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|)))) (not (= (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|)) (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)))), 32957#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|)) 4)))), 32958#(and (= 0 |main_#t~mem56.offset|) (not (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) 4))) (= 1 (select |#valid| |main_#t~mem56.base|))), 32959#(and (not (= |freeData_#in~data.base| (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))) (= 0 |freeData_#in~data.offset|) (= 1 (select |#valid| |freeData_#in~data.base|)))] [2018-02-02 10:05:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:39,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:05:39,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:05:39,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:05:39,815 INFO L87 Difference]: Start difference. First operand 426 states and 476 transitions. Second operand 30 states. [2018-02-02 10:05:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:41,241 INFO L93 Difference]: Finished difference Result 451 states and 504 transitions. [2018-02-02 10:05:41,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:05:41,241 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 98 [2018-02-02 10:05:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:41,243 INFO L225 Difference]: With dead ends: 451 [2018-02-02 10:05:41,243 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:05:41,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=307, Invalid=3475, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:05:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:05:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 426. [2018-02-02 10:05:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-02 10:05:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 475 transitions. [2018-02-02 10:05:41,248 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 475 transitions. Word has length 98 [2018-02-02 10:05:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:41,248 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 475 transitions. [2018-02-02 10:05:41,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:05:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 475 transitions. [2018-02-02 10:05:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 10:05:41,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:41,248 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:41,249 INFO L371 AbstractCegarLoop]: === Iteration 53 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash -381265027, now seen corresponding path program 2 times [2018-02-02 10:05:41,249 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:41,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:05:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:42,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:42,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:05:42,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:42,540 INFO L134 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:42,540 INFO L182 omatonBuilderFactory]: Interpolants [33904#true, 33905#false, 33906#(= 1 (select |#valid| |append_#t~malloc34.base|)), 33907#(= 1 (select |#valid| append_~node~0.base)), 33908#(= |#valid| |old(#valid)|), 33909#(and (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|)), 33910#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 33911#(and (= 1 (select |#valid| |create_data_#t~malloc4.base|)) (= (store (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))) |#valid|) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))) (= (store |old(#valid)| |create_data_#t~malloc4.base| (select |#valid| |create_data_#t~malloc4.base|)) |#valid|))), 33912#(and (= |#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 (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= 0 (select |old(#valid)| (@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|))))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|))))), 33913#(and (= |#valid| (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)))) (or (= |#valid| (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|))) (= 1 (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|)))) (or (= |#valid| (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) (= 1 (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))))), 33914#(and (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= create_data_~nextData~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|))) (= create_data_~nextData~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~nextData~0.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|)))))), 33915#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.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|))))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= create_data_~data~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|))))), 33916#(and (or (= |#valid| (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|))) (= 1 (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (= |#valid| (store (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) (@diff (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) |#valid|) (select |#valid| (@diff (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) |#valid|)))) (or (= |#valid| (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)))) (= 0 (select |old(#valid)| (@diff (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) |#valid|))) (= create_data_~data~0.base (@diff (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) |#valid|)) (= 1 (select |#valid| (@diff (store (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) |#valid|)))) (or (= create_data_~data~0.base (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|)) (= |#valid| (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))) (= 1 (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc24.base| (select |#valid| |create_data_#t~malloc24.base|)) |#valid|))) |#valid|))))), 33917#(and (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= create_data_~data~0.base (@diff (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|))) |#valid|)) (= create_data_~nextData~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (= create_data_~data~0.base (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|)) (= 1 (select |#valid| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|))) (= create_data_~nextData~0.base (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= create_data_~nextData~0.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|))))) (= |#valid| (store (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|) (select |#valid| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|))) (= create_data_~nextData~0.base (@diff |old(#valid)| |#valid|)))), 33918#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= create_data_~data~0.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|))))) (or (= 0 (select |old(#valid)| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (= create_data_~data~0.base (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|)) (= 1 (select |#valid| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|)))) (= |#valid| (store (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|) (select |#valid| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= create_data_~data~0.base (@diff (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|))) |#valid|)) (= 1 (select |#valid| (@diff (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|))) |#valid|))))), 33919#(and (or (= 0 (select |old(#valid)| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|))) (= |#valid| (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|)))) (= 1 (select |#valid| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= 0 (select |old(#valid)| (@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 (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|) (select |#valid| (@diff (store (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|))) (@diff (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|))) |#valid|) (select |#valid| (@diff (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|))) |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= 1 (select |#valid| (@diff (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|))) |#valid|)))))] [2018-02-02 10:05:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:42,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:05:42,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:05:42,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:05:42,541 INFO L87 Difference]: Start difference. First operand 426 states and 475 transitions. Second operand 16 states. [2018-02-02 10:05:43,562 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 70 DAG size of output 49 [2018-02-02 10:05:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:45,134 INFO L93 Difference]: Finished difference Result 512 states and 579 transitions. [2018-02-02 10:05:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:05:45,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 98 [2018-02-02 10:05:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:45,135 INFO L225 Difference]: With dead ends: 512 [2018-02-02 10:05:45,135 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 10:05:45,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 10:05:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 464. [2018-02-02 10:05:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-02-02 10:05:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 517 transitions. [2018-02-02 10:05:45,141 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 517 transitions. Word has length 98 [2018-02-02 10:05:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:45,141 INFO L432 AbstractCegarLoop]: Abstraction has 464 states and 517 transitions. [2018-02-02 10:05:45,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:05:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 517 transitions. [2018-02-02 10:05:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-02-02 10:05:45,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:45,143 INFO L351 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:45,143 INFO L371 AbstractCegarLoop]: === Iteration 54 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1853698170, now seen corresponding path program 1 times [2018-02-02 10:05:45,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:45,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:05:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-02-02 10:05:45,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:45,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:05:45,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-02 10:05:45,518 INFO L182 omatonBuilderFactory]: Interpolants [34912#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 34913#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc34.base|))), 34914#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 34915#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 34916#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 34917#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| |main_~#list~0.base|))), 34918#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= main_~dataNotFinished~0 0) (= main_~dataNotFinished~0 (select |#valid| |main_~#list~0.base|)))), 34919#(or (not |main_#t~short46|) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select |#valid| |main_~#list~0.base|) 0)))), 34920#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select |#valid| |main_~#list~0.base|) 0))), 34921#(and (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (not (= (select |#valid| |append_#in~pointerToList.base|) 0))), 34922#(and (not (= (select |#valid| append_~pointerToList.base) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)))), 34923#(and (not (= append_~pointerToList.base |append_#t~malloc34.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)))), 34924#(and (not (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))) (not (= append_~pointerToList.base append_~node~0.base))), 34925#(not (= 0 (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))), 34926#(not (= 0 |append_#t~mem37.base|)), 34910#true, 34911#false] [2018-02-02 10:05:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-02-02 10:05:45,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:05:45,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:05:45,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:05:45,519 INFO L87 Difference]: Start difference. First operand 464 states and 517 transitions. Second operand 17 states. [2018-02-02 10:05:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:45,863 INFO L93 Difference]: Finished difference Result 474 states and 521 transitions. [2018-02-02 10:05:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:05:45,863 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2018-02-02 10:05:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:45,864 INFO L225 Difference]: With dead ends: 474 [2018-02-02 10:05:45,864 INFO L226 Difference]: Without dead ends: 474 [2018-02-02 10:05:45,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:05:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-02-02 10:05:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 462. [2018-02-02 10:05:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-02-02 10:05:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 510 transitions. [2018-02-02 10:05:45,867 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 510 transitions. Word has length 174 [2018-02-02 10:05:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:45,867 INFO L432 AbstractCegarLoop]: Abstraction has 462 states and 510 transitions. [2018-02-02 10:05:45,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:05:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 510 transitions. [2018-02-02 10:05:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 10:05:45,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:45,868 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:45,868 INFO L371 AbstractCegarLoop]: === Iteration 55 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash -381265026, now seen corresponding path program 2 times [2018-02-02 10:05:45,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:45,912 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:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:46,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:46,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:05:46,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:46,631 INFO L134 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:46,631 INFO L182 omatonBuilderFactory]: Interpolants [35878#true, 35879#false, 35880#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= (select |#valid| |append_#t~malloc34.base|) 1) (= 0 |append_#t~malloc34.offset|)), 35881#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1)), 35882#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 35883#(and (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 35884#(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|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 35885#(and (or (= (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)))) (= 0 (select |old(#valid)| |create_data_#t~malloc4.base|)) (= (store (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|))) |#length|)), 35886#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#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|))))), 35887#(and (or (= |#length| (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|)))) (or (= (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (= 0 (select |old(#valid)| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|)))) (= |#length| (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|)))) (= 16 (select |#length| |create_data_#t~malloc24.base|))), 35888#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (and (= create_data_~nextData~0.base (@diff |old(#length)| |#length|)) (= 16 (select |#length| create_data_~nextData~0.base))) (= |old(#length)| |#length|)) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (and (= 16 (select |#length| create_data_~nextData~0.base)) (= create_data_~nextData~0.base (@diff (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|))) |#length|)))) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (and (= 16 (select |#length| create_data_~nextData~0.base)) (= create_data_~nextData~0.base (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (= |#length| (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))))), 35889#(and (or (and (= create_data_~data~0.base (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) (= 16 (select |#length| create_data_~data~0.base))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (and (= create_data_~data~0.base (@diff (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|))) |#length|)) (= 16 (select |#length| create_data_~data~0.base)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (and (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= 16 (select |#length| create_data_~data~0.base)))) (= |#length| (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))))), 35890#(and (= |#length| (store (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))) (@diff (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))) |#length|) (select |#length| (@diff (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))) |#length|)))) (or (and (= create_data_~data~0.base (@diff (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))) |#length|)) (= (select |#length| create_data_~data~0.base) 16)) (= |#length| (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|)))) (= 0 (select |old(#valid)| (@diff (store (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))) |#length|)))) (= 16 (select |#length| |create_data_#t~malloc24.base|)) (or (= |#length| (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|))) (and (= create_data_~data~0.base (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|)) (= (select |#length| create_data_~data~0.base) 16)) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|)))) (or (and (= (select |#length| create_data_~data~0.base) 16) (= create_data_~data~0.base (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))) (= (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|) (= 0 (select |old(#valid)| (@diff (store (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc24.base| (select |#length| |create_data_#t~malloc24.base|)) |#length|))) |#length|))))), 35891#(and (or (= 16 (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= 16 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (or (= 0 (select |old(#valid)| (@diff (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))) |#length|))) (= 16 (select |#length| (@diff (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))) |#length|))) (= |#length| (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))))) (or (= 0 (select |old(#valid)| (@diff (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|))) |#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|)))) (= 16 (select |#length| (@diff (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|))) |#length|)))) (= (store (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))) (@diff (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))) |#length|) (select |#length| (@diff (store (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|))) (@diff (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|))) |#length|) (select |#length| (@diff (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|))) |#length|))) |#length|))) |#length|)), 35892#(and (<= 8 (select |#length| append_~node~0.base)) (= append_~node~0.offset 0))] [2018-02-02 10:05:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:46,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:05:46,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:05:46,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:05:46,632 INFO L87 Difference]: Start difference. First operand 462 states and 510 transitions. Second operand 15 states. [2018-02-02 10:05:47,591 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 68 DAG size of output 55 [2018-02-02 10:05:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:48,543 INFO L93 Difference]: Finished difference Result 515 states and 569 transitions. [2018-02-02 10:05:48,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:05:48,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2018-02-02 10:05:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:48,545 INFO L225 Difference]: With dead ends: 515 [2018-02-02 10:05:48,545 INFO L226 Difference]: Without dead ends: 515 [2018-02-02 10:05:48,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:05:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-02 10:05:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 462. [2018-02-02 10:05:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-02-02 10:05:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 508 transitions. [2018-02-02 10:05:48,548 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 508 transitions. Word has length 98 [2018-02-02 10:05:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:48,549 INFO L432 AbstractCegarLoop]: Abstraction has 462 states and 508 transitions. [2018-02-02 10:05:48,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:05:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 508 transitions. [2018-02-02 10:05:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:05:48,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:48,549 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,549 INFO L371 AbstractCegarLoop]: === Iteration 56 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:05:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash -137378987, now seen corresponding path program 1 times [2018-02-02 10:05:48,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:48,559 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:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:48,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:48,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:05:48,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:48,888 INFO L134 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:48,888 INFO L182 omatonBuilderFactory]: Interpolants [36896#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) 0))), 36897#(and (not (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset) |append_#t~malloc34.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)))) (= |append_#t~malloc34.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset))))), 36898#(and (not (= append_~node~0.base (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))) (or (= append_~node~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)))))), 36899#(or (and (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4) |append_#t~mem36.base|)) |append_#t~mem36.base|) (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset))) (= |append_#t~mem36.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4) |append_#t~mem36.base|)) |append_#t~mem36.base|) |append_#t~mem36.offset|)))), 36900#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4))))), 36901#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#t~mem40.base|) |append_#t~mem40.offset|))), 36902#(= 1 (select |#valid| |append_#t~mem41.base|)), 36903#(= 1 (select |#valid| |create_data_#in~prevData.base|)), 36904#(= 1 (select |#valid| create_data_~prevData.base)), 36882#true, 36883#false, 36884#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 36885#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~node~0.base) 1)), 36886#(= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 1), 36887#(= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1), 36888#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 36889#(and (= |main_#t~mem49.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#memory_$Pointer$.base| |main_#t~mem49.base|) (select |#memory_$Pointer$.base| (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|)) 1)), 36890#(and (= |main_#t~mem50.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|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 36891#(and (= 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|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 36892#(and (= 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|)))) (or (= main_~dataNotFinished~0 0) (= main_~dataNotFinished~0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 36893#(or (not |main_#t~short46|) (and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 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|)))))), 36894#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 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|))))), 36895#(and (= 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|)))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)))] [2018-02-02 10:05:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 10:05:48,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:05:48,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:05:48,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:48,889 INFO L87 Difference]: Start difference. First operand 462 states and 508 transitions. Second operand 23 states. Received shutdown request... [2018-02-02 10:05:49,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:05:49,627 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:05:49,631 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:05:49,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:05:49 BoogieIcfgContainer [2018-02-02 10:05:49,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:05:49,632 INFO L168 Benchmark]: Toolchain (without parser) took 44048.94 ms. Allocated memory was 392.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 349.6 MB in the beginning and 713.4 MB in the end (delta: -363.9 MB). Peak memory consumption was 651.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:49,633 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 392.7 MB. Free memory is still 356.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:05:49,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.64 ms. Allocated memory is still 392.7 MB. Free memory was 349.6 MB in the beginning and 337.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:49,633 INFO L168 Benchmark]: Boogie Preprocessor took 34.00 ms. Allocated memory is still 392.7 MB. Free memory was 337.7 MB in the beginning and 336.4 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:05:49,633 INFO L168 Benchmark]: RCFGBuilder took 512.81 ms. Allocated memory is still 392.7 MB. Free memory was 336.4 MB in the beginning and 283.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:49,633 INFO L168 Benchmark]: TraceAbstraction took 43323.59 ms. Allocated memory was 392.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 283.3 MB in the beginning and 713.4 MB in the end (delta: -430.2 MB). Peak memory consumption was 584.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:49,634 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.15 ms. Allocated memory is still 392.7 MB. Free memory is still 356.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.64 ms. Allocated memory is still 392.7 MB. Free memory was 349.6 MB in the beginning and 337.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.00 ms. Allocated memory is still 392.7 MB. Free memory was 337.7 MB in the beginning and 336.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 512.81 ms. Allocated memory is still 392.7 MB. Free memory was 336.4 MB in the beginning and 283.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43323.59 ms. Allocated memory was 392.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 283.3 MB in the beginning and 713.4 MB in the end (delta: -430.2 MB). Peak memory consumption was 584.8 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 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 587). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 586]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 587). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 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 (462states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 216 locations, 91 error locations. TIMEOUT Result, 43.2s OverallTime, 56 OverallIterations, 8 TraceHistogramMax, 29.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8170 SDtfs, 8266 SDslu, 32307 SDs, 0 SdLazy, 31514 SolverSat, 1136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1068 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 853 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4579 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=464occurred in iteration=53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1183/1339 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, 55 MinimizatonAttempts, 955 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 3861 NumberOfCodeBlocks, 3861 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3805 ConstructedInterpolants, 0 QuantifiedInterpolants, 11119494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 36 PerfectInterpolantSequences, 1183/1339 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/complex_data_creation_test02_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-05-49-642.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-05-49-642.csv Completed graceful shutdown