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_test01_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:04:31,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:04:31,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:04:31,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:04:31,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:04:31,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:04:31,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:04:31,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:04:31,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:04:31,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:04:31,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:04:31,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:04:31,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:04:31,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:04:31,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:04:31,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:04:31,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:04:31,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:04:31,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:04:31,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:04:31,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:04:31,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:04:31,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:04:31,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:04:31,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:04:31,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:04:31,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:04:31,106 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:04:31,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:04:31,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:04:31,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:04:31,107 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:04:31,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:04:31,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:04:31,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:04:31,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:04:31,118 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:04:31,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:04:31,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:04:31,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:04:31,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:04:31,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:04:31,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:04:31,119 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:04:31,119 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:04:31,120 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:04:31,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:04:31,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:04:31,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:04:31,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:04:31,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:04:31,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:04:31,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:04:31,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:04:31,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:04:31,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:04:31,157 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:04:31,160 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:04:31,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:04:31,161 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:04:31,161 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_test01_true-valid-memsafety.i [2018-02-02 10:04:31,287 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:04:31,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:04:31,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:04:31,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:04:31,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:04:31,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431e7bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31, skipping insertion in model container [2018-02-02 10:04:31,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,317 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:04:31,349 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:04:31,445 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:04:31,461 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:04:31,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31 WrapperNode [2018-02-02 10:04:31,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:04:31,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:04:31,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:04:31,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:04:31,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (1/1) ... [2018-02-02 10:04:31,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:04:31,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:04:31,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:04:31,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:04:31,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (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:04:31,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:04:31,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:04:31,539 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 10:04:31,539 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 10:04:31,539 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 10:04:31,539 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 10:04:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 10:04:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:04:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:04:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:04:31,988 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:04:31,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:04:31 BoogieIcfgContainer [2018-02-02 10:04:31,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:04:31,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:04:31,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:04:31,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:04:31,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:04:31" (1/3) ... [2018-02-02 10:04:31,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f50a75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:04:31, skipping insertion in model container [2018-02-02 10:04:31,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:04:31" (2/3) ... [2018-02-02 10:04:31,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f50a75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:04:31, skipping insertion in model container [2018-02-02 10:04:31,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:04:31" (3/3) ... [2018-02-02 10:04:31,994 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_true-valid-memsafety.i [2018-02-02 10:04:31,999 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:04:32,005 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-02 10:04:32,029 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:04:32,029 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:04:32,029 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:04:32,029 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:04:32,029 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:04:32,029 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:04:32,030 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:04:32,030 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:04:32,030 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:04:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states. [2018-02-02 10:04:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:04:32,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:32,051 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:32,051 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:04:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704007, now seen corresponding path program 1 times [2018-02-02 10:04:32,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:32,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:32,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:32,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:04:32,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:32,174 INFO L134 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:04:32,174 INFO L182 omatonBuilderFactory]: Interpolants [216#true, 217#false, 218#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 10:04:32,174 INFO L134 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:04:32,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:04:32,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:04:32,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:04:32,277 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 3 states. [2018-02-02 10:04:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:32,507 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-02-02 10:04:32,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:04:32,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:04:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:32,518 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:04:32,518 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 10:04:32,520 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:04:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 10:04:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-02 10:04:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:04:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions. [2018-02-02 10:04:32,551 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 7 [2018-02-02 10:04:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:32,552 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 217 transitions. [2018-02-02 10:04:32,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:04:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 217 transitions. [2018-02-02 10:04:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:04:32,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:32,552 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:32,552 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:04:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704008, now seen corresponding path program 1 times [2018-02-02 10:04:32,553 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:32,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:32,595 INFO L134 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:04:32,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:32,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:04:32,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:32,596 INFO L182 omatonBuilderFactory]: Interpolants [632#true, 633#false, 634#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0))] [2018-02-02 10:04:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:32,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:04:32,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:04:32,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:04:32,598 INFO L87 Difference]: Start difference. First operand 205 states and 217 transitions. Second operand 3 states. [2018-02-02 10:04:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:32,747 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-02-02 10:04:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:04:32,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:04:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:32,752 INFO L225 Difference]: With dead ends: 206 [2018-02-02 10:04:32,752 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 10:04:32,752 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:04:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 10:04:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-02-02 10:04:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:04:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2018-02-02 10:04:32,768 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 7 [2018-02-02 10:04:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:32,768 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2018-02-02 10:04:32,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:04:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2018-02-02 10:04:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:04:32,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:32,769 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:32,769 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:04:32,769 INFO L82 PathProgramCache]: Analyzing trace with hash 627159801, now seen corresponding path program 1 times [2018-02-02 10:04:32,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:32,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:32,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:32,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:04:32,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:32,879 INFO L134 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:04:32,879 INFO L182 omatonBuilderFactory]: Interpolants [1045#true, 1046#false, 1047#(= 1 (select |#valid| |main_~#list~0.base|)), 1048#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 1049#(= 1 (select |#valid| append_~pointerToList.base))] [2018-02-02 10:04:32,880 INFO L134 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:04:32,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:04:32,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:04:32,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:04:32,881 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 5 states. [2018-02-02 10:04:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:33,089 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2018-02-02 10:04:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:04:33,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:04:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:33,090 INFO L225 Difference]: With dead ends: 202 [2018-02-02 10:04:33,090 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:04:33,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:04:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:04:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-02 10:04:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 10:04:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2018-02-02 10:04:33,102 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 14 [2018-02-02 10:04:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:33,102 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2018-02-02 10:04:33,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:04:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2018-02-02 10:04:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:04:33,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:33,103 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:33,103 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:04:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 627159802, now seen corresponding path program 1 times [2018-02-02 10:04:33,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:33,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:33,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:33,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:04:33,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:33,194 INFO L182 omatonBuilderFactory]: Interpolants [1456#true, 1457#false, 1458#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 1459#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4) (= (select |#valid| |main_~#list~0.base|) 1)), 1460#(and (<= 4 (select |#length| |append_#in~pointerToList.base|)) (= 0 |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1)), 1461#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 1462#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0))] [2018-02-02 10:04:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:33,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:04:33,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:04:33,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:04:33,195 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand 7 states. [2018-02-02 10:04:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:33,538 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2018-02-02 10:04:33,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:04:33,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 10:04:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:33,539 INFO L225 Difference]: With dead ends: 222 [2018-02-02 10:04:33,539 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 10:04:33,540 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:04:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 10:04:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 211. [2018-02-02 10:04:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 10:04:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-02-02 10:04:33,549 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 14 [2018-02-02 10:04:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:33,549 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-02-02 10:04:33,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:04:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-02-02 10:04:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:04:33,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:33,550 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:33,550 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:04:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882424, now seen corresponding path program 1 times [2018-02-02 10:04:33,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:33,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:33,594 INFO L134 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:04:33,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:33,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:04:33,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:33,595 INFO L134 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:04:33,595 INFO L182 omatonBuilderFactory]: Interpolants [1898#true, 1899#false, 1900#(= 1 (select |#valid| |append_#t~malloc34.base|)), 1901#(= 1 (select |#valid| append_~node~0.base))] [2018-02-02 10:04:33,595 INFO L134 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:04:33,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:04:33,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:04:33,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:04:33,595 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 4 states. [2018-02-02 10:04:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:33,707 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-02 10:04:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:04:33,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:04:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:33,708 INFO L225 Difference]: With dead ends: 209 [2018-02-02 10:04:33,708 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:04:33,709 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:04:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:04:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-02-02 10:04:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:04:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2018-02-02 10:04:33,714 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 15 [2018-02-02 10:04:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:33,714 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2018-02-02 10:04:33,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:04:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2018-02-02 10:04:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:04:33,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:33,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:33,715 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:04:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882423, now seen corresponding path program 1 times [2018-02-02 10:04:33,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:33,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:33,757 INFO L134 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:04:33,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:33,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:04:33,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:33,758 INFO L134 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:04:33,758 INFO L182 omatonBuilderFactory]: Interpolants [2322#true, 2323#false, 2324#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 2325#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0))] [2018-02-02 10:04:33,758 INFO L134 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:04:33,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:04:33,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:04:33,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:04:33,758 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 4 states. [2018-02-02 10:04:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:33,854 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-02-02 10:04:33,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:04:33,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:04:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:33,855 INFO L225 Difference]: With dead ends: 207 [2018-02-02 10:04:33,855 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 10:04:33,855 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:04:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 10:04:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-02-02 10:04:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 10:04:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 220 transitions. [2018-02-02 10:04:33,858 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 220 transitions. Word has length 15 [2018-02-02 10:04:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:33,858 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 220 transitions. [2018-02-02 10:04:33,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:04:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 220 transitions. [2018-02-02 10:04:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:04:33,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:33,859 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:04:33,859 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:04:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash -290527541, now seen corresponding path program 1 times [2018-02-02 10:04:33,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:33,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:34,064 INFO L134 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:04:34,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:34,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:04:34,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:34,065 INFO L134 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:04:34,066 INFO L182 omatonBuilderFactory]: Interpolants [2752#(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|))), 2753#(and (= 0 (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (= 1 (select |#valid| 0))), 2754#(= (select |#valid| |append_#t~mem40.base|) 1), 2742#true, 2743#false, 2744#(= 0 (select |#valid| 0)), 2745#(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|)) (= 0 (select |#valid| 0)) (= 1 (select |#valid| |main_~#list~0.base|))), 2746#(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|)) (= 0 (select |#valid| 0))), 2747#(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)) (= 0 (select |#valid| 0))), 2748#(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)))), 2749#(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))))), 2750#(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))))), 2751#(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)))))] [2018-02-02 10:04:34,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:04:34,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:04:34,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:04:34,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:04:34,068 INFO L87 Difference]: Start difference. First operand 207 states and 220 transitions. Second operand 13 states. [2018-02-02 10:04:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:34,808 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-02 10:04:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:04:34,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-02 10:04:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:34,810 INFO L225 Difference]: With dead ends: 209 [2018-02-02 10:04:34,810 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:04:34,811 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:04:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:04:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-02-02 10:04:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:04:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-02 10:04:34,816 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 20 [2018-02-02 10:04:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:34,816 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-02 10:04:34,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:04:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-02 10:04:34,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:04:34,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:34,817 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:04:34,817 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:04:34,818 INFO L82 PathProgramCache]: Analyzing trace with hash -30107462, now seen corresponding path program 1 times [2018-02-02 10:04:34,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:34,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:34,851 INFO L134 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:04:34,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:34,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:04:34,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:34,852 INFO L134 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:04:34,852 INFO L182 omatonBuilderFactory]: Interpolants [3184#true, 3185#false, 3186#(and (= 0 |create_data_#in~prevData.base|) (= 0 |create_data_#in~prevData.offset|)), 3187#(not |create_data_#t~short1|)] [2018-02-02 10:04:34,853 INFO L134 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:04:34,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:04:34,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:04:34,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:04:34,854 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 4 states. [2018-02-02 10:04:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:34,872 INFO L93 Difference]: Finished difference Result 294 states and 311 transitions. [2018-02-02 10:04:34,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:04:34,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 10:04:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:34,874 INFO L225 Difference]: With dead ends: 294 [2018-02-02 10:04:34,874 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 10:04:34,875 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:04:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 10:04:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 258. [2018-02-02 10:04:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 10:04:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions. [2018-02-02 10:04:34,880 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 22 [2018-02-02 10:04:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:34,881 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions. [2018-02-02 10:04:34,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:04:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions. [2018-02-02 10:04:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:04:34,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:34,881 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:04:34,882 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:04:34,882 INFO L82 PathProgramCache]: Analyzing trace with hash 929227204, now seen corresponding path program 1 times [2018-02-02 10:04:34,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:34,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:34,918 INFO L134 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:04:34,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:34,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:04:34,919 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:34,919 INFO L182 omatonBuilderFactory]: Interpolants [3744#(= 1 (select |#valid| |create_data_#t~malloc3.base|)), 3745#(= 1 (select |#valid| create_data_~data~0.base)), 3742#true, 3743#false] [2018-02-02 10:04:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:34,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:04:34,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:04:34,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:04:34,920 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand 4 states. [2018-02-02 10:04:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:35,041 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2018-02-02 10:04:35,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:04:35,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 10:04:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:35,043 INFO L225 Difference]: With dead ends: 247 [2018-02-02 10:04:35,043 INFO L226 Difference]: Without dead ends: 247 [2018-02-02 10:04:35,043 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:04:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-02 10:04:35,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-02-02 10:04:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-02 10:04:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 285 transitions. [2018-02-02 10:04:35,048 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 285 transitions. Word has length 26 [2018-02-02 10:04:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:35,048 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 285 transitions. [2018-02-02 10:04:35,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:04:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 285 transitions. [2018-02-02 10:04:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:04:35,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:35,049 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:04:35,049 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:04:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash 929227205, now seen corresponding path program 1 times [2018-02-02 10:04:35,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:35,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:35,103 INFO L134 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:04:35,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:35,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:04:35,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:35,108 INFO L134 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:04:35,109 INFO L182 omatonBuilderFactory]: Interpolants [4240#true, 4241#false, 4242#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 0 |create_data_#t~malloc3.offset|) (= 16 (select |#length| |create_data_#t~malloc3.base|))), 4243#(and (= create_data_~data~0.offset 0) (= (select |#valid| create_data_~data~0.base) 1) (= 16 (select |#length| create_data_~data~0.base))), 4244#(and (= create_data_~data~0.offset 0) (= (select |#length| create_data_~data~0.base) 16))] [2018-02-02 10:04:35,109 INFO L134 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:04:35,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:04:35,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:04:35,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:04:35,109 INFO L87 Difference]: Start difference. First operand 245 states and 285 transitions. Second operand 5 states. [2018-02-02 10:04:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:35,275 INFO L93 Difference]: Finished difference Result 234 states and 261 transitions. [2018-02-02 10:04:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:04:35,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 10:04:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:35,276 INFO L225 Difference]: With dead ends: 234 [2018-02-02 10:04:35,276 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 10:04:35,277 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:04:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 10:04:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-02-02 10:04:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 10:04:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 259 transitions. [2018-02-02 10:04:35,280 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 259 transitions. Word has length 26 [2018-02-02 10:04:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:35,280 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 259 transitions. [2018-02-02 10:04:35,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:04:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 259 transitions. [2018-02-02 10:04:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:04:35,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:35,280 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:04:35,280 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:04:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437674, now seen corresponding path program 1 times [2018-02-02 10:04:35,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:35,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:35,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:35,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:04:35,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:35,313 INFO L182 omatonBuilderFactory]: Interpolants [4713#true, 4714#false, 4715#(= 1 (select |#valid| |create_data_#t~malloc4.base|)), 4716#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 4717#(= 1 (select |#valid| |create_data_#t~mem7.base|))] [2018-02-02 10:04:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:35,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:04:35,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:04:35,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:04:35,314 INFO L87 Difference]: Start difference. First operand 232 states and 259 transitions. Second operand 5 states. [2018-02-02 10:04:35,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:35,493 INFO L93 Difference]: Finished difference Result 299 states and 339 transitions. [2018-02-02 10:04:35,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:04:35,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 10:04:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:35,494 INFO L225 Difference]: With dead ends: 299 [2018-02-02 10:04:35,495 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 10:04:35,495 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:04:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 10:04:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 242. [2018-02-02 10:04:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:04:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2018-02-02 10:04:35,499 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 32 [2018-02-02 10:04:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:35,500 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2018-02-02 10:04:35,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:04:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2018-02-02 10:04:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:04:35,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:35,500 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:04:35,500 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:04:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437675, now seen corresponding path program 1 times [2018-02-02 10:04:35,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:35,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:35,581 INFO L134 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:04:35,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:35,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:04:35,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:35,581 INFO L134 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:04:35,582 INFO L182 omatonBuilderFactory]: Interpolants [5265#true, 5266#false, 5267#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (= 0 |create_data_#t~malloc4.offset|)), 5268#(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))))), 5269#(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))))), 5270#(and (= create_data_~counter~0 0) (= (select |#length| |create_data_#t~mem7.base|) 80) (= |create_data_#t~mem7.offset| 0))] [2018-02-02 10:04:35,582 INFO L134 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:04:35,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:04:35,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:04:35,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:04:35,582 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand 6 states. [2018-02-02 10:04:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:35,735 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2018-02-02 10:04:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:04:35,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 10:04:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:35,737 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:04:35,737 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:04:35,737 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:04:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:04:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2018-02-02 10:04:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:04:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2018-02-02 10:04:35,742 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 32 [2018-02-02 10:04:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:35,743 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2018-02-02 10:04:35,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:04:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2018-02-02 10:04:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:04:35,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:35,744 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:04:35,744 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:04:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693333, now seen corresponding path program 1 times [2018-02-02 10:04:35,745 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:35,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:35,842 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:04:35,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:35,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:04:35,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:35,842 INFO L134 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:04:35,843 INFO L182 omatonBuilderFactory]: Interpolants [5776#(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))))), 5777#(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))))), 5778#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 5779#(= 1 (select |#valid| |create_data_#t~mem7.base|)), 5771#true, 5772#false, 5773#(= (select |#valid| |create_data_#t~malloc3.base|) 1), 5774#(= (select |#valid| create_data_~data~0.base) 1), 5775#(and (not (= create_data_~data~0.base |create_data_#t~malloc4.base|)) (= 1 (select |#valid| |create_data_#t~malloc4.base|)))] [2018-02-02 10:04:35,843 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:04:35,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:04:35,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:04:35,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:04:35,843 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 9 states. [2018-02-02 10:04:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:36,188 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2018-02-02 10:04:36,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:04:36,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:04:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:36,190 INFO L225 Difference]: With dead ends: 249 [2018-02-02 10:04:36,190 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 10:04:36,190 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:04:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 10:04:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2018-02-02 10:04:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 10:04:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 267 transitions. [2018-02-02 10:04:36,196 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 267 transitions. Word has length 39 [2018-02-02 10:04:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:36,196 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 267 transitions. [2018-02-02 10:04:36,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:04:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 267 transitions. [2018-02-02 10:04:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:04:36,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:36,197 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:04:36,197 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:04:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693334, now seen corresponding path program 1 times [2018-02-02 10:04:36,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:36,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:36,395 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:04:36,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:36,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:04:36,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:36,396 INFO L134 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:04:36,396 INFO L182 omatonBuilderFactory]: Interpolants [6288#(and (<= create_data_~counter~0 19) (= 80 (select |#length| |create_data_#t~mem7.base|)) (= |create_data_#t~mem7.offset| 0) (<= 1 create_data_~counter~0)), 6278#true, 6279#false, 6280#(= (select |#valid| |create_data_#t~malloc3.base|) 1), 6281#(= (select |#valid| create_data_~data~0.base) 1), 6282#(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|)), 6283#(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))))), 6284#(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))))) (< 72 (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0)))) (= |create_data_#t~mem7.offset| 0)), 6285#(or (<= 19 create_data_~counter~0) (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)))))), 6286#(or (<= 20 create_data_~counter~0) (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)))))), 6287#(and (<= create_data_~counter~0 19) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 1 create_data_~counter~0) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))))] [2018-02-02 10:04:36,397 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:04:36,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:04:36,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:04:36,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:04:36,397 INFO L87 Difference]: Start difference. First operand 241 states and 267 transitions. Second operand 11 states. [2018-02-02 10:04:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:36,906 INFO L93 Difference]: Finished difference Result 252 states and 277 transitions. [2018-02-02 10:04:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:04:36,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-02-02 10:04:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:36,907 INFO L225 Difference]: With dead ends: 252 [2018-02-02 10:04:36,907 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 10:04:36,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:04:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 10:04:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 234. [2018-02-02 10:04:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 10:04:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 259 transitions. [2018-02-02 10:04:36,913 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 259 transitions. Word has length 39 [2018-02-02 10:04:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:36,913 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 259 transitions. [2018-02-02 10:04:36,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:04:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 259 transitions. [2018-02-02 10:04:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:04:36,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:36,914 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] [2018-02-02 10:04:36,914 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:04:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1839266135, now seen corresponding path program 1 times [2018-02-02 10:04:36,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:36,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:36,948 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:04:36,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:36,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:04:36,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:36,949 INFO L134 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:04:36,949 INFO L182 omatonBuilderFactory]: Interpolants [6791#true, 6792#false, 6793#(= 1 (select |#valid| |create_data_#t~malloc22.base|)), 6794#(= 1 (select |#valid| create_data_~nextData~0.base))] [2018-02-02 10:04:36,949 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:04:36,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:04:36,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:04:36,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:04:36,950 INFO L87 Difference]: Start difference. First operand 234 states and 259 transitions. Second operand 4 states. [2018-02-02 10:04:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,092 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2018-02-02 10:04:37,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:04:37,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-02-02 10:04:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,093 INFO L225 Difference]: With dead ends: 236 [2018-02-02 10:04:37,093 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 10:04:37,094 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:04:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 10:04:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2018-02-02 10:04:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:04:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 251 transitions. [2018-02-02 10:04:37,099 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 251 transitions. Word has length 49 [2018-02-02 10:04:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,099 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 251 transitions. [2018-02-02 10:04:37,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:04:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2018-02-02 10:04:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:04:37,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,100 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] [2018-02-02 10:04:37,100 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:04:37,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1839266134, now seen corresponding path program 1 times [2018-02-02 10:04:37,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,149 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:04:37,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:37,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:04:37,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,150 INFO L134 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:04:37,150 INFO L182 omatonBuilderFactory]: Interpolants [7264#false, 7265#(and (= 0 |create_data_#t~malloc22.offset|) (= 16 (select |#length| |create_data_#t~malloc22.base|))), 7266#(and (= (select |#length| create_data_~nextData~0.base) 16) (= create_data_~nextData~0.offset 0)), 7263#true] [2018-02-02 10:04:37,150 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:04:37,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:04:37,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:04:37,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:04:37,151 INFO L87 Difference]: Start difference. First operand 230 states and 251 transitions. Second operand 4 states. [2018-02-02 10:04:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,244 INFO L93 Difference]: Finished difference Result 232 states and 249 transitions. [2018-02-02 10:04:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:04:37,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-02-02 10:04:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,245 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:04:37,245 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:04:37,245 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:04:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:04:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 226. [2018-02-02 10:04:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 10:04:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions. [2018-02-02 10:04:37,249 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 49 [2018-02-02 10:04:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,249 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 243 transitions. [2018-02-02 10:04:37,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:04:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 243 transitions. [2018-02-02 10:04:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:04:37,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,250 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] [2018-02-02 10:04:37,250 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:04:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1851831937, now seen corresponding path program 1 times [2018-02-02 10:04:37,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,291 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:04:37,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:37,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:04:37,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,292 INFO L134 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:04:37,292 INFO L182 omatonBuilderFactory]: Interpolants [7728#false, 7729#(= create_data_~counter~0 0), 7730#(<= create_data_~counter~0 1), 7727#true] [2018-02-02 10:04:37,292 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:04:37,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:04:37,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:04:37,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:04:37,292 INFO L87 Difference]: Start difference. First operand 226 states and 243 transitions. Second operand 4 states. [2018-02-02 10:04:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,301 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-02-02 10:04:37,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:04:37,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-02-02 10:04:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,302 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:04:37,302 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:04:37,303 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:04:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:04:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2018-02-02 10:04:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 10:04:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 257 transitions. [2018-02-02 10:04:37,307 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 257 transitions. Word has length 52 [2018-02-02 10:04:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,307 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 257 transitions. [2018-02-02 10:04:37,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:04:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 257 transitions. [2018-02-02 10:04:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:04:37,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,308 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] [2018-02-02 10:04:37,308 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:04:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash -236706454, now seen corresponding path program 2 times [2018-02-02 10:04:37,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,353 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:04:37,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:37,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:04:37,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,354 INFO L182 omatonBuilderFactory]: Interpolants [8224#(<= create_data_~counter~0 1), 8225#(<= create_data_~counter~0 2), 8221#true, 8222#false, 8223#(= create_data_~counter~0 0)] [2018-02-02 10:04:37,354 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:04:37,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:04:37,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:04:37,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:04:37,355 INFO L87 Difference]: Start difference. First operand 240 states and 257 transitions. Second operand 5 states. [2018-02-02 10:04:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,370 INFO L93 Difference]: Finished difference Result 264 states and 281 transitions. [2018-02-02 10:04:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:04:37,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-02-02 10:04:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,373 INFO L225 Difference]: With dead ends: 264 [2018-02-02 10:04:37,373 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 10:04:37,374 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:04:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 10:04:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-02-02 10:04:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:04:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2018-02-02 10:04:37,378 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 59 [2018-02-02 10:04:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,378 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2018-02-02 10:04:37,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:04:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2018-02-02 10:04:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:04:37,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,379 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] [2018-02-02 10:04:37,379 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:04:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2050431775, now seen corresponding path program 3 times [2018-02-02 10:04:37,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:37,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:04:37,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,434 INFO L134 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:04:37,434 INFO L182 omatonBuilderFactory]: Interpolants [8744#true, 8745#false, 8746#(= create_data_~counter~0 0), 8747#(<= create_data_~counter~0 1), 8748#(<= create_data_~counter~0 2), 8749#(<= create_data_~counter~0 3)] [2018-02-02 10:04:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:04:37,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:04:37,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:04:37,435 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand 6 states. [2018-02-02 10:04:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,452 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-02-02 10:04:37,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:04:37,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-02-02 10:04:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,454 INFO L225 Difference]: With dead ends: 278 [2018-02-02 10:04:37,454 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 10:04:37,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:04:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 10:04:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2018-02-02 10:04:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:04:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-02-02 10:04:37,458 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 66 [2018-02-02 10:04:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,459 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-02-02 10:04:37,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:04:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-02-02 10:04:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:04:37,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,460 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:37,460 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:04:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1137393610, now seen corresponding path program 4 times [2018-02-02 10:04:37,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:37,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:04:37,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,522 INFO L134 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:04:37,522 INFO L182 omatonBuilderFactory]: Interpolants [9296#true, 9297#false, 9298#(= create_data_~counter~0 0), 9299#(<= create_data_~counter~0 1), 9300#(<= create_data_~counter~0 2), 9301#(<= create_data_~counter~0 3), 9302#(<= create_data_~counter~0 4)] [2018-02-02 10:04:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:04:37,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:04:37,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:04:37,523 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 7 states. [2018-02-02 10:04:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,545 INFO L93 Difference]: Finished difference Result 292 states and 309 transitions. [2018-02-02 10:04:37,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:04:37,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-02-02 10:04:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,546 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:04:37,546 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:04:37,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:04:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:04:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2018-02-02 10:04:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 10:04:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 299 transitions. [2018-02-02 10:04:37,551 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 299 transitions. Word has length 73 [2018-02-02 10:04:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,551 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 299 transitions. [2018-02-02 10:04:37,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:04:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 299 transitions. [2018-02-02 10:04:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:04:37,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,552 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:37,552 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:04:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1500484799, now seen corresponding path program 5 times [2018-02-02 10:04:37,553 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:37,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:04:37,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,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:04:37,619 INFO L182 omatonBuilderFactory]: Interpolants [9877#true, 9878#false, 9879#(= create_data_~counter~0 0), 9880#(<= create_data_~counter~0 1), 9881#(<= create_data_~counter~0 2), 9882#(<= create_data_~counter~0 3), 9883#(<= create_data_~counter~0 4), 9884#(<= create_data_~counter~0 5)] [2018-02-02 10:04:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:04:37,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:04:37,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:04:37,620 INFO L87 Difference]: Start difference. First operand 282 states and 299 transitions. Second operand 8 states. [2018-02-02 10:04:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,644 INFO L93 Difference]: Finished difference Result 306 states and 323 transitions. [2018-02-02 10:04:37,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:04:37,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2018-02-02 10:04:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,646 INFO L225 Difference]: With dead ends: 306 [2018-02-02 10:04:37,646 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 10:04:37,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:04:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 10:04:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 296. [2018-02-02 10:04:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 10:04:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 313 transitions. [2018-02-02 10:04:37,651 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 313 transitions. Word has length 80 [2018-02-02 10:04:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,651 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 313 transitions. [2018-02-02 10:04:37,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:04:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 313 transitions. [2018-02-02 10:04:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:04:37,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,652 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:04:37,652 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:04:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1333480918, now seen corresponding path program 6 times [2018-02-02 10:04:37,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:37,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:04:37,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,733 INFO L182 omatonBuilderFactory]: Interpolants [10487#true, 10488#false, 10489#(= create_data_~counter~0 0), 10490#(<= create_data_~counter~0 1), 10491#(<= create_data_~counter~0 2), 10492#(<= create_data_~counter~0 3), 10493#(<= create_data_~counter~0 4), 10494#(<= create_data_~counter~0 5), 10495#(<= create_data_~counter~0 6)] [2018-02-02 10:04:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:04:37,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:04:37,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:04:37,734 INFO L87 Difference]: Start difference. First operand 296 states and 313 transitions. Second operand 9 states. [2018-02-02 10:04:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,796 INFO L93 Difference]: Finished difference Result 320 states and 337 transitions. [2018-02-02 10:04:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:04:37,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-02-02 10:04:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,798 INFO L225 Difference]: With dead ends: 320 [2018-02-02 10:04:37,798 INFO L226 Difference]: Without dead ends: 320 [2018-02-02 10:04:37,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:04:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-02 10:04:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 310. [2018-02-02 10:04:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 10:04:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 327 transitions. [2018-02-02 10:04:37,802 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 327 transitions. Word has length 87 [2018-02-02 10:04:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,832 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 327 transitions. [2018-02-02 10:04:37,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:04:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 327 transitions. [2018-02-02 10:04:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:04:37,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,833 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:37,833 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:04:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash 352499295, now seen corresponding path program 7 times [2018-02-02 10:04:37,834 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:37,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:04:37,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,926 INFO L182 omatonBuilderFactory]: Interpolants [11126#true, 11127#false, 11128#(= create_data_~counter~0 0), 11129#(<= create_data_~counter~0 1), 11130#(<= create_data_~counter~0 2), 11131#(<= create_data_~counter~0 3), 11132#(<= create_data_~counter~0 4), 11133#(<= create_data_~counter~0 5), 11134#(<= create_data_~counter~0 6), 11135#(<= create_data_~counter~0 7)] [2018-02-02 10:04:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:37,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:04:37,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:04:37,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:04:37,927 INFO L87 Difference]: Start difference. First operand 310 states and 327 transitions. Second operand 10 states. [2018-02-02 10:04:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:37,957 INFO L93 Difference]: Finished difference Result 334 states and 351 transitions. [2018-02-02 10:04:37,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:04:37,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-02-02 10:04:37,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:37,958 INFO L225 Difference]: With dead ends: 334 [2018-02-02 10:04:37,958 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 10:04:37,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:04:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 10:04:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2018-02-02 10:04:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-02 10:04:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 341 transitions. [2018-02-02 10:04:37,963 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 341 transitions. Word has length 94 [2018-02-02 10:04:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:37,963 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 341 transitions. [2018-02-02 10:04:37,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:04:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 341 transitions. [2018-02-02 10:04:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 10:04:37,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:37,964 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:37,964 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:04:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1293319306, now seen corresponding path program 8 times [2018-02-02 10:04:37,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:37,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:38,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:04:38,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:38,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:04:38,068 INFO L182 omatonBuilderFactory]: Interpolants [11794#true, 11795#false, 11796#(= create_data_~counter~0 0), 11797#(<= create_data_~counter~0 1), 11798#(<= create_data_~counter~0 2), 11799#(<= create_data_~counter~0 3), 11800#(<= create_data_~counter~0 4), 11801#(<= create_data_~counter~0 5), 11802#(<= create_data_~counter~0 6), 11803#(<= create_data_~counter~0 7), 11804#(<= create_data_~counter~0 8)] [2018-02-02 10:04:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:04:38,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:04:38,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:04:38,069 INFO L87 Difference]: Start difference. First operand 324 states and 341 transitions. Second operand 11 states. [2018-02-02 10:04:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:38,097 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-02-02 10:04:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:04:38,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-02-02 10:04:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:38,099 INFO L225 Difference]: With dead ends: 348 [2018-02-02 10:04:38,099 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 10:04:38,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:04:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 10:04:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 338. [2018-02-02 10:04:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 10:04:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 355 transitions. [2018-02-02 10:04:38,104 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 355 transitions. Word has length 101 [2018-02-02 10:04:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:38,104 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 355 transitions. [2018-02-02 10:04:38,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:04:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 355 transitions. [2018-02-02 10:04:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 10:04:38,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:38,105 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,105 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:04:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 86671359, now seen corresponding path program 9 times [2018-02-02 10:04:38,106 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:38,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:38,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:04:38,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:38,225 INFO L134 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:04:38,225 INFO L182 omatonBuilderFactory]: Interpolants [12496#(<= create_data_~counter~0 3), 12497#(<= create_data_~counter~0 4), 12498#(<= create_data_~counter~0 5), 12499#(<= create_data_~counter~0 6), 12500#(<= create_data_~counter~0 7), 12501#(<= create_data_~counter~0 8), 12502#(<= create_data_~counter~0 9), 12491#true, 12492#false, 12493#(= create_data_~counter~0 0), 12494#(<= create_data_~counter~0 1), 12495#(<= create_data_~counter~0 2)] [2018-02-02 10:04:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:04:38,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:04:38,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:04:38,226 INFO L87 Difference]: Start difference. First operand 338 states and 355 transitions. Second operand 12 states. [2018-02-02 10:04:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:38,248 INFO L93 Difference]: Finished difference Result 362 states and 379 transitions. [2018-02-02 10:04:38,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:04:38,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-02-02 10:04:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:38,250 INFO L225 Difference]: With dead ends: 362 [2018-02-02 10:04:38,250 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 10:04:38,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:04:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 10:04:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2018-02-02 10:04:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 10:04:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 369 transitions. [2018-02-02 10:04:38,253 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 369 transitions. Word has length 108 [2018-02-02 10:04:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:38,253 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 369 transitions. [2018-02-02 10:04:38,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:04:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 369 transitions. [2018-02-02 10:04:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-02 10:04:38,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:38,254 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,254 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:04:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -335110422, now seen corresponding path program 10 times [2018-02-02 10:04:38,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:38,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:38,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:04:38,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,371 INFO L182 omatonBuilderFactory]: Interpolants [13217#true, 13218#false, 13219#(= create_data_~counter~0 0), 13220#(<= create_data_~counter~0 1), 13221#(<= create_data_~counter~0 2), 13222#(<= create_data_~counter~0 3), 13223#(<= create_data_~counter~0 4), 13224#(<= create_data_~counter~0 5), 13225#(<= create_data_~counter~0 6), 13226#(<= create_data_~counter~0 7), 13227#(<= create_data_~counter~0 8), 13228#(<= create_data_~counter~0 9), 13229#(<= create_data_~counter~0 10)] [2018-02-02 10:04:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:04:38,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:04:38,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:04:38,373 INFO L87 Difference]: Start difference. First operand 352 states and 369 transitions. Second operand 13 states. [2018-02-02 10:04:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:38,418 INFO L93 Difference]: Finished difference Result 376 states and 393 transitions. [2018-02-02 10:04:38,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:04:38,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-02-02 10:04:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:38,419 INFO L225 Difference]: With dead ends: 376 [2018-02-02 10:04:38,419 INFO L226 Difference]: Without dead ends: 376 [2018-02-02 10:04:38,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:04:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-02 10:04:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 366. [2018-02-02 10:04:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 10:04:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 383 transitions. [2018-02-02 10:04:38,422 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 383 transitions. Word has length 115 [2018-02-02 10:04:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:38,422 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 383 transitions. [2018-02-02 10:04:38,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:04:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 383 transitions. [2018-02-02 10:04:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 10:04:38,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:38,423 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,423 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:04:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1801391713, now seen corresponding path program 11 times [2018-02-02 10:04:38,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:38,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:38,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:04:38,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:38,548 INFO L134 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:04:38,548 INFO L182 omatonBuilderFactory]: Interpolants [13984#(<= create_data_~counter~0 10), 13985#(<= create_data_~counter~0 11), 13972#true, 13973#false, 13974#(= create_data_~counter~0 0), 13975#(<= create_data_~counter~0 1), 13976#(<= create_data_~counter~0 2), 13977#(<= create_data_~counter~0 3), 13978#(<= create_data_~counter~0 4), 13979#(<= create_data_~counter~0 5), 13980#(<= create_data_~counter~0 6), 13981#(<= create_data_~counter~0 7), 13982#(<= create_data_~counter~0 8), 13983#(<= create_data_~counter~0 9)] [2018-02-02 10:04:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:04:38,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:04:38,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:04:38,549 INFO L87 Difference]: Start difference. First operand 366 states and 383 transitions. Second operand 14 states. [2018-02-02 10:04:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:38,584 INFO L93 Difference]: Finished difference Result 390 states and 407 transitions. [2018-02-02 10:04:38,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:04:38,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 122 [2018-02-02 10:04:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:38,586 INFO L225 Difference]: With dead ends: 390 [2018-02-02 10:04:38,586 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 10:04:38,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:04:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 10:04:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 380. [2018-02-02 10:04:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 10:04:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 397 transitions. [2018-02-02 10:04:38,590 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 397 transitions. Word has length 122 [2018-02-02 10:04:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:38,591 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 397 transitions. [2018-02-02 10:04:38,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:04:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 397 transitions. [2018-02-02 10:04:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 10:04:38,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:38,592 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,592 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:04:38,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2103122250, now seen corresponding path program 12 times [2018-02-02 10:04:38,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:38,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:38,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:04:38,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:38,750 INFO L134 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:04:38,750 INFO L182 omatonBuilderFactory]: Interpolants [14756#true, 14757#false, 14758#(= create_data_~counter~0 0), 14759#(<= create_data_~counter~0 1), 14760#(<= create_data_~counter~0 2), 14761#(<= create_data_~counter~0 3), 14762#(<= create_data_~counter~0 4), 14763#(<= create_data_~counter~0 5), 14764#(<= create_data_~counter~0 6), 14765#(<= create_data_~counter~0 7), 14766#(<= create_data_~counter~0 8), 14767#(<= create_data_~counter~0 9), 14768#(<= create_data_~counter~0 10), 14769#(<= create_data_~counter~0 11), 14770#(<= create_data_~counter~0 12)] [2018-02-02 10:04:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:04:38,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:04:38,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:04:38,752 INFO L87 Difference]: Start difference. First operand 380 states and 397 transitions. Second operand 15 states. [2018-02-02 10:04:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:38,810 INFO L93 Difference]: Finished difference Result 404 states and 421 transitions. [2018-02-02 10:04:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:04:38,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 129 [2018-02-02 10:04:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:38,811 INFO L225 Difference]: With dead ends: 404 [2018-02-02 10:04:38,812 INFO L226 Difference]: Without dead ends: 404 [2018-02-02 10:04:38,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:04:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-02-02 10:04:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 394. [2018-02-02 10:04:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-02 10:04:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 411 transitions. [2018-02-02 10:04:38,815 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 411 transitions. Word has length 129 [2018-02-02 10:04:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:38,815 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 411 transitions. [2018-02-02 10:04:38,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:04:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 411 transitions. [2018-02-02 10:04:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 10:04:38,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:38,816 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,816 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:04:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash -526382273, now seen corresponding path program 13 times [2018-02-02 10:04:38,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:38,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:38,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:04:38,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:38,976 INFO L134 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:04:38,976 INFO L182 omatonBuilderFactory]: Interpolants [15584#(<= create_data_~counter~0 13), 15569#true, 15570#false, 15571#(= create_data_~counter~0 0), 15572#(<= create_data_~counter~0 1), 15573#(<= create_data_~counter~0 2), 15574#(<= create_data_~counter~0 3), 15575#(<= create_data_~counter~0 4), 15576#(<= create_data_~counter~0 5), 15577#(<= create_data_~counter~0 6), 15578#(<= create_data_~counter~0 7), 15579#(<= create_data_~counter~0 8), 15580#(<= create_data_~counter~0 9), 15581#(<= create_data_~counter~0 10), 15582#(<= create_data_~counter~0 11), 15583#(<= create_data_~counter~0 12)] [2018-02-02 10:04:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:38,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:04:38,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:04:38,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:04:38,977 INFO L87 Difference]: Start difference. First operand 394 states and 411 transitions. Second operand 16 states. [2018-02-02 10:04:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:39,027 INFO L93 Difference]: Finished difference Result 418 states and 435 transitions. [2018-02-02 10:04:39,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:04:39,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 136 [2018-02-02 10:04:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:39,028 INFO L225 Difference]: With dead ends: 418 [2018-02-02 10:04:39,029 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 10:04:39,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:04:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 10:04:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 408. [2018-02-02 10:04:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-02 10:04:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 425 transitions. [2018-02-02 10:04:39,034 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 425 transitions. Word has length 136 [2018-02-02 10:04:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:39,035 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 425 transitions. [2018-02-02 10:04:39,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:04:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 425 transitions. [2018-02-02 10:04:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 10:04:39,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:39,036 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,036 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:04:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1855581098, now seen corresponding path program 14 times [2018-02-02 10:04:39,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:39,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:39,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:39,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:04:39,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:39,231 INFO L134 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:04:39,231 INFO L182 omatonBuilderFactory]: Interpolants [16416#(<= create_data_~counter~0 3), 16417#(<= create_data_~counter~0 4), 16418#(<= create_data_~counter~0 5), 16419#(<= create_data_~counter~0 6), 16420#(<= create_data_~counter~0 7), 16421#(<= create_data_~counter~0 8), 16422#(<= create_data_~counter~0 9), 16423#(<= create_data_~counter~0 10), 16424#(<= create_data_~counter~0 11), 16425#(<= create_data_~counter~0 12), 16426#(<= create_data_~counter~0 13), 16427#(<= create_data_~counter~0 14), 16411#true, 16412#false, 16413#(= create_data_~counter~0 0), 16414#(<= create_data_~counter~0 1), 16415#(<= create_data_~counter~0 2)] [2018-02-02 10:04:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:39,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:04:39,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:04:39,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:04:39,232 INFO L87 Difference]: Start difference. First operand 408 states and 425 transitions. Second operand 17 states. [2018-02-02 10:04:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:39,288 INFO L93 Difference]: Finished difference Result 432 states and 449 transitions. [2018-02-02 10:04:39,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:04:39,288 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-02-02 10:04:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:39,290 INFO L225 Difference]: With dead ends: 432 [2018-02-02 10:04:39,290 INFO L226 Difference]: Without dead ends: 432 [2018-02-02 10:04:39,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:04:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-02-02 10:04:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 422. [2018-02-02 10:04:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 10:04:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 439 transitions. [2018-02-02 10:04:39,295 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 439 transitions. Word has length 143 [2018-02-02 10:04:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:39,295 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 439 transitions. [2018-02-02 10:04:39,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:04:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 439 transitions. [2018-02-02 10:04:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-02 10:04:39,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:39,296 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,296 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:04:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1491193055, now seen corresponding path program 15 times [2018-02-02 10:04:39,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:39,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:39,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:39,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:04:39,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:39,525 INFO L134 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:04:39,525 INFO L182 omatonBuilderFactory]: Interpolants [17282#true, 17283#false, 17284#(= create_data_~counter~0 0), 17285#(<= create_data_~counter~0 1), 17286#(<= create_data_~counter~0 2), 17287#(<= create_data_~counter~0 3), 17288#(<= create_data_~counter~0 4), 17289#(<= create_data_~counter~0 5), 17290#(<= create_data_~counter~0 6), 17291#(<= create_data_~counter~0 7), 17292#(<= create_data_~counter~0 8), 17293#(<= create_data_~counter~0 9), 17294#(<= create_data_~counter~0 10), 17295#(<= create_data_~counter~0 11), 17296#(<= create_data_~counter~0 12), 17297#(<= create_data_~counter~0 13), 17298#(<= create_data_~counter~0 14), 17299#(<= create_data_~counter~0 15)] [2018-02-02 10:04:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:39,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:04:39,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:04:39,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:04:39,526 INFO L87 Difference]: Start difference. First operand 422 states and 439 transitions. Second operand 18 states. [2018-02-02 10:04:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:39,592 INFO L93 Difference]: Finished difference Result 446 states and 463 transitions. [2018-02-02 10:04:39,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:04:39,594 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 150 [2018-02-02 10:04:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:39,596 INFO L225 Difference]: With dead ends: 446 [2018-02-02 10:04:39,596 INFO L226 Difference]: Without dead ends: 446 [2018-02-02 10:04:39,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:04:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-02 10:04:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 436. [2018-02-02 10:04:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 10:04:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 453 transitions. [2018-02-02 10:04:39,601 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 453 transitions. Word has length 150 [2018-02-02 10:04:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:39,602 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 453 transitions. [2018-02-02 10:04:39,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:04:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 453 transitions. [2018-02-02 10:04:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 10:04:39,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:39,603 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,603 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:04:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash 180950538, now seen corresponding path program 16 times [2018-02-02 10:04:39,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:39,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:39,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:39,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:04:39,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:39,836 INFO L134 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:04:39,836 INFO L182 omatonBuilderFactory]: Interpolants [18182#true, 18183#false, 18184#(= create_data_~counter~0 0), 18185#(<= create_data_~counter~0 1), 18186#(<= create_data_~counter~0 2), 18187#(<= create_data_~counter~0 3), 18188#(<= create_data_~counter~0 4), 18189#(<= create_data_~counter~0 5), 18190#(<= create_data_~counter~0 6), 18191#(<= create_data_~counter~0 7), 18192#(<= create_data_~counter~0 8), 18193#(<= create_data_~counter~0 9), 18194#(<= create_data_~counter~0 10), 18195#(<= create_data_~counter~0 11), 18196#(<= create_data_~counter~0 12), 18197#(<= create_data_~counter~0 13), 18198#(<= create_data_~counter~0 14), 18199#(<= create_data_~counter~0 15), 18200#(<= create_data_~counter~0 16)] [2018-02-02 10:04:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:39,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:04:39,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:04:39,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:04:39,837 INFO L87 Difference]: Start difference. First operand 436 states and 453 transitions. Second operand 19 states. [2018-02-02 10:04:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:39,902 INFO L93 Difference]: Finished difference Result 460 states and 477 transitions. [2018-02-02 10:04:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:04:39,903 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 157 [2018-02-02 10:04:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:39,904 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:04:39,904 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 10:04:39,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:04:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 10:04:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 450. [2018-02-02 10:04:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-02-02 10:04:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 467 transitions. [2018-02-02 10:04:39,910 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 467 transitions. Word has length 157 [2018-02-02 10:04:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:39,910 INFO L432 AbstractCegarLoop]: Abstraction has 450 states and 467 transitions. [2018-02-02 10:04:39,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:04:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 467 transitions. [2018-02-02 10:04:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-02 10:04:39,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:39,911 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,912 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:04:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1604335231, now seen corresponding path program 17 times [2018-02-02 10:04:39,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:39,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:40,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:40,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:04:40,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:40,196 INFO L182 omatonBuilderFactory]: Interpolants [19111#true, 19112#false, 19113#(= create_data_~counter~0 0), 19114#(<= create_data_~counter~0 1), 19115#(<= create_data_~counter~0 2), 19116#(<= create_data_~counter~0 3), 19117#(<= create_data_~counter~0 4), 19118#(<= create_data_~counter~0 5), 19119#(<= create_data_~counter~0 6), 19120#(<= create_data_~counter~0 7), 19121#(<= create_data_~counter~0 8), 19122#(<= create_data_~counter~0 9), 19123#(<= create_data_~counter~0 10), 19124#(<= create_data_~counter~0 11), 19125#(<= create_data_~counter~0 12), 19126#(<= create_data_~counter~0 13), 19127#(<= create_data_~counter~0 14), 19128#(<= create_data_~counter~0 15), 19129#(<= create_data_~counter~0 16), 19130#(<= create_data_~counter~0 17)] [2018-02-02 10:04:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:40,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:04:40,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:04:40,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:04:40,197 INFO L87 Difference]: Start difference. First operand 450 states and 467 transitions. Second operand 20 states. [2018-02-02 10:04:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:40,280 INFO L93 Difference]: Finished difference Result 474 states and 491 transitions. [2018-02-02 10:04:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:04:40,280 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 164 [2018-02-02 10:04:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:40,281 INFO L225 Difference]: With dead ends: 474 [2018-02-02 10:04:40,281 INFO L226 Difference]: Without dead ends: 474 [2018-02-02 10:04:40,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:04:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-02-02 10:04:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 464. [2018-02-02 10:04:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-02-02 10:04:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 481 transitions. [2018-02-02 10:04:40,286 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 481 transitions. Word has length 164 [2018-02-02 10:04:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:40,287 INFO L432 AbstractCegarLoop]: Abstraction has 464 states and 481 transitions. [2018-02-02 10:04:40,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:04:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 481 transitions. [2018-02-02 10:04:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-02 10:04:40,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:40,288 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:40,288 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:04:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -630286230, now seen corresponding path program 18 times [2018-02-02 10:04:40,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:40,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:40,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:40,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:04:40,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:40,553 INFO L134 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:04:40,553 INFO L182 omatonBuilderFactory]: Interpolants [20069#true, 20070#false, 20071#(= create_data_~counter~0 0), 20072#(<= create_data_~counter~0 1), 20073#(<= create_data_~counter~0 2), 20074#(<= create_data_~counter~0 3), 20075#(<= create_data_~counter~0 4), 20076#(<= create_data_~counter~0 5), 20077#(<= create_data_~counter~0 6), 20078#(<= create_data_~counter~0 7), 20079#(<= create_data_~counter~0 8), 20080#(<= create_data_~counter~0 9), 20081#(<= create_data_~counter~0 10), 20082#(<= create_data_~counter~0 11), 20083#(<= create_data_~counter~0 12), 20084#(<= create_data_~counter~0 13), 20085#(<= create_data_~counter~0 14), 20086#(<= create_data_~counter~0 15), 20087#(<= create_data_~counter~0 16), 20088#(<= create_data_~counter~0 17), 20089#(<= create_data_~counter~0 18)] [2018-02-02 10:04:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:40,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:04:40,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:04:40,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:04:40,555 INFO L87 Difference]: Start difference. First operand 464 states and 481 transitions. Second operand 21 states. [2018-02-02 10:04:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:40,641 INFO L93 Difference]: Finished difference Result 488 states and 505 transitions. [2018-02-02 10:04:40,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:04:40,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 171 [2018-02-02 10:04:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:40,643 INFO L225 Difference]: With dead ends: 488 [2018-02-02 10:04:40,643 INFO L226 Difference]: Without dead ends: 488 [2018-02-02 10:04:40,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:04:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-02-02 10:04:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2018-02-02 10:04:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-02-02 10:04:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 495 transitions. [2018-02-02 10:04:40,648 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 495 transitions. Word has length 171 [2018-02-02 10:04:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:40,648 INFO L432 AbstractCegarLoop]: Abstraction has 478 states and 495 transitions. [2018-02-02 10:04:40,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:04:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 495 transitions. [2018-02-02 10:04:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 10:04:40,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:40,649 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:40,649 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:04:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -376092641, now seen corresponding path program 19 times [2018-02-02 10:04:40,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:40,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:40,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:40,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:04:40,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:40,915 INFO L134 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:04:40,915 INFO L182 omatonBuilderFactory]: Interpolants [21056#true, 21057#false, 21058#(= create_data_~counter~0 0), 21059#(<= create_data_~counter~0 1), 21060#(<= create_data_~counter~0 2), 21061#(<= create_data_~counter~0 3), 21062#(<= create_data_~counter~0 4), 21063#(<= create_data_~counter~0 5), 21064#(<= create_data_~counter~0 6), 21065#(<= create_data_~counter~0 7), 21066#(<= create_data_~counter~0 8), 21067#(<= create_data_~counter~0 9), 21068#(<= create_data_~counter~0 10), 21069#(<= create_data_~counter~0 11), 21070#(<= create_data_~counter~0 12), 21071#(<= create_data_~counter~0 13), 21072#(<= create_data_~counter~0 14), 21073#(<= create_data_~counter~0 15), 21074#(<= create_data_~counter~0 16), 21075#(<= create_data_~counter~0 17), 21076#(<= create_data_~counter~0 18), 21077#(<= create_data_~counter~0 19)] [2018-02-02 10:04:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:40,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:04:40,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:04:40,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:04:40,916 INFO L87 Difference]: Start difference. First operand 478 states and 495 transitions. Second operand 22 states. [2018-02-02 10:04:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:40,987 INFO L93 Difference]: Finished difference Result 492 states and 509 transitions. [2018-02-02 10:04:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:04:40,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2018-02-02 10:04:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:40,989 INFO L225 Difference]: With dead ends: 492 [2018-02-02 10:04:40,989 INFO L226 Difference]: Without dead ends: 492 [2018-02-02 10:04:40,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:04:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-02-02 10:04:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2018-02-02 10:04:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-02-02 10:04:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 509 transitions. [2018-02-02 10:04:40,995 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 509 transitions. Word has length 178 [2018-02-02 10:04:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:40,995 INFO L432 AbstractCegarLoop]: Abstraction has 492 states and 509 transitions. [2018-02-02 10:04:40,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:04:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 509 transitions. [2018-02-02 10:04:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-02 10:04:40,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:40,997 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:40,997 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:04:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash 59798218, now seen corresponding path program 20 times [2018-02-02 10:04:40,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:41,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:41,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:41,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:04:41,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:41,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:04:41,812 INFO L182 omatonBuilderFactory]: Interpolants [22064#(= 1 (select |#valid| |append_#t~malloc34.base|)), 22065#(= 1 (select |#valid| append_~node~0.base)), 22066#(= |#valid| |old(#valid)|), 22067#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 22068#(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|))))), 22069#(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|))), 22070#(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)|))), 22062#true, 22063#false] [2018-02-02 10:04:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:41,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:04:41,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:04:41,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:04:41,813 INFO L87 Difference]: Start difference. First operand 492 states and 509 transitions. Second operand 9 states. [2018-02-02 10:04:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:42,523 INFO L93 Difference]: Finished difference Result 519 states and 537 transitions. [2018-02-02 10:04:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:04:42,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 185 [2018-02-02 10:04:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:42,525 INFO L225 Difference]: With dead ends: 519 [2018-02-02 10:04:42,525 INFO L226 Difference]: Without dead ends: 519 [2018-02-02 10:04:42,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 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:04:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-02-02 10:04:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 507. [2018-02-02 10:04:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-02-02 10:04:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 529 transitions. [2018-02-02 10:04:42,529 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 529 transitions. Word has length 185 [2018-02-02 10:04:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:42,529 INFO L432 AbstractCegarLoop]: Abstraction has 507 states and 529 transitions. [2018-02-02 10:04:42,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:04:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 529 transitions. [2018-02-02 10:04:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-02 10:04:42,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:42,530 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:42,530 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:04:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash 59798219, now seen corresponding path program 1 times [2018-02-02 10:04:42,531 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:42,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:43,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:43,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:04:43,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:43,205 INFO L134 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:04:43,205 INFO L182 omatonBuilderFactory]: Interpolants [23109#true, 23110#false, 23111#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 23112#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0)), 23113#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1)), 23114#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 23115#(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|)), 23116#(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|))))), 23117#(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|)), 23118#(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|))))), 23119#(and (<= 8 (select |#length| append_~node~0.base)) (= append_~node~0.offset 0))] [2018-02-02 10:04:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:43,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:04:43,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:04:43,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:04:43,206 INFO L87 Difference]: Start difference. First operand 507 states and 529 transitions. Second operand 11 states. [2018-02-02 10:04:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:43,627 INFO L93 Difference]: Finished difference Result 516 states and 534 transitions. [2018-02-02 10:04:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:04:43,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-02-02 10:04:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:43,629 INFO L225 Difference]: With dead ends: 516 [2018-02-02 10:04:43,629 INFO L226 Difference]: Without dead ends: 516 [2018-02-02 10:04:43,629 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:04:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-02 10:04:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 507. [2018-02-02 10:04:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-02-02 10:04:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 526 transitions. [2018-02-02 10:04:43,635 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 526 transitions. Word has length 185 [2018-02-02 10:04:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:43,636 INFO L432 AbstractCegarLoop]: Abstraction has 507 states and 526 transitions. [2018-02-02 10:04:43,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:04:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 526 transitions. [2018-02-02 10:04:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 10:04:43,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:43,637 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:43,637 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:04:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1631520313, now seen corresponding path program 1 times [2018-02-02 10:04:43,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:43,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:44,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:44,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:04:44,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:44,102 INFO L134 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:04:44,102 INFO L182 omatonBuilderFactory]: Interpolants [24149#true, 24150#false, 24151#(= 1 (select |#valid| append_~pointerToList.base)), 24152#(= |#valid| |old(#valid)|), 24153#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 24154#(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|))))), 24155#(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|))), 24156#(and (= 1 (select |#valid| create_data_~data~0.base)) (= |#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)|))), 24157#(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:04:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:44,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:04:44,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:04:44,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:04:44,103 INFO L87 Difference]: Start difference. First operand 507 states and 526 transitions. Second operand 9 states. [2018-02-02 10:04:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:44,560 INFO L93 Difference]: Finished difference Result 512 states and 529 transitions. [2018-02-02 10:04:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:04:44,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2018-02-02 10:04:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:44,562 INFO L225 Difference]: With dead ends: 512 [2018-02-02 10:04:44,562 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 10:04:44,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:04:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 10:04:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2018-02-02 10:04:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-02-02 10:04:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 529 transitions. [2018-02-02 10:04:44,566 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 529 transitions. Word has length 187 [2018-02-02 10:04:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:44,566 INFO L432 AbstractCegarLoop]: Abstraction has 510 states and 529 transitions. [2018-02-02 10:04:44,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:04:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 529 transitions. [2018-02-02 10:04:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 10:04:44,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:44,568 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:44,568 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:04:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1631520314, now seen corresponding path program 1 times [2018-02-02 10:04:44,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:44,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:45,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:45,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:04:45,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:45,395 INFO L134 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:04:45,396 INFO L182 omatonBuilderFactory]: Interpolants [25200#(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|))))), 25201#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 25190#true, 25191#false, 25192#(= 0 |main_~#list~0.offset|), 25193#(= 0 |append_#in~pointerToList.offset|), 25194#(= append_~pointerToList.offset 0), 25195#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 25196#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 25197#(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|)), 25198#(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|))))), 25199#(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|))] [2018-02-02 10:04:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:45,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:04:45,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:04:45,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:04:45,396 INFO L87 Difference]: Start difference. First operand 510 states and 529 transitions. Second operand 12 states. [2018-02-02 10:04:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:45,735 INFO L93 Difference]: Finished difference Result 509 states and 526 transitions. [2018-02-02 10:04:45,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:04:45,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2018-02-02 10:04:45,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:45,736 INFO L225 Difference]: With dead ends: 509 [2018-02-02 10:04:45,736 INFO L226 Difference]: Without dead ends: 509 [2018-02-02 10:04:45,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 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:04:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-02 10:04:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-02-02 10:04:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-02-02 10:04:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 526 transitions. [2018-02-02 10:04:45,740 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 526 transitions. Word has length 187 [2018-02-02 10:04:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:45,740 INFO L432 AbstractCegarLoop]: Abstraction has 509 states and 526 transitions. [2018-02-02 10:04:45,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:04:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 526 transitions. [2018-02-02 10:04:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-02 10:04:45,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:45,741 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:45,741 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:04:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1522989126, now seen corresponding path program 1 times [2018-02-02 10:04:45,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:45,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:45,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:45,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:04:45,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:45,793 INFO L134 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:04:45,793 INFO L182 omatonBuilderFactory]: Interpolants [26240#(= 1 (select |#valid| |main_~#list~0.base|)), 26236#true, 26237#false, 26238#(= append_~pointerToList.base |append_#in~pointerToList.base|), 26239#(= 1 (select |#valid| |append_#in~pointerToList.base|))] [2018-02-02 10:04:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:45,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:04:45,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:04:45,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:04:45,793 INFO L87 Difference]: Start difference. First operand 509 states and 526 transitions. Second operand 5 states. [2018-02-02 10:04:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:45,938 INFO L93 Difference]: Finished difference Result 508 states and 525 transitions. [2018-02-02 10:04:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:04:45,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-02-02 10:04:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:45,940 INFO L225 Difference]: With dead ends: 508 [2018-02-02 10:04:45,940 INFO L226 Difference]: Without dead ends: 508 [2018-02-02 10:04:45,940 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:04:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-02-02 10:04:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-02-02 10:04:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 10:04:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 525 transitions. [2018-02-02 10:04:45,944 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 525 transitions. Word has length 190 [2018-02-02 10:04:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:45,944 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 525 transitions. [2018-02-02 10:04:45,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:04:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 525 transitions. [2018-02-02 10:04:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-02 10:04:45,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:45,946 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:45,946 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:04:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1522989125, now seen corresponding path program 1 times [2018-02-02 10:04:45,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:45,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:46,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:46,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:04:46,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:46,064 INFO L134 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:04:46,064 INFO L182 omatonBuilderFactory]: Interpolants [27264#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|))), 27259#true, 27260#false, 27261#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 27262#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 27263#(or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0)))] [2018-02-02 10:04:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:46,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:04:46,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:04:46,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:04:46,064 INFO L87 Difference]: Start difference. First operand 508 states and 525 transitions. Second operand 6 states. [2018-02-02 10:04:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:46,244 INFO L93 Difference]: Finished difference Result 503 states and 520 transitions. [2018-02-02 10:04:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:04:46,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-02-02 10:04:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:46,245 INFO L225 Difference]: With dead ends: 503 [2018-02-02 10:04:46,245 INFO L226 Difference]: Without dead ends: 503 [2018-02-02 10:04:46,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:04:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-02 10:04:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-02-02 10:04:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-02 10:04:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 520 transitions. [2018-02-02 10:04:46,249 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 520 transitions. Word has length 190 [2018-02-02 10:04:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:46,249 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 520 transitions. [2018-02-02 10:04:46,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:04:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 520 transitions. [2018-02-02 10:04:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 10:04:46,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:46,250 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,250 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:04:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 31977470, now seen corresponding path program 1 times [2018-02-02 10:04:46,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:46,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:46,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:46,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:04:46,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:46,376 INFO L134 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:04:46,376 INFO L182 omatonBuilderFactory]: Interpolants [28273#true, 28274#false, 28275#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 28276#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 28277#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 28278#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 28279#(= 1 (select |#valid| |main_#t~mem47.base|))] [2018-02-02 10:04:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:46,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:04:46,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:04:46,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:04:46,377 INFO L87 Difference]: Start difference. First operand 503 states and 520 transitions. Second operand 7 states. [2018-02-02 10:04:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:46,568 INFO L93 Difference]: Finished difference Result 517 states and 536 transitions. [2018-02-02 10:04:46,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:04:46,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2018-02-02 10:04:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:46,569 INFO L225 Difference]: With dead ends: 517 [2018-02-02 10:04:46,569 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 10:04:46,569 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:04:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 10:04:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 502. [2018-02-02 10:04:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-02-02 10:04:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 519 transitions. [2018-02-02 10:04:46,572 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 519 transitions. Word has length 191 [2018-02-02 10:04:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:46,573 INFO L432 AbstractCegarLoop]: Abstraction has 502 states and 519 transitions. [2018-02-02 10:04:46,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:04:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 519 transitions. [2018-02-02 10:04:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 10:04:46,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:46,573 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,574 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:04:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash 31977471, now seen corresponding path program 1 times [2018-02-02 10:04:46,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:46,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:46,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:46,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:04:46,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:46,739 INFO L182 omatonBuilderFactory]: Interpolants [29312#(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|)))), 29313#(and (<= 4 (select |#length| |main_#t~mem47.base|)) (= |main_#t~mem47.offset| 0)), 29305#true, 29306#false, 29307#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 29308#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 29309#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0)), 29310#(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)), 29311#(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|)))] [2018-02-02 10:04:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:46,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:04:46,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:04:46,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:04:46,740 INFO L87 Difference]: Start difference. First operand 502 states and 519 transitions. Second operand 9 states. [2018-02-02 10:04:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:46,974 INFO L93 Difference]: Finished difference Result 526 states and 545 transitions. [2018-02-02 10:04:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:04:46,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2018-02-02 10:04:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:46,976 INFO L225 Difference]: With dead ends: 526 [2018-02-02 10:04:46,976 INFO L226 Difference]: Without dead ends: 526 [2018-02-02 10:04:46,976 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:04:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-02-02 10:04:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 501. [2018-02-02 10:04:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-02-02 10:04:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 518 transitions. [2018-02-02 10:04:46,980 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 518 transitions. Word has length 191 [2018-02-02 10:04:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:46,980 INFO L432 AbstractCegarLoop]: Abstraction has 501 states and 518 transitions. [2018-02-02 10:04:46,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:04:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 518 transitions. [2018-02-02 10:04:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 10:04:46,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:46,981 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,981 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:04:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash -166105366, now seen corresponding path program 1 times [2018-02-02 10:04:46,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:47,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:47,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:47,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:04:47,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:47,761 INFO L134 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:04:47,761 INFO L182 omatonBuilderFactory]: Interpolants [30355#true, 30356#false, 30357#(= 1 (select |#valid| |append_#t~malloc34.base|)), 30358#(= 1 (select |#valid| append_~node~0.base)), 30359#(= |#valid| |old(#valid)|), 30360#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 30361#(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|))))), 30362#(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|))), 30363#(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|)))), 30364#(and (or (= |#valid| (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|))) (= 1 (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) (or (= 1 (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|))) (= |#valid| (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|)))) (= create_data_~data~0.base (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|))) (= |#valid| (store (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|))))), 30365#(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|)))))), 30366#(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|)))), 30367#(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:04:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:47,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:04:47,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:04:47,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:04:47,762 INFO L87 Difference]: Start difference. First operand 501 states and 518 transitions. Second operand 13 states. [2018-02-02 10:04:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:48,694 INFO L93 Difference]: Finished difference Result 499 states and 516 transitions. [2018-02-02 10:04:48,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:04:48,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-02-02 10:04:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:48,695 INFO L225 Difference]: With dead ends: 499 [2018-02-02 10:04:48,695 INFO L226 Difference]: Without dead ends: 499 [2018-02-02 10:04:48,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:04:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-02 10:04:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-02-02 10:04:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-02 10:04:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 516 transitions. [2018-02-02 10:04:48,698 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 516 transitions. Word has length 194 [2018-02-02 10:04:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:48,698 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 516 transitions. [2018-02-02 10:04:48,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:04:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 516 transitions. [2018-02-02 10:04:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 10:04:48,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:48,699 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:48,699 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:04:48,699 INFO L82 PathProgramCache]: Analyzing trace with hash -166105365, now seen corresponding path program 1 times [2018-02-02 10:04:48,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:49,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 14 proven. 873 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-02 10:04:50,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:04:50,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:04:50,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:50,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:04:50,604 INFO L182 omatonBuilderFactory]: Interpolants [31392#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (or (and (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= 80 (select |#length| (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|)))) (= 0 (select |old(#valid)| (@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 (and (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@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|))))), 31393#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (or (and (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= 80 (select |#length| (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|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (and (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@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|))))), 31394#(and (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)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (and (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= (select |#length| |create_data_#t~mem7.base|) 80) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|))) (and (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= (select |#length| |create_data_#t~mem7.base|) 80) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|))))), 31395#(and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|))))), 31396#(and (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)))) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|))))), 31397#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|))))), 31398#(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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|))))), 31399#(and (or (= 0 (select |old(#valid)| (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|))) (<= 80 (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|))) (= (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|)) (= 16 (select |#length| |create_data_#t~malloc22.base|)) (or (= (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (<= 80 (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|)))) (= |#length| (store (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|))))), 31400#(and (or (<= 80 (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|))) (= 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|)))) (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|)))) (<= 80 (select |#length| (@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|)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (<= 80 (select |#length| (@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|))))), 31401#(and (<= 8 (select |#length| append_~node~0.base)) (= append_~node~0.offset 0)), 31382#true, 31383#false, 31384#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 31385#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0)), 31386#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1)), 31387#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 31388#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 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|)), 31389#(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|)))) (= (select |#valid| create_data_~data~0.base) 1)), 31390#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (not (= create_data_~data~0.base |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|)), 31391#(and (or (and (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= 80 (select |#length| (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|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (and (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@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|)))))] [2018-02-02 10:04:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 14 proven. 873 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-02 10:04:50,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:04:50,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:04:50,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:04:50,605 INFO L87 Difference]: Start difference. First operand 499 states and 516 transitions. Second operand 20 states. [2018-02-02 10:04:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:51,710 INFO L93 Difference]: Finished difference Result 497 states and 514 transitions. [2018-02-02 10:04:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:04:51,711 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 194 [2018-02-02 10:04:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:51,711 INFO L225 Difference]: With dead ends: 497 [2018-02-02 10:04:51,712 INFO L226 Difference]: Without dead ends: 497 [2018-02-02 10:04:51,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:04:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-02 10:04:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2018-02-02 10:04:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-02-02 10:04:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 514 transitions. [2018-02-02 10:04:51,714 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 514 transitions. Word has length 194 [2018-02-02 10:04:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:51,715 INFO L432 AbstractCegarLoop]: Abstraction has 497 states and 514 transitions. [2018-02-02 10:04:51,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:04:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 514 transitions. [2018-02-02 10:04:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 10:04:51,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:51,715 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:51,715 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:04:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash -326265980, now seen corresponding path program 1 times [2018-02-02 10:04:51,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:51,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:04:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:51,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:51,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:04:51,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:51,768 INFO L182 omatonBuilderFactory]: Interpolants [32408#true, 32409#false, 32410#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 32411#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 32412#(= 1 (select |#valid| |main_#t~mem49.base|))] [2018-02-02 10:04:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:51,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:04:51,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:04:51,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:04:51,768 INFO L87 Difference]: Start difference. First operand 497 states and 514 transitions. Second operand 5 states. [2018-02-02 10:04:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:51,894 INFO L93 Difference]: Finished difference Result 512 states and 531 transitions. [2018-02-02 10:04:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:04:51,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-02-02 10:04:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:51,895 INFO L225 Difference]: With dead ends: 512 [2018-02-02 10:04:51,895 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 10:04:51,895 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:04:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 10:04:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 496. [2018-02-02 10:04:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-02-02 10:04:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 513 transitions. [2018-02-02 10:04:51,899 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 513 transitions. Word has length 195 [2018-02-02 10:04:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:51,900 INFO L432 AbstractCegarLoop]: Abstraction has 496 states and 513 transitions. [2018-02-02 10:04:51,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:04:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 513 transitions. [2018-02-02 10:04:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 10:04:51,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:51,901 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:51,901 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:04:51,901 INFO L82 PathProgramCache]: Analyzing trace with hash -326265979, now seen corresponding path program 1 times [2018-02-02 10:04:51,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:52,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:04:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:52,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:52,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:04:52,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:04:52,393 INFO L182 omatonBuilderFactory]: Interpolants [33425#true, 33426#false, 33427#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 33428#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 33429#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 33430#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 33431#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 33432#(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|))), 33433#(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|)))), 33434#(and (<= (+ |main_#t~mem49.offset| 4) (select |#length| |main_#t~mem49.base|)) (<= 0 |main_#t~mem49.offset|))] [2018-02-02 10:04:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:52,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:04:52,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:04:52,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:04:52,393 INFO L87 Difference]: Start difference. First operand 496 states and 513 transitions. Second operand 10 states. [2018-02-02 10:04:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:52,633 INFO L93 Difference]: Finished difference Result 521 states and 540 transitions. [2018-02-02 10:04:52,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:04:52,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-02-02 10:04:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:52,635 INFO L225 Difference]: With dead ends: 521 [2018-02-02 10:04:52,635 INFO L226 Difference]: Without dead ends: 521 [2018-02-02 10:04:52,635 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:04:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-02 10:04:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 495. [2018-02-02 10:04:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-02 10:04:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 512 transitions. [2018-02-02 10:04:52,638 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 512 transitions. Word has length 195 [2018-02-02 10:04:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:52,639 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 512 transitions. [2018-02-02 10:04:52,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:04:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 512 transitions. [2018-02-02 10:04:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 10:04:52,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:52,639 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:52,640 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:04:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash -713459111, now seen corresponding path program 1 times [2018-02-02 10:04:52,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:52,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:04:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:53,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:04:53,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:04:53,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:04:53,549 INFO L134 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:04:53,549 INFO L182 omatonBuilderFactory]: Interpolants [34466#true, 34467#false, 34468#(= 1 (select |#valid| append_~pointerToList.base)), 34469#(= |#valid| |old(#valid)|), 34470#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 34471#(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|))))), 34472#(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|))), 34473#(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|)))), 34474#(and (or (= |#valid| (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|))) (= 1 (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) (= create_data_~data~0.base (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) (or (= 1 (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|))) (= |#valid| (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|)))) (= create_data_~data~0.base (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|))) (= |#valid| (store (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|) (select |#valid| (@diff (store (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |create_data_#t~malloc22.base| (select |#valid| |create_data_#t~malloc22.base|)) |#valid|))) |#valid|))))), 34475#(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|)))))), 34476#(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|)))), 34477#(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))), 34478#(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:04:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:04:53,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:04:53,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:04:53,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:04:53,550 INFO L87 Difference]: Start difference. First operand 495 states and 512 transitions. Second operand 13 states. [2018-02-02 10:04:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:04:54,521 INFO L93 Difference]: Finished difference Result 494 states and 511 transitions. [2018-02-02 10:04:54,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:04:54,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2018-02-02 10:04:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:04:54,523 INFO L225 Difference]: With dead ends: 494 [2018-02-02 10:04:54,523 INFO L226 Difference]: Without dead ends: 494 [2018-02-02 10:04:54,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:04:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-02 10:04:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2018-02-02 10:04:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 10:04:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 511 transitions. [2018-02-02 10:04:54,527 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 511 transitions. Word has length 196 [2018-02-02 10:04:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:04:54,527 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 511 transitions. [2018-02-02 10:04:54,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:04:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 511 transitions. [2018-02-02 10:04:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 10:04:54,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:04:54,528 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:54,528 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:04:54,528 INFO L82 PathProgramCache]: Analyzing trace with hash -713459110, now seen corresponding path program 1 times [2018-02-02 10:04:54,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:04:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:04:54,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:04:56,856 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 86 DAG size of output 58 [2018-02-02 10:05:02,193 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 46 DAG size of output 39 [2018-02-02 10:05:02,847 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-02-02 10:05:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:06,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:06,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 10:05:06,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:06,230 INFO L134 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,231 INFO L182 omatonBuilderFactory]: Interpolants [35482#true, 35483#false, 35484#(= 0 |main_~#list~0.offset|), 35485#(= 0 |append_#in~pointerToList.offset|), 35486#(= append_~pointerToList.offset 0), 35487#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 35488#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 35489#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= 0 |create_data_#t~malloc3.offset|) (= 16 (select |#length| |create_data_#t~malloc3.base|)) (= (store |old(#length)| |create_data_#t~malloc3.base| (select |#length| |create_data_#t~malloc3.base|)) |#length|)), 35490#(and (= create_data_~data~0.offset 0) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |#valid| create_data_~data~0.base) 1) (= 16 (select |#length| create_data_~data~0.base))), 35491#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (= create_data_~data~0.offset 0) (= 0 |create_data_#t~malloc4.offset|) (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|) (= 16 (select |#length| create_data_~data~0.base))), 35492#(and (= create_data_~data~0.offset 0) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 16 (select |#length| create_data_~data~0.base))), 35493#(and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 16 (select |#length| create_data_~data~0.base))), 35494#(and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (<= create_data_~counter~0 0) (and (= create_data_~data~0.offset 0) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 16 (select |#length| create_data_~data~0.base))))), 35495#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (or (<= create_data_~counter~0 0) (and (= create_data_~data~0.offset 0) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (= |create_data_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= |#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|)))) (= 80 (select |#length| |create_data_#t~mem7.base|)) (= |create_data_#t~mem7.offset| 0) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 16 (select |#length| create_data_~data~0.base))))), 35496#(or (and (= create_data_~data~0.offset 0) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (= 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)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 0)), 35497#(or (<= create_data_~counter~0 1) (and (= create_data_~data~0.offset 0) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (= 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)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))) (= 16 (select |#length| create_data_~data~0.base)))), 35498#(or (<= create_data_~counter~0 1) (and (= create_data_~data~0.offset 0) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (= create_data_~data~0.base |create_data_#t~mem7.base|) (and (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))))) (or (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 16 (select |#length| create_data_~data~0.base))) (or (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (and (not (= (+ create_data_~data~0.offset 4) (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0)))) (= 0 (select (select |#memory_$Pointer$.offset| |create_data_#t~mem7.base|) (+ create_data_~data~0.offset 4))))))), 35499#(or (<= create_data_~counter~0 1) (and (= create_data_~data~0.offset 0) (or (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 16 (select |#length| create_data_~data~0.base))) (or (and (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (and (= 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))))))), 35500#(or (and (= create_data_~data~0.offset 0) (or (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 16 (select |#length| create_data_~data~0.base))) (or (and (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (and (= 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)))))) (<= create_data_~counter~0 2)), 35501#(or (and (= create_data_~data~0.offset 0) (or (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (and (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (not (= (+ create_data_~data~0.offset 4) (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0)))) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base)))) (or (and (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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))) (= |#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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (= create_data_~data~0.base |create_data_#t~mem7.base|))) (<= create_data_~counter~0 2)), 35502#(or (and (= create_data_~data~0.offset 0) (or (and (= 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))) (= 16 (select |#length| create_data_~data~0.base))) (and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))))) (<= create_data_~counter~0 3)), 35503#(or (and (= create_data_~data~0.offset 0) (or (and (= (select |#length| |create_data_#t~mem7.base|) 16) (= |create_data_#t~mem7.offset| 0)) (and (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)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))))) (<= create_data_~counter~0 3)), 35504#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 3)), 35505#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 4)), 35506#(or (and (= create_data_~data~0.offset 0) (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)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 4)), 35507#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 5)), 35508#(or (<= create_data_~counter~0 5) (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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))) (= |#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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|)))))), 35509#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 6)), 35510#(or (and (= create_data_~data~0.offset 0) (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)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 6)), 35511#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 7)), 35512#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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))) (= |#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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 7)), 35513#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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|))) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@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|)))) (<= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (= (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (select |#length| (@diff |old(#length)| |#length|))))) (<= create_data_~counter~0 8)), 35514#(or (<= create_data_~counter~0 8) (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (<= 80 (select |#length| |create_data_#t~mem7.base|)) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= (select |#length| |create_data_#t~mem7.base|) (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |#length| |create_data_#t~mem7.base|) (select |#length| (@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 |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|)))))), 35515#(or (<= create_data_~counter~0 8) (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35516#(or (<= create_data_~counter~0 9) (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35517#(or (and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|))))) (<= create_data_~counter~0 9)), 35518#(or (<= create_data_~counter~0 9) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35519#(or (<= create_data_~counter~0 10) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35520#(or (<= create_data_~counter~0 11) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35521#(or (<= create_data_~counter~0 12) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35522#(or (<= create_data_~counter~0 13) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35523#(or (<= create_data_~counter~0 14) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35524#(or (<= create_data_~counter~0 15) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35525#(or (<= create_data_~counter~0 16) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35526#(or (<= create_data_~counter~0 17) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35527#(or (<= create_data_~counter~0 18) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35528#(or (<= create_data_~counter~0 19) (and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|)))))), 35529#(and (= create_data_~data~0.offset 0) (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 (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= 80 (select |#length| (@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|))))), 35530#(and (= create_data_~data~0.offset 0) (or (= 0 (select |old(#valid)| (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|))) (<= 80 (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|))) (= (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|)) (= 16 (select |#length| |create_data_#t~malloc22.base|)) (or (= (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (<= 80 (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|)))) (= |#length| (store (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |create_data_#t~malloc22.base| (select |#length| |create_data_#t~malloc22.base|)) |#length|))) |#length|))))), 35531#(and (= create_data_~data~0.offset 0) (or (<= 80 (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|))) (= 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|)))) (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|)))) (<= 80 (select |#length| (@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|)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (<= 80 (select |#length| (@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|))))), 35532#(and (or (<= 80 (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|))) (= 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|)))) (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|)))) (<= 80 (select |#length| (@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|)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (<= 80 (select |#length| (@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|))))), 35533#(and (= append_~pointerToList.offset 0) (< 3 (select |#length| append_~pointerToList.base)))] [2018-02-02 10:05:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:06,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 10:05:06,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 10:05:06,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=2058, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:05:06,232 INFO L87 Difference]: Start difference. First operand 494 states and 511 transitions. Second operand 52 states. [2018-02-02 10:05:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:12,659 INFO L93 Difference]: Finished difference Result 493 states and 510 transitions. [2018-02-02 10:05:12,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:05:12,738 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 196 [2018-02-02 10:05:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:12,739 INFO L225 Difference]: With dead ends: 493 [2018-02-02 10:05:12,739 INFO L226 Difference]: Without dead ends: 493 [2018-02-02 10:05:12,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 24 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=775, Invalid=3131, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:05:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-02-02 10:05:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 482. [2018-02-02 10:05:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-02 10:05:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 499 transitions. [2018-02-02 10:05:12,743 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 499 transitions. Word has length 196 [2018-02-02 10:05:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:12,743 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 499 transitions. [2018-02-02 10:05:12,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 10:05:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 499 transitions. [2018-02-02 10:05:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 10:05:12,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:12,744 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,744 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:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1524310655, now seen corresponding path program 1 times [2018-02-02 10:05:12,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:12,761 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,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:13,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:13,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 10:05:13,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:13,016 INFO L134 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,016 INFO L182 omatonBuilderFactory]: Interpolants [36544#(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|))), 36545#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem49.base|) |main_#t~mem49.offset|))), 36546#(= 1 (select |#valid| |main_#t~mem50.base|)), 36531#true, 36532#false, 36533#(= (select |#valid| |main_~#list~0.base|) 1), 36534#(= |#valid| |old(#valid)|), 36535#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 36536#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 36537#(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|)))), 36538#(= 1 (select |#valid| create_data_~data~0.base)), 36539#(= 1 (select |#valid| |create_data_#res.base|)), 36540#(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_#t~ret38.base|))))), 36541#(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)))))), 36542#(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|))))), 36543#(= 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|))))] [2018-02-02 10:05:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:13,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:05:13,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:05:13,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:05:13,016 INFO L87 Difference]: Start difference. First operand 482 states and 499 transitions. Second operand 16 states. [2018-02-02 10:05:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:13,628 INFO L93 Difference]: Finished difference Result 524 states and 549 transitions. [2018-02-02 10:05:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:05:13,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 196 [2018-02-02 10:05:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:13,629 INFO L225 Difference]: With dead ends: 524 [2018-02-02 10:05:13,629 INFO L226 Difference]: Without dead ends: 524 [2018-02-02 10:05:13,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:05:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-02-02 10:05:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 485. [2018-02-02 10:05:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-02-02 10:05:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 505 transitions. [2018-02-02 10:05:13,632 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 505 transitions. Word has length 196 [2018-02-02 10:05:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:13,633 INFO L432 AbstractCegarLoop]: Abstraction has 485 states and 505 transitions. [2018-02-02 10:05:13,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:05:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 505 transitions. [2018-02-02 10:05:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 10:05:13,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:13,633 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,633 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:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1524310654, now seen corresponding path program 1 times [2018-02-02 10:05:13,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:13,653 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,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:14,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:14,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:05:14,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:14,102 INFO L134 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,102 INFO L182 omatonBuilderFactory]: Interpolants [37600#(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|))))), 37601#(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|))), 37602#(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|)))), 37603#(and (<= 16 (select |#length| |main_#t~mem50.base|)) (= |main_#t~mem50.offset| 0)), 37586#true, 37587#false, 37588#(= (select |#valid| |main_~#list~0.base|) 1), 37589#(= |#valid| |old(#valid)|), 37590#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 37591#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 37592#(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|)))), 37593#(= 0 |create_data_#t~malloc3.offset|), 37594#(= 0 create_data_~data~0.offset), 37595#(and (= 0 create_data_~data~0.offset) (<= (+ create_data_~data~0.offset 16) (select |#length| create_data_~data~0.base))), 37596#(and (<= 16 (select |#length| |create_data_#res.base|)) (= 0 |create_data_#res.offset|)), 37597#(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))), 37598#(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)))))), 37599#(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|)))))] [2018-02-02 10:05:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:14,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:05:14,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:05:14,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:05:14,102 INFO L87 Difference]: Start difference. First operand 485 states and 505 transitions. Second operand 18 states. [2018-02-02 10:05:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:14,751 INFO L93 Difference]: Finished difference Result 523 states and 547 transitions. [2018-02-02 10:05:14,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:05:14,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2018-02-02 10:05:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:14,753 INFO L225 Difference]: With dead ends: 523 [2018-02-02 10:05:14,753 INFO L226 Difference]: Without dead ends: 523 [2018-02-02 10:05:14,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:05:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-02 10:05:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 485. [2018-02-02 10:05:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-02-02 10:05:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 504 transitions. [2018-02-02 10:05:14,757 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 504 transitions. Word has length 196 [2018-02-02 10:05:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:14,757 INFO L432 AbstractCegarLoop]: Abstraction has 485 states and 504 transitions. [2018-02-02 10:05:14,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:05:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 504 transitions. [2018-02-02 10:05:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 10:05:14,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:14,758 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,758 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:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1813470134, now seen corresponding path program 1 times [2018-02-02 10:05:14,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:14,772 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,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:14,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:14,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:05:14,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:14,820 INFO L182 omatonBuilderFactory]: Interpolants [38640#true, 38641#false, 38642#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 38643#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 38644#(= 1 (select |#valid| |main_#t~mem53.base|))] [2018-02-02 10:05:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:14,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:14,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:14,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:14,821 INFO L87 Difference]: Start difference. First operand 485 states and 504 transitions. Second operand 5 states. [2018-02-02 10:05:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:14,932 INFO L93 Difference]: Finished difference Result 499 states and 520 transitions. [2018-02-02 10:05:14,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:05:14,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2018-02-02 10:05:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:14,934 INFO L225 Difference]: With dead ends: 499 [2018-02-02 10:05:14,934 INFO L226 Difference]: Without dead ends: 499 [2018-02-02 10:05:14,934 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:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-02 10:05:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 490. [2018-02-02 10:05:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-02-02 10:05:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 511 transitions. [2018-02-02 10:05:14,939 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 511 transitions. Word has length 202 [2018-02-02 10:05:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:14,939 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 511 transitions. [2018-02-02 10:05:14,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 511 transitions. [2018-02-02 10:05:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 10:05:14,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:14,940 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,940 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:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1813470135, now seen corresponding path program 1 times [2018-02-02 10:05:14,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:14,957 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,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:15,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:15,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:05:15,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:15,261 INFO L134 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,261 INFO L182 omatonBuilderFactory]: Interpolants [39648#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= |append_#t~ret38.base| 0)))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 39649#(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))))), 39650#(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))), 39651#(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)), 39652#(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|))), 39653#(not (= |main_#t~mem48.base| 0)), 39654#|main_#t~short52|, 39638#true, 39639#false, 39640#(= (select |#valid| |main_~#list~0.base|) 1), 39641#(= |#valid| |old(#valid)|), 39642#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 39643#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 39644#(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|)))), 39645#(not (= |create_data_#t~malloc3.base| 0)), 39646#(not (= create_data_~data~0.base 0)), 39647#(not (= |create_data_#res.base| 0))] [2018-02-02 10:05:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:15,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:05:15,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:05:15,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:05:15,262 INFO L87 Difference]: Start difference. First operand 490 states and 511 transitions. Second operand 17 states. [2018-02-02 10:05:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:15,969 INFO L93 Difference]: Finished difference Result 530 states and 555 transitions. [2018-02-02 10:05:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:05:15,969 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 202 [2018-02-02 10:05:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:15,970 INFO L225 Difference]: With dead ends: 530 [2018-02-02 10:05:15,970 INFO L226 Difference]: Without dead ends: 530 [2018-02-02 10:05:15,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:05:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-02 10:05:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 490. [2018-02-02 10:05:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-02-02 10:05:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 510 transitions. [2018-02-02 10:05:15,974 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 510 transitions. Word has length 202 [2018-02-02 10:05:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:15,974 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 510 transitions. [2018-02-02 10:05:15,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:05:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 510 transitions. [2018-02-02 10:05:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-02 10:05:15,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:15,975 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,975 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:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash -470384195, now seen corresponding path program 1 times [2018-02-02 10:05:15,975 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:16,104 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,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:16,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:16,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:05:16,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:16,739 INFO L182 omatonBuilderFactory]: Interpolants [40707#true, 40708#false, 40709#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 40710#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 40711#(and (= (select |#length| append_~node~0.base) 8) (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 40712#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#length| append_~node~0.base) 8) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1)), 40713#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 40714#(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|)), 40715#(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|)) (= 0 (select |old(#valid)| create_data_~data~0.base))) (= |old(#length)| |#length|))), 40716#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (or (and (= create_data_~data~0.base (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) (= 0 (select |old(#valid)| create_data_~data~0.base))) (= (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|)), 40717#(and (or (and (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= 0 (select |old(#valid)| create_data_~data~0.base))) (= 80 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#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|)))) (and (= 0 (select |old(#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|)))) (= |#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|))))), 40718#(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|))))), 40719#(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))), 40720#(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|)))), 40721#(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|))), 40722#(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|))), 40723#(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|)))), 40724#(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| |main_#t~mem49.base|)) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 40725#(and (<= (+ |main_#t~mem53.offset| 8) (select |#length| |main_#t~mem53.base|)) (<= 0 |main_#t~mem53.offset|))] [2018-02-02 10:05:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:16,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:05:16,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:05:16,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:05:16,740 INFO L87 Difference]: Start difference. First operand 490 states and 510 transitions. Second operand 19 states. [2018-02-02 10:05:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:17,659 INFO L93 Difference]: Finished difference Result 568 states and 600 transitions. [2018-02-02 10:05:17,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:05:17,696 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-02-02 10:05:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:17,697 INFO L225 Difference]: With dead ends: 568 [2018-02-02 10:05:17,697 INFO L226 Difference]: Without dead ends: 568 [2018-02-02 10:05:17,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:05:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-02-02 10:05:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 531. [2018-02-02 10:05:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-02-02 10:05:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 560 transitions. [2018-02-02 10:05:17,700 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 560 transitions. Word has length 206 [2018-02-02 10:05:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:17,701 INFO L432 AbstractCegarLoop]: Abstraction has 531 states and 560 transitions. [2018-02-02 10:05:17,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:05:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 560 transitions. [2018-02-02 10:05:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 10:05:17,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:17,701 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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:17,701 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:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1090531839, now seen corresponding path program 1 times [2018-02-02 10:05:17,702 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:17,935 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,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:18,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:18,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:05:18,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:18,120 INFO L134 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,120 INFO L182 omatonBuilderFactory]: Interpolants [41856#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|)), 41857#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= 1 (select |#valid| |main_~#list~0.base|))), 41858#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (not (= (select |#valid| |main_~#list~0.base|) 0))), 41859#(and (<= 4 (select |#length| |append_#in~pointerToList.base|)) (= 0 |append_#in~pointerToList.offset|) (not (= (select |#valid| |append_#in~pointerToList.base|) 0))), 41860#(and (<= 4 (select |#length| append_~pointerToList.base)) (not (= (select |#valid| append_~pointerToList.base) 0)) (= append_~pointerToList.offset 0)), 41861#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 41851#true, 41852#false, 41853#(= 0 |main_~#list~0.offset|), 41854#(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))), 41855#(or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0)))] [2018-02-02 10:05:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 10:05:18,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:05:18,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:05:18,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:18,120 INFO L87 Difference]: Start difference. First operand 531 states and 560 transitions. Second operand 11 states. Received shutdown request... [2018-02-02 10:05:18,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:18,135 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:05:18,139 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:05:18,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:05:18 BoogieIcfgContainer [2018-02-02 10:05:18,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:05:18,140 INFO L168 Benchmark]: Toolchain (without parser) took 46852.93 ms. Allocated memory was 404.8 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 361.5 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 353.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:18,141 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 404.8 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:05:18,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.00 ms. Allocated memory is still 404.8 MB. Free memory was 361.5 MB in the beginning and 348.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:18,141 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 ms. Allocated memory is still 404.8 MB. Free memory is still 348.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:05:18,141 INFO L168 Benchmark]: RCFGBuilder took 490.46 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 294.0 MB in the end (delta: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:18,142 INFO L168 Benchmark]: TraceAbstraction took 46150.60 ms. Allocated memory was 404.8 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 294.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 285.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:05:18,142 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.10 ms. Allocated memory is still 404.8 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.00 ms. Allocated memory is still 404.8 MB. Free memory was 361.5 MB in the beginning and 348.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.55 ms. Allocated memory is still 404.8 MB. Free memory is still 348.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 490.46 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 294.0 MB in the end (delta: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46150.60 ms. Allocated memory was 404.8 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 294.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 285.6 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 (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (531states) and interpolant automaton (currently 4 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 213 locations, 91 error locations. TIMEOUT Result, 46.1s OverallTime, 55 OverallIterations, 21 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8401 SDtfs, 5510 SDslu, 47542 SDs, 0 SdLazy, 18855 SolverSat, 629 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 860 GetRequests, 153 SyntacticMatches, 42 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=531occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 25164/35780 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, 54 MinimizatonAttempts, 616 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 6476 NumberOfCodeBlocks, 6476 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6421 ConstructedInterpolants, 0 QuantifiedInterpolants, 33425858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 31 PerfectInterpolantSequences, 25164/35780 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_test01_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-05-18-150.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-05-18-150.csv Completed graceful shutdown