java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:12:06,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:12:06,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:12:06,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:12:06,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:12:06,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:12:06,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:12:06,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:12:06,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:12:06,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:12:06,935 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:12:06,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:12:06,936 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:12:06,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:12:06,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:12:06,940 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:12:06,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:12:06,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:12:06,944 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:12:06,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:12:06,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:12:06,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:12:06,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:12:06,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:12:06,950 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:12:06,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:12:06,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:12:06,952 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:12:06,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:12:06,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:12:06,952 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:12:06,953 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:12:06,963 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:12:06,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:12:06,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:12:06,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:12:06,964 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:12:06,964 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:12:06,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:12:06,965 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:12:06,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:12:06,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:12:06,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:12:06,965 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:12:06,965 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:12:06,966 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:12:06,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:12:06,966 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:12:06,966 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:12:06,966 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:12:06,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:12:06,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:12:06,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:12:06,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:12:06,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:12:06,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:12:07,001 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:12:07,004 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:12:07,005 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:12:07,005 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:12:07,006 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_false-valid-memtrack.i [2018-02-02 20:12:07,132 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:12:07,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:12:07,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:12:07,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:12:07,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:12:07,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6525d2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07, skipping insertion in model container [2018-02-02 20:12:07,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,154 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:12:07,185 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:12:07,282 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:12:07,305 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:12:07,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07 WrapperNode [2018-02-02 20:12:07,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:12:07,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:12:07,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:12:07,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:12:07,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... [2018-02-02 20:12:07,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:12:07,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:12:07,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:12:07,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:12:07,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:12:07,406 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:12:07,407 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:12:07,407 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 20:12:07,407 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 20:12:07,407 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 20:12:07,407 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:12:07,407 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:12:07,407 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:12:07,407 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:12:07,407 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:12:07,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:12:07,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:12:07,407 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:12:07,408 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:12:07,864 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:12:07,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:12:07 BoogieIcfgContainer [2018-02-02 20:12:07,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:12:07,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:12:07,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:12:07,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:12:07,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:12:07" (1/3) ... [2018-02-02 20:12:07,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ddb8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:12:07, skipping insertion in model container [2018-02-02 20:12:07,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:12:07" (2/3) ... [2018-02-02 20:12:07,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ddb8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:12:07, skipping insertion in model container [2018-02-02 20:12:07,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:12:07" (3/3) ... [2018-02-02 20:12:07,871 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_false-valid-memtrack.i [2018-02-02 20:12:07,877 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:12:07,884 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-02 20:12:07,919 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:12:07,919 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:12:07,919 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:12:07,920 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:12:07,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:12:07,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:12:07,920 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:12:07,920 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:12:07,921 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:12:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states. [2018-02-02 20:12:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 20:12:07,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:07,946 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:07,946 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 20:12:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704007, now seen corresponding path program 1 times [2018-02-02 20:12:07,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:08,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:08,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:12:08,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,079 INFO L182 omatonBuilderFactory]: Interpolants [216#true, 217#false, 218#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 20:12:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:12:08,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:12:08,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:12:08,094 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 3 states. [2018-02-02 20:12:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:08,339 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-02-02 20:12:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:12:08,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 20:12:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:08,349 INFO L225 Difference]: With dead ends: 208 [2018-02-02 20:12:08,350 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 20:12:08,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:12:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 20:12:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-02 20:12:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 20:12:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions. [2018-02-02 20:12:08,400 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 7 [2018-02-02 20:12:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:08,401 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 217 transitions. [2018-02-02 20:12:08,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:12:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 217 transitions. [2018-02-02 20:12:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 20:12:08,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:08,401 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:08,402 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 20:12:08,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704008, now seen corresponding path program 1 times [2018-02-02 20:12:08,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:08,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:08,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:12:08,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,448 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 20:12:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:12:08,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:12:08,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:12:08,450 INFO L87 Difference]: Start difference. First operand 205 states and 217 transitions. Second operand 3 states. [2018-02-02 20:12:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:08,615 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-02-02 20:12:08,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:12:08,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 20:12:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:08,617 INFO L225 Difference]: With dead ends: 206 [2018-02-02 20:12:08,618 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 20:12:08,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:12:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 20:12:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-02-02 20:12:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:12:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2018-02-02 20:12:08,630 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 7 [2018-02-02 20:12:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:08,630 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2018-02-02 20:12:08,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:12:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2018-02-02 20:12:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:12:08,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:08,631 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:08,631 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 20:12:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash 627159801, now seen corresponding path program 1 times [2018-02-02 20:12:08,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:08,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:08,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:08,695 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,695 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 20:12:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:08,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:08,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:08,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:08,696 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 5 states. [2018-02-02 20:12:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:08,882 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2018-02-02 20:12:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:12:08,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:12:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:08,883 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:12:08,883 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:12:08,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:12:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:12:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-02 20:12:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 20:12:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2018-02-02 20:12:08,892 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 14 [2018-02-02 20:12:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:08,892 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2018-02-02 20:12:08,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2018-02-02 20:12:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:12:08,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:08,892 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:08,893 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 20:12:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash 627159802, now seen corresponding path program 1 times [2018-02-02 20:12:08,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:08,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:09,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:12:09,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,005 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 20:12:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:12:09,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:12:09,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:09,006 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand 7 states. [2018-02-02 20:12:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:09,305 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2018-02-02 20:12:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:12:09,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 20:12:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:09,306 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:12:09,306 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 20:12:09,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:12:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 20:12:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 211. [2018-02-02 20:12:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 20:12:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-02-02 20:12:09,315 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 14 [2018-02-02 20:12:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:09,315 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-02-02 20:12:09,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:12:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-02-02 20:12:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:12:09,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:09,316 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:09,316 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 20:12:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882424, now seen corresponding path program 1 times [2018-02-02 20:12:09,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:09,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:09,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:12:09,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,368 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 20:12:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:12:09,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:12:09,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:09,368 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 4 states. [2018-02-02 20:12:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:09,498 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-02 20:12:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:12:09,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:12:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:09,499 INFO L225 Difference]: With dead ends: 209 [2018-02-02 20:12:09,499 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 20:12:09,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 20:12:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-02-02 20:12:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:12:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2018-02-02 20:12:09,505 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 15 [2018-02-02 20:12:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:09,506 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2018-02-02 20:12:09,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:12:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2018-02-02 20:12:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:12:09,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:09,506 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:09,506 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 20:12:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882423, now seen corresponding path program 1 times [2018-02-02 20:12:09,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:09,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:09,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:12:09,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,547 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 20:12:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:12:09,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:12:09,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:09,547 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 4 states. [2018-02-02 20:12:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:09,660 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-02-02 20:12:09,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:12:09,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:12:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:09,661 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:12:09,661 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:12:09,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:12:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-02-02 20:12:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 20:12:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 220 transitions. [2018-02-02 20:12:09,665 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 220 transitions. Word has length 15 [2018-02-02 20:12:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:09,665 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 220 transitions. [2018-02-02 20:12:09,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:12:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 220 transitions. [2018-02-02 20:12:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:12:09,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:09,666 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:09,666 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 20:12:09,666 INFO L82 PathProgramCache]: Analyzing trace with hash -290527541, now seen corresponding path program 1 times [2018-02-02 20:12:09,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:09,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:09,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:12:09,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,926 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 20:12:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:09,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:12:09,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:12:09,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:09,927 INFO L87 Difference]: Start difference. First operand 207 states and 220 transitions. Second operand 13 states. [2018-02-02 20:12:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:10,721 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-02 20:12:10,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:10,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-02 20:12:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:10,722 INFO L225 Difference]: With dead ends: 209 [2018-02-02 20:12:10,723 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 20:12:10,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:12:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 20:12:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-02-02 20:12:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 20:12:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-02 20:12:10,728 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 20 [2018-02-02 20:12:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:10,728 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-02 20:12:10,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:12:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-02 20:12:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:12:10,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:10,729 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:10,729 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 20:12:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash -30107462, now seen corresponding path program 1 times [2018-02-02 20:12:10,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:10,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:10,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:10,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:10,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:10,764 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 20:12:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:10,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:12:10,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:12:10,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:10,765 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 4 states. [2018-02-02 20:12:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:10,785 INFO L93 Difference]: Finished difference Result 294 states and 311 transitions. [2018-02-02 20:12:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:12:10,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 20:12:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:10,786 INFO L225 Difference]: With dead ends: 294 [2018-02-02 20:12:10,786 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 20:12:10,787 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 20:12:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 20:12:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 258. [2018-02-02 20:12:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 20:12:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions. [2018-02-02 20:12:10,793 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 22 [2018-02-02 20:12:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:10,793 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions. [2018-02-02 20:12:10,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:12:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions. [2018-02-02 20:12:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:12:10,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:10,794 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 20:12:10,794 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 20:12:10,794 INFO L82 PathProgramCache]: Analyzing trace with hash 929227204, now seen corresponding path program 1 times [2018-02-02 20:12:10,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:10,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:10,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:10,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:12:10,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:10,829 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 20:12:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:10,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:12:10,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:12:10,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:10,830 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand 4 states. [2018-02-02 20:12:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:10,958 INFO L93 Difference]: Finished difference Result 245 states and 283 transitions. [2018-02-02 20:12:10,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:12:10,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 20:12:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:10,960 INFO L225 Difference]: With dead ends: 245 [2018-02-02 20:12:10,960 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 20:12:10,960 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 20:12:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 20:12:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-02-02 20:12:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:12:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 281 transitions. [2018-02-02 20:12:10,965 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 281 transitions. Word has length 26 [2018-02-02 20:12:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:10,965 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 281 transitions. [2018-02-02 20:12:10,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:12:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 281 transitions. [2018-02-02 20:12:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:12:10,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:10,966 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 20:12:10,966 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 20:12:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash 929227205, now seen corresponding path program 1 times [2018-02-02 20:12:10,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:10,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:11,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:11,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:11,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 20:12:11,017 INFO L182 omatonBuilderFactory]: Interpolants [4240#(and (= create_data_~data~0.offset 0) (= (select |#length| create_data_~data~0.base) 16)), 4236#true, 4237#false, 4238#(and (= (select |#valid| |create_data_#t~malloc3.base|) 1) (= 0 |create_data_#t~malloc3.offset|) (= 16 (select |#length| |create_data_#t~malloc3.base|))), 4239#(and (= create_data_~data~0.offset 0) (= (select |#valid| create_data_~data~0.base) 1) (= 16 (select |#length| create_data_~data~0.base)))] [2018-02-02 20:12:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:11,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:11,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:11,017 INFO L87 Difference]: Start difference. First operand 243 states and 281 transitions. Second operand 5 states. [2018-02-02 20:12:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:11,177 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2018-02-02 20:12:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:12:11,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 20:12:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:11,178 INFO L225 Difference]: With dead ends: 230 [2018-02-02 20:12:11,178 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 20:12:11,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:12:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 20:12:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-02-02 20:12:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 20:12:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 251 transitions. [2018-02-02 20:12:11,181 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 251 transitions. Word has length 26 [2018-02-02 20:12:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:11,181 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 251 transitions. [2018-02-02 20:12:11,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 251 transitions. [2018-02-02 20:12:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:12:11,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:11,182 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 20:12:11,182 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 20:12:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437674, now seen corresponding path program 1 times [2018-02-02 20:12:11,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:11,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:11,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:11,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,217 INFO L182 omatonBuilderFactory]: Interpolants [4704#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 4705#(= 1 (select |#valid| |create_data_#t~mem7.base|)), 4701#true, 4702#false, 4703#(= 1 (select |#valid| |create_data_#t~malloc4.base|))] [2018-02-02 20:12:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:11,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:11,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:11,217 INFO L87 Difference]: Start difference. First operand 228 states and 251 transitions. Second operand 5 states. [2018-02-02 20:12:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:11,381 INFO L93 Difference]: Finished difference Result 295 states and 331 transitions. [2018-02-02 20:12:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:12:11,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 20:12:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:11,383 INFO L225 Difference]: With dead ends: 295 [2018-02-02 20:12:11,383 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 20:12:11,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:12:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 20:12:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 238. [2018-02-02 20:12:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 20:12:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 265 transitions. [2018-02-02 20:12:11,388 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 265 transitions. Word has length 32 [2018-02-02 20:12:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:11,388 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 265 transitions. [2018-02-02 20:12:11,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 265 transitions. [2018-02-02 20:12:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:12:11,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:11,389 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 20:12:11,389 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 20:12:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437675, now seen corresponding path program 1 times [2018-02-02 20:12:11,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:11,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:11,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:12:11,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,467 INFO L182 omatonBuilderFactory]: Interpolants [5248#(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))))), 5249#(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))))), 5250#(and (= create_data_~counter~0 0) (= (select |#length| |create_data_#t~mem7.base|) 80) (= |create_data_#t~mem7.offset| 0)), 5245#true, 5246#false, 5247#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (= 0 |create_data_#t~malloc4.offset|))] [2018-02-02 20:12:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:12:11,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:12:11,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:12:11,468 INFO L87 Difference]: Start difference. First operand 238 states and 265 transitions. Second operand 6 states. [2018-02-02 20:12:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:11,626 INFO L93 Difference]: Finished difference Result 246 states and 269 transitions. [2018-02-02 20:12:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:12:11,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 20:12:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:11,627 INFO L225 Difference]: With dead ends: 246 [2018-02-02 20:12:11,627 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 20:12:11,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:12:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 20:12:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 238. [2018-02-02 20:12:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 20:12:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 261 transitions. [2018-02-02 20:12:11,631 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 261 transitions. Word has length 32 [2018-02-02 20:12:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:11,631 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 261 transitions. [2018-02-02 20:12:11,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:12:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 261 transitions. [2018-02-02 20:12:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:12:11,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:11,632 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 20:12:11,632 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 20:12:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693333, now seen corresponding path program 1 times [2018-02-02 20:12:11,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:11,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:11,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:12:11,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,709 INFO L182 omatonBuilderFactory]: Interpolants [5744#false, 5745#(= (select |#valid| |create_data_#t~malloc3.base|) 1), 5746#(= (select |#valid| create_data_~data~0.base) 1), 5747#(and (not (= create_data_~data~0.base |create_data_#t~malloc4.base|)) (= 1 (select |#valid| |create_data_#t~malloc4.base|))), 5748#(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))))), 5749#(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))))), 5750#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 5751#(= 1 (select |#valid| |create_data_#t~mem7.base|)), 5743#true] [2018-02-02 20:12:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:11,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:12:11,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:12:11,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:12:11,710 INFO L87 Difference]: Start difference. First operand 238 states and 261 transitions. Second operand 9 states. [2018-02-02 20:12:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:12,083 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2018-02-02 20:12:12,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:12:12,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 20:12:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:12,084 INFO L225 Difference]: With dead ends: 245 [2018-02-02 20:12:12,084 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 20:12:12,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 20:12:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 237. [2018-02-02 20:12:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 20:12:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2018-02-02 20:12:12,089 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 39 [2018-02-02 20:12:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:12,089 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2018-02-02 20:12:12,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:12:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2018-02-02 20:12:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:12:12,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:12,090 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 20:12:12,090 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 20:12:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693334, now seen corresponding path program 1 times [2018-02-02 20:12:12,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:12,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:12,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:12,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:12:12,295 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:12,295 INFO L182 omatonBuilderFactory]: Interpolants [6242#true, 6243#false, 6244#(= (select |#valid| |create_data_#t~malloc3.base|) 1), 6245#(= (select |#valid| create_data_~data~0.base) 1), 6246#(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|)), 6247#(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))))), 6248#(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)), 6249#(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)))))), 6250#(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)))))), 6251#(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))))), 6252#(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))] [2018-02-02 20:12:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:12,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:12:12,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:12:12,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:12:12,296 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand 11 states. [2018-02-02 20:12:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:12,720 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2018-02-02 20:12:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:12,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-02-02 20:12:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:12,721 INFO L225 Difference]: With dead ends: 248 [2018-02-02 20:12:12,721 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 20:12:12,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:12:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 20:12:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2018-02-02 20:12:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:12:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 251 transitions. [2018-02-02 20:12:12,725 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 251 transitions. Word has length 39 [2018-02-02 20:12:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:12,725 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 251 transitions. [2018-02-02 20:12:12,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:12:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2018-02-02 20:12:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:12:12,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:12,726 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 20:12:12,726 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 20:12:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1839266135, now seen corresponding path program 1 times [2018-02-02 20:12:12,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:12,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:12,768 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 20:12:12,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:12,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:12:12,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:12,769 INFO L182 omatonBuilderFactory]: Interpolants [6747#true, 6748#false, 6749#(= 1 (select |#valid| |create_data_#t~malloc22.base|)), 6750#(= 1 (select |#valid| create_data_~nextData~0.base))] [2018-02-02 20:12:12,769 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 20:12:12,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:12:12,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:12:12,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:12,770 INFO L87 Difference]: Start difference. First operand 230 states and 251 transitions. Second operand 4 states. [2018-02-02 20:12:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:12,851 INFO L93 Difference]: Finished difference Result 234 states and 253 transitions. [2018-02-02 20:12:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:12:12,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-02-02 20:12:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:12,853 INFO L225 Difference]: With dead ends: 234 [2018-02-02 20:12:12,853 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 20:12:12,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 20:12:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2018-02-02 20:12:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 20:12:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 247 transitions. [2018-02-02 20:12:12,857 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 247 transitions. Word has length 49 [2018-02-02 20:12:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:12,858 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 247 transitions. [2018-02-02 20:12:12,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:12:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2018-02-02 20:12:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:12:12,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:12,859 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 20:12:12,859 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 20:12:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1839266134, now seen corresponding path program 1 times [2018-02-02 20:12:12,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:12,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:12,905 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 20:12:12,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:12,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:12:12,906 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:12,906 INFO L182 omatonBuilderFactory]: Interpolants [7216#false, 7217#(and (= 0 |create_data_#t~malloc22.offset|) (= 16 (select |#length| |create_data_#t~malloc22.base|))), 7218#(and (= (select |#length| create_data_~nextData~0.base) 16) (= create_data_~nextData~0.offset 0)), 7215#true] [2018-02-02 20:12:12,906 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 20:12:12,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:12:12,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:12:12,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:12,907 INFO L87 Difference]: Start difference. First operand 228 states and 247 transitions. Second operand 4 states. [2018-02-02 20:12:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,032 INFO L93 Difference]: Finished difference Result 232 states and 249 transitions. [2018-02-02 20:12:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:12:13,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-02-02 20:12:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,034 INFO L225 Difference]: With dead ends: 232 [2018-02-02 20:12:13,034 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:12:13,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:12:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 226. [2018-02-02 20:12:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 20:12:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions. [2018-02-02 20:12:13,038 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 49 [2018-02-02 20:12:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,039 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 243 transitions. [2018-02-02 20:12:13,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:12:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 243 transitions. [2018-02-02 20:12:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:12:13,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,040 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 20:12:13,040 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 20:12:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1851831937, now seen corresponding path program 1 times [2018-02-02 20:12:13,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,071 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 20:12:13,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:12:13,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,072 INFO L182 omatonBuilderFactory]: Interpolants [7680#false, 7681#(= create_data_~counter~0 0), 7682#(<= create_data_~counter~0 1), 7679#true] [2018-02-02 20:12:13,072 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 20:12:13,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:12:13,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:12:13,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:13,073 INFO L87 Difference]: Start difference. First operand 226 states and 243 transitions. Second operand 4 states. [2018-02-02 20:12:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,084 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-02-02 20:12:13,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:12:13,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-02-02 20:12:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,086 INFO L225 Difference]: With dead ends: 250 [2018-02-02 20:12:13,086 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:12:13,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:12:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:12:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2018-02-02 20:12:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:12:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 257 transitions. [2018-02-02 20:12:13,090 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 257 transitions. Word has length 52 [2018-02-02 20:12:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,091 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 257 transitions. [2018-02-02 20:12:13,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:12:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 257 transitions. [2018-02-02 20:12:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:12:13,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,092 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 20:12:13,092 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 20:12:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash -236706454, now seen corresponding path program 2 times [2018-02-02 20:12:13,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:12:13,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,132 INFO L182 omatonBuilderFactory]: Interpolants [8176#(<= create_data_~counter~0 1), 8177#(<= create_data_~counter~0 2), 8173#true, 8174#false, 8175#(= create_data_~counter~0 0)] [2018-02-02 20:12:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:13,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:13,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:13,133 INFO L87 Difference]: Start difference. First operand 240 states and 257 transitions. Second operand 5 states. [2018-02-02 20:12:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,147 INFO L93 Difference]: Finished difference Result 264 states and 281 transitions. [2018-02-02 20:12:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:12:13,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-02-02 20:12:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,151 INFO L225 Difference]: With dead ends: 264 [2018-02-02 20:12:13,151 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 20:12:13,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 20:12:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-02-02 20:12:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 20:12:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2018-02-02 20:12:13,155 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 59 [2018-02-02 20:12:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,156 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2018-02-02 20:12:13,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2018-02-02 20:12:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:12:13,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,157 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 20:12:13,157 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 20:12:13,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2050431775, now seen corresponding path program 3 times [2018-02-02 20:12:13,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:12:13,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,206 INFO L182 omatonBuilderFactory]: Interpolants [8696#true, 8697#false, 8698#(= create_data_~counter~0 0), 8699#(<= create_data_~counter~0 1), 8700#(<= create_data_~counter~0 2), 8701#(<= create_data_~counter~0 3)] [2018-02-02 20:12:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:12:13,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:12:13,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:12:13,207 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand 6 states. [2018-02-02 20:12:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,226 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-02-02 20:12:13,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:12:13,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-02-02 20:12:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,228 INFO L225 Difference]: With dead ends: 278 [2018-02-02 20:12:13,228 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 20:12:13,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:12:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 20:12:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2018-02-02 20:12:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 20:12:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-02-02 20:12:13,233 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 66 [2018-02-02 20:12:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,234 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-02-02 20:12:13,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:12:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-02-02 20:12:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:12:13,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,235 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 20:12:13,235 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 20:12:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1137393610, now seen corresponding path program 4 times [2018-02-02 20:12:13,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:12:13,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,306 INFO L182 omatonBuilderFactory]: Interpolants [9248#true, 9249#false, 9250#(= create_data_~counter~0 0), 9251#(<= create_data_~counter~0 1), 9252#(<= create_data_~counter~0 2), 9253#(<= create_data_~counter~0 3), 9254#(<= create_data_~counter~0 4)] [2018-02-02 20:12:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:12:13,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:12:13,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:13,307 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 7 states. [2018-02-02 20:12:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,331 INFO L93 Difference]: Finished difference Result 292 states and 309 transitions. [2018-02-02 20:12:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:12:13,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-02-02 20:12:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,334 INFO L225 Difference]: With dead ends: 292 [2018-02-02 20:12:13,334 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 20:12:13,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 20:12:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2018-02-02 20:12:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 20:12:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 299 transitions. [2018-02-02 20:12:13,340 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 299 transitions. Word has length 73 [2018-02-02 20:12:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,340 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 299 transitions. [2018-02-02 20:12:13,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:12:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 299 transitions. [2018-02-02 20:12:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:12:13,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,341 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 20:12:13,341 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 20:12:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1500484799, now seen corresponding path program 5 times [2018-02-02 20:12:13,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:12:13,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,416 INFO L182 omatonBuilderFactory]: Interpolants [9829#true, 9830#false, 9831#(= create_data_~counter~0 0), 9832#(<= create_data_~counter~0 1), 9833#(<= create_data_~counter~0 2), 9834#(<= create_data_~counter~0 3), 9835#(<= create_data_~counter~0 4), 9836#(<= create_data_~counter~0 5)] [2018-02-02 20:12:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:12:13,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:12:13,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:12:13,417 INFO L87 Difference]: Start difference. First operand 282 states and 299 transitions. Second operand 8 states. [2018-02-02 20:12:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,445 INFO L93 Difference]: Finished difference Result 306 states and 323 transitions. [2018-02-02 20:12:13,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:12:13,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2018-02-02 20:12:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,447 INFO L225 Difference]: With dead ends: 306 [2018-02-02 20:12:13,447 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 20:12:13,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:12:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 20:12:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 296. [2018-02-02 20:12:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 20:12:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 313 transitions. [2018-02-02 20:12:13,452 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 313 transitions. Word has length 80 [2018-02-02 20:12:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,453 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 313 transitions. [2018-02-02 20:12:13,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:12:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 313 transitions. [2018-02-02 20:12:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:12:13,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,454 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 20:12:13,454 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 20:12:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1333480918, now seen corresponding path program 6 times [2018-02-02 20:12:13,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:12:13,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,543 INFO L182 omatonBuilderFactory]: Interpolants [10439#true, 10440#false, 10441#(= create_data_~counter~0 0), 10442#(<= create_data_~counter~0 1), 10443#(<= create_data_~counter~0 2), 10444#(<= create_data_~counter~0 3), 10445#(<= create_data_~counter~0 4), 10446#(<= create_data_~counter~0 5), 10447#(<= create_data_~counter~0 6)] [2018-02-02 20:12:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:12:13,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:12:13,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:12:13,544 INFO L87 Difference]: Start difference. First operand 296 states and 313 transitions. Second operand 9 states. [2018-02-02 20:12:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,577 INFO L93 Difference]: Finished difference Result 320 states and 337 transitions. [2018-02-02 20:12:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:12:13,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-02-02 20:12:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,582 INFO L225 Difference]: With dead ends: 320 [2018-02-02 20:12:13,582 INFO L226 Difference]: Without dead ends: 320 [2018-02-02 20:12:13,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:12:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-02 20:12:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 310. [2018-02-02 20:12:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 20:12:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 327 transitions. [2018-02-02 20:12:13,588 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 327 transitions. Word has length 87 [2018-02-02 20:12:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,588 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 327 transitions. [2018-02-02 20:12:13,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:12:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 327 transitions. [2018-02-02 20:12:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:12:13,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,589 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 20:12:13,589 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 20:12:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash 352499295, now seen corresponding path program 7 times [2018-02-02 20:12:13,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,698 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 20:12:13,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:12:13,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,699 INFO L182 omatonBuilderFactory]: Interpolants [11078#true, 11079#false, 11080#(= create_data_~counter~0 0), 11081#(<= create_data_~counter~0 1), 11082#(<= create_data_~counter~0 2), 11083#(<= create_data_~counter~0 3), 11084#(<= create_data_~counter~0 4), 11085#(<= create_data_~counter~0 5), 11086#(<= create_data_~counter~0 6), 11087#(<= create_data_~counter~0 7)] [2018-02-02 20:12:13,699 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 20:12:13,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:12:13,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:12:13,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:12:13,700 INFO L87 Difference]: Start difference. First operand 310 states and 327 transitions. Second operand 10 states. [2018-02-02 20:12:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,757 INFO L93 Difference]: Finished difference Result 334 states and 351 transitions. [2018-02-02 20:12:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:12:13,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-02-02 20:12:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,759 INFO L225 Difference]: With dead ends: 334 [2018-02-02 20:12:13,760 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 20:12:13,760 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 20:12:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 20:12:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2018-02-02 20:12:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-02 20:12:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 341 transitions. [2018-02-02 20:12:13,765 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 341 transitions. Word has length 94 [2018-02-02 20:12:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,766 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 341 transitions. [2018-02-02 20:12:13,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:12:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 341 transitions. [2018-02-02 20:12:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:12:13,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,767 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 20:12:13,767 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 20:12:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1293319306, now seen corresponding path program 8 times [2018-02-02 20:12:13,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:13,862 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 20:12:13,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:13,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:12:13,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:13,863 INFO L182 omatonBuilderFactory]: Interpolants [11746#true, 11747#false, 11748#(= create_data_~counter~0 0), 11749#(<= create_data_~counter~0 1), 11750#(<= create_data_~counter~0 2), 11751#(<= create_data_~counter~0 3), 11752#(<= create_data_~counter~0 4), 11753#(<= create_data_~counter~0 5), 11754#(<= create_data_~counter~0 6), 11755#(<= create_data_~counter~0 7), 11756#(<= create_data_~counter~0 8)] [2018-02-02 20:12:13,863 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 20:12:13,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:12:13,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:12:13,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:12:13,863 INFO L87 Difference]: Start difference. First operand 324 states and 341 transitions. Second operand 11 states. [2018-02-02 20:12:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:13,903 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-02-02 20:12:13,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:13,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-02-02 20:12:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:13,904 INFO L225 Difference]: With dead ends: 348 [2018-02-02 20:12:13,904 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 20:12:13,905 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 20:12:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 20:12:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 338. [2018-02-02 20:12:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 20:12:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 355 transitions. [2018-02-02 20:12:13,909 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 355 transitions. Word has length 101 [2018-02-02 20:12:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:13,910 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 355 transitions. [2018-02-02 20:12:13,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:12:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 355 transitions. [2018-02-02 20:12:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:12:13,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:13,911 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 20:12:13,911 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 20:12:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 86671359, now seen corresponding path program 9 times [2018-02-02 20:12:13,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:13,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:14,025 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 20:12:14,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:14,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:12:14,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:14,026 INFO L182 omatonBuilderFactory]: Interpolants [12448#(<= create_data_~counter~0 3), 12449#(<= create_data_~counter~0 4), 12450#(<= create_data_~counter~0 5), 12451#(<= create_data_~counter~0 6), 12452#(<= create_data_~counter~0 7), 12453#(<= create_data_~counter~0 8), 12454#(<= create_data_~counter~0 9), 12443#true, 12444#false, 12445#(= create_data_~counter~0 0), 12446#(<= create_data_~counter~0 1), 12447#(<= create_data_~counter~0 2)] [2018-02-02 20:12:14,026 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 20:12:14,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:12:14,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:12:14,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:12:14,027 INFO L87 Difference]: Start difference. First operand 338 states and 355 transitions. Second operand 12 states. [2018-02-02 20:12:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:14,068 INFO L93 Difference]: Finished difference Result 362 states and 379 transitions. [2018-02-02 20:12:14,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:12:14,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-02-02 20:12:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:14,069 INFO L225 Difference]: With dead ends: 362 [2018-02-02 20:12:14,070 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 20:12:14,070 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 20:12:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 20:12:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2018-02-02 20:12:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 20:12:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 369 transitions. [2018-02-02 20:12:14,075 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 369 transitions. Word has length 108 [2018-02-02 20:12:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:14,075 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 369 transitions. [2018-02-02 20:12:14,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:12:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 369 transitions. [2018-02-02 20:12:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-02 20:12:14,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:14,076 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 20:12:14,076 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 20:12:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash -335110422, now seen corresponding path program 10 times [2018-02-02 20:12:14,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:14,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:14,199 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 20:12:14,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:14,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:12:14,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:14,200 INFO L182 omatonBuilderFactory]: Interpolants [13169#true, 13170#false, 13171#(= create_data_~counter~0 0), 13172#(<= create_data_~counter~0 1), 13173#(<= create_data_~counter~0 2), 13174#(<= create_data_~counter~0 3), 13175#(<= create_data_~counter~0 4), 13176#(<= create_data_~counter~0 5), 13177#(<= create_data_~counter~0 6), 13178#(<= create_data_~counter~0 7), 13179#(<= create_data_~counter~0 8), 13180#(<= create_data_~counter~0 9), 13181#(<= create_data_~counter~0 10)] [2018-02-02 20:12:14,201 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 20:12:14,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:12:14,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:12:14,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:14,201 INFO L87 Difference]: Start difference. First operand 352 states and 369 transitions. Second operand 13 states. [2018-02-02 20:12:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:14,257 INFO L93 Difference]: Finished difference Result 376 states and 393 transitions. [2018-02-02 20:12:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:12:14,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-02-02 20:12:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:14,259 INFO L225 Difference]: With dead ends: 376 [2018-02-02 20:12:14,259 INFO L226 Difference]: Without dead ends: 376 [2018-02-02 20:12:14,259 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 20:12:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-02 20:12:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 366. [2018-02-02 20:12:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 20:12:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 383 transitions. [2018-02-02 20:12:14,265 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 383 transitions. Word has length 115 [2018-02-02 20:12:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:14,265 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 383 transitions. [2018-02-02 20:12:14,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:12:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 383 transitions. [2018-02-02 20:12:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 20:12:14,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:14,266 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 20:12:14,266 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 20:12:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1801391713, now seen corresponding path program 11 times [2018-02-02 20:12:14,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:14,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:14,447 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 20:12:14,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:14,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:12:14,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:14,449 INFO L182 omatonBuilderFactory]: Interpolants [13924#true, 13925#false, 13926#(= create_data_~counter~0 0), 13927#(<= create_data_~counter~0 1), 13928#(<= create_data_~counter~0 2), 13929#(<= create_data_~counter~0 3), 13930#(<= create_data_~counter~0 4), 13931#(<= create_data_~counter~0 5), 13932#(<= create_data_~counter~0 6), 13933#(<= create_data_~counter~0 7), 13934#(<= create_data_~counter~0 8), 13935#(<= create_data_~counter~0 9), 13936#(<= create_data_~counter~0 10), 13937#(<= create_data_~counter~0 11)] [2018-02-02 20:12:14,449 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 20:12:14,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:12:14,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:12:14,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:12:14,450 INFO L87 Difference]: Start difference. First operand 366 states and 383 transitions. Second operand 14 states. [2018-02-02 20:12:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:14,495 INFO L93 Difference]: Finished difference Result 390 states and 407 transitions. [2018-02-02 20:12:14,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:12:14,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 122 [2018-02-02 20:12:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:14,497 INFO L225 Difference]: With dead ends: 390 [2018-02-02 20:12:14,497 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 20:12:14,498 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 20:12:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 20:12:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 380. [2018-02-02 20:12:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 20:12:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 397 transitions. [2018-02-02 20:12:14,503 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 397 transitions. Word has length 122 [2018-02-02 20:12:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:14,503 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 397 transitions. [2018-02-02 20:12:14,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:12:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 397 transitions. [2018-02-02 20:12:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 20:12:14,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:14,504 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 20:12:14,505 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 20:12:14,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2103122250, now seen corresponding path program 12 times [2018-02-02 20:12:14,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:14,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:14,671 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 20:12:14,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:14,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:12:14,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:14,673 INFO L182 omatonBuilderFactory]: Interpolants [14720#(<= create_data_~counter~0 10), 14721#(<= create_data_~counter~0 11), 14722#(<= create_data_~counter~0 12), 14708#true, 14709#false, 14710#(= create_data_~counter~0 0), 14711#(<= create_data_~counter~0 1), 14712#(<= create_data_~counter~0 2), 14713#(<= create_data_~counter~0 3), 14714#(<= create_data_~counter~0 4), 14715#(<= create_data_~counter~0 5), 14716#(<= create_data_~counter~0 6), 14717#(<= create_data_~counter~0 7), 14718#(<= create_data_~counter~0 8), 14719#(<= create_data_~counter~0 9)] [2018-02-02 20:12:14,673 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 20:12:14,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:12:14,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:12:14,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:12:14,674 INFO L87 Difference]: Start difference. First operand 380 states and 397 transitions. Second operand 15 states. [2018-02-02 20:12:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:14,726 INFO L93 Difference]: Finished difference Result 404 states and 421 transitions. [2018-02-02 20:12:14,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:12:14,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 129 [2018-02-02 20:12:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:14,728 INFO L225 Difference]: With dead ends: 404 [2018-02-02 20:12:14,728 INFO L226 Difference]: Without dead ends: 404 [2018-02-02 20:12:14,729 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 20:12:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-02-02 20:12:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 394. [2018-02-02 20:12:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-02 20:12:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 411 transitions. [2018-02-02 20:12:14,735 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 411 transitions. Word has length 129 [2018-02-02 20:12:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:14,735 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 411 transitions. [2018-02-02 20:12:14,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:12:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 411 transitions. [2018-02-02 20:12:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 20:12:14,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:14,737 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 20:12:14,737 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 20:12:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -526382273, now seen corresponding path program 13 times [2018-02-02 20:12:14,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:14,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:14,914 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 20:12:14,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:14,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:12:14,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:14,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 20:12:14,915 INFO L182 omatonBuilderFactory]: Interpolants [15521#true, 15522#false, 15523#(= create_data_~counter~0 0), 15524#(<= create_data_~counter~0 1), 15525#(<= create_data_~counter~0 2), 15526#(<= create_data_~counter~0 3), 15527#(<= create_data_~counter~0 4), 15528#(<= create_data_~counter~0 5), 15529#(<= create_data_~counter~0 6), 15530#(<= create_data_~counter~0 7), 15531#(<= create_data_~counter~0 8), 15532#(<= create_data_~counter~0 9), 15533#(<= create_data_~counter~0 10), 15534#(<= create_data_~counter~0 11), 15535#(<= create_data_~counter~0 12), 15536#(<= create_data_~counter~0 13)] [2018-02-02 20:12:14,916 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 20:12:14,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:12:14,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:12:14,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:12:14,917 INFO L87 Difference]: Start difference. First operand 394 states and 411 transitions. Second operand 16 states. [2018-02-02 20:12:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:14,977 INFO L93 Difference]: Finished difference Result 418 states and 435 transitions. [2018-02-02 20:12:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:12:14,977 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 136 [2018-02-02 20:12:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:14,978 INFO L225 Difference]: With dead ends: 418 [2018-02-02 20:12:14,978 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 20:12:14,979 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 20:12:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 20:12:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 408. [2018-02-02 20:12:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-02 20:12:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 425 transitions. [2018-02-02 20:12:14,984 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 425 transitions. Word has length 136 [2018-02-02 20:12:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:14,985 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 425 transitions. [2018-02-02 20:12:14,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:12:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 425 transitions. [2018-02-02 20:12:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 20:12:14,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:14,986 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 20:12:14,986 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 20:12:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1855581098, now seen corresponding path program 14 times [2018-02-02 20:12:14,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:15,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:15,193 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 20:12:15,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:15,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:12:15,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:15,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 20:12:15,194 INFO L182 omatonBuilderFactory]: Interpolants [16363#true, 16364#false, 16365#(= create_data_~counter~0 0), 16366#(<= create_data_~counter~0 1), 16367#(<= create_data_~counter~0 2), 16368#(<= create_data_~counter~0 3), 16369#(<= create_data_~counter~0 4), 16370#(<= create_data_~counter~0 5), 16371#(<= create_data_~counter~0 6), 16372#(<= create_data_~counter~0 7), 16373#(<= create_data_~counter~0 8), 16374#(<= create_data_~counter~0 9), 16375#(<= create_data_~counter~0 10), 16376#(<= create_data_~counter~0 11), 16377#(<= create_data_~counter~0 12), 16378#(<= create_data_~counter~0 13), 16379#(<= create_data_~counter~0 14)] [2018-02-02 20:12:15,194 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 20:12:15,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:12:15,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:12:15,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:12:15,195 INFO L87 Difference]: Start difference. First operand 408 states and 425 transitions. Second operand 17 states. [2018-02-02 20:12:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:15,266 INFO L93 Difference]: Finished difference Result 432 states and 449 transitions. [2018-02-02 20:12:15,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:12:15,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-02-02 20:12:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:15,268 INFO L225 Difference]: With dead ends: 432 [2018-02-02 20:12:15,268 INFO L226 Difference]: Without dead ends: 432 [2018-02-02 20:12:15,269 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 20:12:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-02-02 20:12:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 422. [2018-02-02 20:12:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 20:12:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 439 transitions. [2018-02-02 20:12:15,275 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 439 transitions. Word has length 143 [2018-02-02 20:12:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:15,275 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 439 transitions. [2018-02-02 20:12:15,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:12:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 439 transitions. [2018-02-02 20:12:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-02 20:12:15,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:15,277 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 20:12:15,277 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 20:12:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1491193055, now seen corresponding path program 15 times [2018-02-02 20:12:15,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:15,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:15,493 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 20:12:15,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:15,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:12:15,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:15,494 INFO L182 omatonBuilderFactory]: Interpolants [17248#(<= create_data_~counter~0 12), 17249#(<= create_data_~counter~0 13), 17250#(<= create_data_~counter~0 14), 17251#(<= create_data_~counter~0 15), 17234#true, 17235#false, 17236#(= create_data_~counter~0 0), 17237#(<= create_data_~counter~0 1), 17238#(<= create_data_~counter~0 2), 17239#(<= create_data_~counter~0 3), 17240#(<= create_data_~counter~0 4), 17241#(<= create_data_~counter~0 5), 17242#(<= create_data_~counter~0 6), 17243#(<= create_data_~counter~0 7), 17244#(<= create_data_~counter~0 8), 17245#(<= create_data_~counter~0 9), 17246#(<= create_data_~counter~0 10), 17247#(<= create_data_~counter~0 11)] [2018-02-02 20:12:15,494 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 20:12:15,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:12:15,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:12:15,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:12:15,495 INFO L87 Difference]: Start difference. First operand 422 states and 439 transitions. Second operand 18 states. [2018-02-02 20:12:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:15,565 INFO L93 Difference]: Finished difference Result 446 states and 463 transitions. [2018-02-02 20:12:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:12:15,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 150 [2018-02-02 20:12:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:15,567 INFO L225 Difference]: With dead ends: 446 [2018-02-02 20:12:15,567 INFO L226 Difference]: Without dead ends: 446 [2018-02-02 20:12:15,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:12:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-02 20:12:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 436. [2018-02-02 20:12:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 20:12:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 453 transitions. [2018-02-02 20:12:15,574 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 453 transitions. Word has length 150 [2018-02-02 20:12:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:15,574 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 453 transitions. [2018-02-02 20:12:15,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:12:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 453 transitions. [2018-02-02 20:12:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 20:12:15,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:15,576 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 20:12:15,576 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 20:12:15,576 INFO L82 PathProgramCache]: Analyzing trace with hash 180950538, now seen corresponding path program 16 times [2018-02-02 20:12:15,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:15,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:15,846 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 20:12:15,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:15,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:12:15,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:15,848 INFO L182 omatonBuilderFactory]: Interpolants [18144#(<= create_data_~counter~0 8), 18145#(<= create_data_~counter~0 9), 18146#(<= create_data_~counter~0 10), 18147#(<= create_data_~counter~0 11), 18148#(<= create_data_~counter~0 12), 18149#(<= create_data_~counter~0 13), 18150#(<= create_data_~counter~0 14), 18151#(<= create_data_~counter~0 15), 18152#(<= create_data_~counter~0 16), 18134#true, 18135#false, 18136#(= create_data_~counter~0 0), 18137#(<= create_data_~counter~0 1), 18138#(<= create_data_~counter~0 2), 18139#(<= create_data_~counter~0 3), 18140#(<= create_data_~counter~0 4), 18141#(<= create_data_~counter~0 5), 18142#(<= create_data_~counter~0 6), 18143#(<= create_data_~counter~0 7)] [2018-02-02 20:12:15,848 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 20:12:15,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:12:15,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:12:15,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:12:15,849 INFO L87 Difference]: Start difference. First operand 436 states and 453 transitions. Second operand 19 states. [2018-02-02 20:12:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:15,910 INFO L93 Difference]: Finished difference Result 460 states and 477 transitions. [2018-02-02 20:12:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:12:15,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 157 [2018-02-02 20:12:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:15,913 INFO L225 Difference]: With dead ends: 460 [2018-02-02 20:12:15,913 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 20:12:15,914 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 20:12:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 20:12:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 450. [2018-02-02 20:12:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-02-02 20:12:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 467 transitions. [2018-02-02 20:12:15,920 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 467 transitions. Word has length 157 [2018-02-02 20:12:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:15,920 INFO L432 AbstractCegarLoop]: Abstraction has 450 states and 467 transitions. [2018-02-02 20:12:15,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:12:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 467 transitions. [2018-02-02 20:12:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-02 20:12:15,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:15,921 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 20:12:15,921 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 20:12:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1604335231, now seen corresponding path program 17 times [2018-02-02 20:12:15,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:15,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:16,178 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 20:12:16,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:16,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:12:16,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:16,179 INFO L182 omatonBuilderFactory]: Interpolants [19072#(<= create_data_~counter~0 7), 19073#(<= create_data_~counter~0 8), 19074#(<= create_data_~counter~0 9), 19075#(<= create_data_~counter~0 10), 19076#(<= create_data_~counter~0 11), 19077#(<= create_data_~counter~0 12), 19078#(<= create_data_~counter~0 13), 19079#(<= create_data_~counter~0 14), 19080#(<= create_data_~counter~0 15), 19081#(<= create_data_~counter~0 16), 19082#(<= create_data_~counter~0 17), 19063#true, 19064#false, 19065#(= create_data_~counter~0 0), 19066#(<= create_data_~counter~0 1), 19067#(<= create_data_~counter~0 2), 19068#(<= create_data_~counter~0 3), 19069#(<= create_data_~counter~0 4), 19070#(<= create_data_~counter~0 5), 19071#(<= create_data_~counter~0 6)] [2018-02-02 20:12:16,180 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 20:12:16,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:12:16,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:12:16,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:12:16,181 INFO L87 Difference]: Start difference. First operand 450 states and 467 transitions. Second operand 20 states. [2018-02-02 20:12:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:16,250 INFO L93 Difference]: Finished difference Result 474 states and 491 transitions. [2018-02-02 20:12:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:12:16,251 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 164 [2018-02-02 20:12:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:16,253 INFO L225 Difference]: With dead ends: 474 [2018-02-02 20:12:16,253 INFO L226 Difference]: Without dead ends: 474 [2018-02-02 20:12:16,253 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 20:12:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-02-02 20:12:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 464. [2018-02-02 20:12:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-02-02 20:12:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 481 transitions. [2018-02-02 20:12:16,259 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 481 transitions. Word has length 164 [2018-02-02 20:12:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:16,260 INFO L432 AbstractCegarLoop]: Abstraction has 464 states and 481 transitions. [2018-02-02 20:12:16,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:12:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 481 transitions. [2018-02-02 20:12:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-02 20:12:16,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:16,261 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 20:12:16,261 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 20:12:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash -630286230, now seen corresponding path program 18 times [2018-02-02 20:12:16,262 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:16,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:16,551 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 20:12:16,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:16,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:12:16,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:16,559 INFO L182 omatonBuilderFactory]: Interpolants [20032#(<= create_data_~counter~0 9), 20033#(<= create_data_~counter~0 10), 20034#(<= create_data_~counter~0 11), 20035#(<= create_data_~counter~0 12), 20036#(<= create_data_~counter~0 13), 20037#(<= create_data_~counter~0 14), 20038#(<= create_data_~counter~0 15), 20039#(<= create_data_~counter~0 16), 20040#(<= create_data_~counter~0 17), 20041#(<= create_data_~counter~0 18), 20021#true, 20022#false, 20023#(= create_data_~counter~0 0), 20024#(<= create_data_~counter~0 1), 20025#(<= create_data_~counter~0 2), 20026#(<= create_data_~counter~0 3), 20027#(<= create_data_~counter~0 4), 20028#(<= create_data_~counter~0 5), 20029#(<= create_data_~counter~0 6), 20030#(<= create_data_~counter~0 7), 20031#(<= create_data_~counter~0 8)] [2018-02-02 20:12:16,560 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 20:12:16,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:12:16,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:12:16,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:12:16,561 INFO L87 Difference]: Start difference. First operand 464 states and 481 transitions. Second operand 21 states. [2018-02-02 20:12:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:16,631 INFO L93 Difference]: Finished difference Result 488 states and 505 transitions. [2018-02-02 20:12:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:12:16,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 171 [2018-02-02 20:12:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:16,633 INFO L225 Difference]: With dead ends: 488 [2018-02-02 20:12:16,633 INFO L226 Difference]: Without dead ends: 488 [2018-02-02 20:12:16,634 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 20:12:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-02-02 20:12:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2018-02-02 20:12:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-02-02 20:12:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 495 transitions. [2018-02-02 20:12:16,640 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 495 transitions. Word has length 171 [2018-02-02 20:12:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:16,641 INFO L432 AbstractCegarLoop]: Abstraction has 478 states and 495 transitions. [2018-02-02 20:12:16,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:12:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 495 transitions. [2018-02-02 20:12:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 20:12:16,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:16,642 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 20:12:16,642 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 20:12:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash -376092641, now seen corresponding path program 19 times [2018-02-02 20:12:16,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:16,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:16,887 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 20:12:16,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:16,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:12:16,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:16,888 INFO L182 omatonBuilderFactory]: Interpolants [21024#(<= create_data_~counter~0 14), 21025#(<= create_data_~counter~0 15), 21026#(<= create_data_~counter~0 16), 21027#(<= create_data_~counter~0 17), 21028#(<= create_data_~counter~0 18), 21029#(<= create_data_~counter~0 19), 21008#true, 21009#false, 21010#(= create_data_~counter~0 0), 21011#(<= create_data_~counter~0 1), 21012#(<= create_data_~counter~0 2), 21013#(<= create_data_~counter~0 3), 21014#(<= create_data_~counter~0 4), 21015#(<= create_data_~counter~0 5), 21016#(<= create_data_~counter~0 6), 21017#(<= create_data_~counter~0 7), 21018#(<= create_data_~counter~0 8), 21019#(<= create_data_~counter~0 9), 21020#(<= create_data_~counter~0 10), 21021#(<= create_data_~counter~0 11), 21022#(<= create_data_~counter~0 12), 21023#(<= create_data_~counter~0 13)] [2018-02-02 20:12:16,888 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 20:12:16,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:12:16,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:12:16,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:12:16,889 INFO L87 Difference]: Start difference. First operand 478 states and 495 transitions. Second operand 22 states. [2018-02-02 20:12:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:16,958 INFO L93 Difference]: Finished difference Result 492 states and 509 transitions. [2018-02-02 20:12:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:12:16,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2018-02-02 20:12:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:16,959 INFO L225 Difference]: With dead ends: 492 [2018-02-02 20:12:16,959 INFO L226 Difference]: Without dead ends: 492 [2018-02-02 20:12:16,959 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 20:12:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-02-02 20:12:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2018-02-02 20:12:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-02-02 20:12:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 509 transitions. [2018-02-02 20:12:16,963 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 509 transitions. Word has length 178 [2018-02-02 20:12:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:16,964 INFO L432 AbstractCegarLoop]: Abstraction has 492 states and 509 transitions. [2018-02-02 20:12:16,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:12:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 509 transitions. [2018-02-02 20:12:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-02 20:12:16,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:16,964 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 20:12:16,964 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 20:12:16,965 INFO L82 PathProgramCache]: Analyzing trace with hash 59798218, now seen corresponding path program 20 times [2018-02-02 20:12:16,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:17,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:17,833 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 20:12:17,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:17,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:12:17,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:17,834 INFO L182 omatonBuilderFactory]: Interpolants [22016#(= 1 (select |#valid| |append_#t~malloc34.base|)), 22017#(= 1 (select |#valid| append_~node~0.base)), 22018#(= |#valid| |old(#valid)|), 22019#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 22020#(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|))))), 22021#(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|))), 22022#(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)|))), 22014#true, 22015#false] [2018-02-02 20:12:17,834 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 20:12:17,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:12:17,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:12:17,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:12:17,834 INFO L87 Difference]: Start difference. First operand 492 states and 509 transitions. Second operand 9 states. [2018-02-02 20:12:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:18,571 INFO L93 Difference]: Finished difference Result 519 states and 537 transitions. [2018-02-02 20:12:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:18,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 185 [2018-02-02 20:12:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:18,573 INFO L225 Difference]: With dead ends: 519 [2018-02-02 20:12:18,573 INFO L226 Difference]: Without dead ends: 519 [2018-02-02 20:12:18,574 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 20:12:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-02-02 20:12:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 507. [2018-02-02 20:12:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-02-02 20:12:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 529 transitions. [2018-02-02 20:12:18,580 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 529 transitions. Word has length 185 [2018-02-02 20:12:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:18,580 INFO L432 AbstractCegarLoop]: Abstraction has 507 states and 529 transitions. [2018-02-02 20:12:18,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:12:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 529 transitions. [2018-02-02 20:12:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-02 20:12:18,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:18,581 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 20:12:18,582 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 20:12:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash 59798219, now seen corresponding path program 1 times [2018-02-02 20:12:18,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:18,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:19,499 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 20:12:19,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:19,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:12:19,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:19,500 INFO L182 omatonBuilderFactory]: Interpolants [23061#true, 23062#false, 23063#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 23064#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0)), 23065#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1)), 23066#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 23067#(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|)), 23068#(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|))))), 23069#(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|)), 23070#(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|))))), 23071#(and (<= 8 (select |#length| append_~node~0.base)) (= append_~node~0.offset 0))] [2018-02-02 20:12:19,501 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 20:12:19,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:12:19,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:12:19,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:12:19,501 INFO L87 Difference]: Start difference. First operand 507 states and 529 transitions. Second operand 11 states. [2018-02-02 20:12:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:20,050 INFO L93 Difference]: Finished difference Result 516 states and 534 transitions. [2018-02-02 20:12:20,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:12:20,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-02-02 20:12:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:20,052 INFO L225 Difference]: With dead ends: 516 [2018-02-02 20:12:20,052 INFO L226 Difference]: Without dead ends: 516 [2018-02-02 20:12:20,052 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 20:12:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-02 20:12:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 507. [2018-02-02 20:12:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-02-02 20:12:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 526 transitions. [2018-02-02 20:12:20,059 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 526 transitions. Word has length 185 [2018-02-02 20:12:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:20,059 INFO L432 AbstractCegarLoop]: Abstraction has 507 states and 526 transitions. [2018-02-02 20:12:20,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:12:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 526 transitions. [2018-02-02 20:12:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 20:12:20,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:20,060 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 20:12:20,060 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 20:12:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1631520313, now seen corresponding path program 1 times [2018-02-02 20:12:20,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:20,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:20,535 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 20:12:20,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:20,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:12:20,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:20,536 INFO L182 omatonBuilderFactory]: Interpolants [24101#true, 24102#false, 24103#(= 1 (select |#valid| append_~pointerToList.base)), 24104#(= |#valid| |old(#valid)|), 24105#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 24106#(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|))))), 24107#(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|))), 24108#(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)|))), 24109#(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 20:12:20,536 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 20:12:20,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:12:20,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:12:20,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:12:20,537 INFO L87 Difference]: Start difference. First operand 507 states and 526 transitions. Second operand 9 states. [2018-02-02 20:12:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:21,137 INFO L93 Difference]: Finished difference Result 512 states and 529 transitions. [2018-02-02 20:12:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:12:21,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2018-02-02 20:12:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:21,138 INFO L225 Difference]: With dead ends: 512 [2018-02-02 20:12:21,138 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 20:12:21,138 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 20:12:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 20:12:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2018-02-02 20:12:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-02-02 20:12:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 529 transitions. [2018-02-02 20:12:21,142 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 529 transitions. Word has length 187 [2018-02-02 20:12:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:21,143 INFO L432 AbstractCegarLoop]: Abstraction has 510 states and 529 transitions. [2018-02-02 20:12:21,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:12:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 529 transitions. [2018-02-02 20:12:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 20:12:21,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:21,144 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 20:12:21,144 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 20:12:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1631520314, now seen corresponding path program 1 times [2018-02-02 20:12:21,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:21,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:21,976 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 20:12:21,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:21,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:12:21,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:21,977 INFO L182 omatonBuilderFactory]: Interpolants [25152#(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|))))), 25153#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 25142#true, 25143#false, 25144#(= 0 |main_~#list~0.offset|), 25145#(= 0 |append_#in~pointerToList.offset|), 25146#(= append_~pointerToList.offset 0), 25147#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 25148#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 25149#(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|)), 25150#(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|))))), 25151#(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 20:12:21,977 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 20:12:21,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:12:21,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:12:21,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:12:21,978 INFO L87 Difference]: Start difference. First operand 510 states and 529 transitions. Second operand 12 states. [2018-02-02 20:12:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:22,481 INFO L93 Difference]: Finished difference Result 509 states and 526 transitions. [2018-02-02 20:12:22,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:12:22,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2018-02-02 20:12:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:22,486 INFO L225 Difference]: With dead ends: 509 [2018-02-02 20:12:22,487 INFO L226 Difference]: Without dead ends: 509 [2018-02-02 20:12:22,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:12:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-02 20:12:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-02-02 20:12:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-02-02 20:12:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 526 transitions. [2018-02-02 20:12:22,494 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 526 transitions. Word has length 187 [2018-02-02 20:12:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:22,494 INFO L432 AbstractCegarLoop]: Abstraction has 509 states and 526 transitions. [2018-02-02 20:12:22,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:12:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 526 transitions. [2018-02-02 20:12:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-02 20:12:22,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:22,495 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 20:12:22,496 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 20:12:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1522989126, now seen corresponding path program 1 times [2018-02-02 20:12:22,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:22,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:22,564 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 20:12:22,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:22,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:22,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:22,564 INFO L182 omatonBuilderFactory]: Interpolants [26192#(= 1 (select |#valid| |main_~#list~0.base|)), 26188#true, 26189#false, 26190#(= append_~pointerToList.base |append_#in~pointerToList.base|), 26191#(= 1 (select |#valid| |append_#in~pointerToList.base|))] [2018-02-02 20:12:22,565 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 20:12:22,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:22,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:22,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:22,565 INFO L87 Difference]: Start difference. First operand 509 states and 526 transitions. Second operand 5 states. [2018-02-02 20:12:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:22,720 INFO L93 Difference]: Finished difference Result 508 states and 525 transitions. [2018-02-02 20:12:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:12:22,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-02-02 20:12:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:22,722 INFO L225 Difference]: With dead ends: 508 [2018-02-02 20:12:22,722 INFO L226 Difference]: Without dead ends: 508 [2018-02-02 20:12:22,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:12:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-02-02 20:12:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-02-02 20:12:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 20:12:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 525 transitions. [2018-02-02 20:12:22,730 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 525 transitions. Word has length 190 [2018-02-02 20:12:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:22,730 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 525 transitions. [2018-02-02 20:12:22,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 525 transitions. [2018-02-02 20:12:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-02 20:12:22,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:22,732 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 20:12:22,732 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 20:12:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1522989125, now seen corresponding path program 1 times [2018-02-02 20:12:22,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:22,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:22,923 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 20:12:22,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:22,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:12:22,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:22,924 INFO L182 omatonBuilderFactory]: Interpolants [27216#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|))), 27211#true, 27212#false, 27213#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 27214#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 27215#(or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0)))] [2018-02-02 20:12:22,924 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 20:12:22,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:12:22,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:12:22,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:12:22,925 INFO L87 Difference]: Start difference. First operand 508 states and 525 transitions. Second operand 6 states. [2018-02-02 20:12:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:23,095 INFO L93 Difference]: Finished difference Result 503 states and 520 transitions. [2018-02-02 20:12:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:12:23,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-02-02 20:12:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:23,096 INFO L225 Difference]: With dead ends: 503 [2018-02-02 20:12:23,096 INFO L226 Difference]: Without dead ends: 503 [2018-02-02 20:12:23,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-02 20:12:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-02-02 20:12:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-02 20:12:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 520 transitions. [2018-02-02 20:12:23,101 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 520 transitions. Word has length 190 [2018-02-02 20:12:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:23,101 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 520 transitions. [2018-02-02 20:12:23,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:12:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 520 transitions. [2018-02-02 20:12:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 20:12:23,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:23,102 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 20:12:23,102 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 20:12:23,102 INFO L82 PathProgramCache]: Analyzing trace with hash 31977470, now seen corresponding path program 1 times [2018-02-02 20:12:23,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:23,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:23,179 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 20:12:23,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:23,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:12:23,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:23,180 INFO L182 omatonBuilderFactory]: Interpolants [28225#true, 28226#false, 28227#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 28228#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 28229#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 28230#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 28231#(= 1 (select |#valid| |main_#t~mem47.base|))] [2018-02-02 20:12:23,180 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 20:12:23,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:12:23,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:12:23,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:23,180 INFO L87 Difference]: Start difference. First operand 503 states and 520 transitions. Second operand 7 states. [2018-02-02 20:12:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:23,407 INFO L93 Difference]: Finished difference Result 517 states and 536 transitions. [2018-02-02 20:12:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:12:23,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2018-02-02 20:12:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:23,409 INFO L225 Difference]: With dead ends: 517 [2018-02-02 20:12:23,409 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 20:12:23,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:12:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 20:12:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 502. [2018-02-02 20:12:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-02-02 20:12:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 519 transitions. [2018-02-02 20:12:23,415 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 519 transitions. Word has length 191 [2018-02-02 20:12:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:23,415 INFO L432 AbstractCegarLoop]: Abstraction has 502 states and 519 transitions. [2018-02-02 20:12:23,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:12:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 519 transitions. [2018-02-02 20:12:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 20:12:23,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:23,417 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 20:12:23,417 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 20:12:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash 31977471, now seen corresponding path program 1 times [2018-02-02 20:12:23,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:23,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:23,643 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 20:12:23,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:23,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:12:23,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:23,644 INFO L182 omatonBuilderFactory]: Interpolants [29264#(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|)))), 29265#(and (<= 4 (select |#length| |main_#t~mem47.base|)) (= |main_#t~mem47.offset| 0)), 29257#true, 29258#false, 29259#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 29260#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 29261#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0)), 29262#(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)), 29263#(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 20:12:23,645 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 20:12:23,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:12:23,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:12:23,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:12:23,645 INFO L87 Difference]: Start difference. First operand 502 states and 519 transitions. Second operand 9 states. [2018-02-02 20:12:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:23,954 INFO L93 Difference]: Finished difference Result 526 states and 545 transitions. [2018-02-02 20:12:23,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:12:23,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2018-02-02 20:12:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:23,955 INFO L225 Difference]: With dead ends: 526 [2018-02-02 20:12:23,955 INFO L226 Difference]: Without dead ends: 526 [2018-02-02 20:12:23,956 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 20:12:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-02-02 20:12:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 501. [2018-02-02 20:12:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-02-02 20:12:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 518 transitions. [2018-02-02 20:12:23,962 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 518 transitions. Word has length 191 [2018-02-02 20:12:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:23,962 INFO L432 AbstractCegarLoop]: Abstraction has 501 states and 518 transitions. [2018-02-02 20:12:23,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:12:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 518 transitions. [2018-02-02 20:12:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 20:12:23,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:23,964 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 20:12:23,964 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 20:12:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash -166105366, now seen corresponding path program 1 times [2018-02-02 20:12:23,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:24,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:24,715 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 20:12:24,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:24,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:12:24,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:24,715 INFO L182 omatonBuilderFactory]: Interpolants [30307#true, 30308#false, 30309#(= 1 (select |#valid| |append_#t~malloc34.base|)), 30310#(= 1 (select |#valid| append_~node~0.base)), 30311#(= |#valid| |old(#valid)|), 30312#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 30313#(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|))))), 30314#(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|))), 30315#(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|)))), 30316#(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|))))), 30317#(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|)))))), 30318#(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|)))), 30319#(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 20:12:24,716 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 20:12:24,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:12:24,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:12:24,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:24,716 INFO L87 Difference]: Start difference. First operand 501 states and 518 transitions. Second operand 13 states. [2018-02-02 20:12:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:25,609 INFO L93 Difference]: Finished difference Result 499 states and 516 transitions. [2018-02-02 20:12:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:25,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-02-02 20:12:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:25,610 INFO L225 Difference]: With dead ends: 499 [2018-02-02 20:12:25,610 INFO L226 Difference]: Without dead ends: 499 [2018-02-02 20:12:25,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:12:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-02 20:12:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-02-02 20:12:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-02 20:12:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 516 transitions. [2018-02-02 20:12:25,616 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 516 transitions. Word has length 194 [2018-02-02 20:12:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:25,616 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 516 transitions. [2018-02-02 20:12:25,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:12:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 516 transitions. [2018-02-02 20:12:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 20:12:25,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:25,617 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 20:12:25,617 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 20:12:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash -166105365, now seen corresponding path program 1 times [2018-02-02 20:12:25,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:25,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:26,574 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 20:12:26,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:26,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:12:26,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:26,608 INFO L182 omatonBuilderFactory]: Interpolants [31334#true, 31335#false, 31336#(and (= 8 (select |#length| |append_#t~malloc34.base|)) (= 0 |append_#t~malloc34.offset|)), 31337#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0)), 31338#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1)), 31339#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 31340#(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|)), 31341#(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|))))), 31342#(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|)), 31343#(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|))))), 31344#(and (= 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|)))) (or (= 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|))) (= 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|))) (= (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|)) (= |#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|))))), 31345#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= 16 (select |#length| (@diff |old(#length)| |#length|))) (= 80 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (or (= 0 (select |old(#valid)| (@diff (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) |#length|))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (= 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|))) (= 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|)))) (= |#length| (store (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (@diff (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) |#length|) (select |#length| (@diff (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) |#length|)))) (or (= 16 (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (= 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|))))), 31346#(and (= append_~node~0.offset 0) (< 3 (select |#length| append_~node~0.base)))] [2018-02-02 20:12:26,609 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 20:12:26,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:12:26,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:12:26,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:26,609 INFO L87 Difference]: Start difference. First operand 499 states and 516 transitions. Second operand 13 states. [2018-02-02 20:12:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:27,112 INFO L93 Difference]: Finished difference Result 497 states and 514 transitions. [2018-02-02 20:12:27,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:27,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-02-02 20:12:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:27,114 INFO L225 Difference]: With dead ends: 497 [2018-02-02 20:12:27,114 INFO L226 Difference]: Without dead ends: 497 [2018-02-02 20:12:27,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:12:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-02 20:12:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2018-02-02 20:12:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-02-02 20:12:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 514 transitions. [2018-02-02 20:12:27,119 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 514 transitions. Word has length 194 [2018-02-02 20:12:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:27,119 INFO L432 AbstractCegarLoop]: Abstraction has 497 states and 514 transitions. [2018-02-02 20:12:27,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:12:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 514 transitions. [2018-02-02 20:12:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 20:12:27,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:27,121 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 20:12:27,121 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 20:12:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash -326265980, now seen corresponding path program 1 times [2018-02-02 20:12:27,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:27,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:27,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 20:12:27,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:27,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:27,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:27,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 20:12:27,205 INFO L182 omatonBuilderFactory]: Interpolants [32347#true, 32348#false, 32349#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 32350#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 32351#(= 1 (select |#valid| |main_#t~mem49.base|))] [2018-02-02 20:12:27,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 20:12:27,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:27,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:27,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:27,206 INFO L87 Difference]: Start difference. First operand 497 states and 514 transitions. Second operand 5 states. [2018-02-02 20:12:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:27,324 INFO L93 Difference]: Finished difference Result 512 states and 531 transitions. [2018-02-02 20:12:27,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:12:27,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-02-02 20:12:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:27,328 INFO L225 Difference]: With dead ends: 512 [2018-02-02 20:12:27,328 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 20:12:27,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 20:12:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 496. [2018-02-02 20:12:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-02-02 20:12:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 513 transitions. [2018-02-02 20:12:27,333 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 513 transitions. Word has length 195 [2018-02-02 20:12:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:27,333 INFO L432 AbstractCegarLoop]: Abstraction has 496 states and 513 transitions. [2018-02-02 20:12:27,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 513 transitions. [2018-02-02 20:12:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 20:12:27,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:27,335 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 20:12:27,335 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 20:12:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash -326265979, now seen corresponding path program 1 times [2018-02-02 20:12:27,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:27,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:27,702 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 20:12:27,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:27,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:12:27,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:27,704 INFO L182 omatonBuilderFactory]: Interpolants [33364#true, 33365#false, 33366#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 33367#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 33368#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 33369#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 33370#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 33371#(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|))), 33372#(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|)))), 33373#(and (<= (+ |main_#t~mem49.offset| 4) (select |#length| |main_#t~mem49.base|)) (<= 0 |main_#t~mem49.offset|))] [2018-02-02 20:12:27,704 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 20:12:27,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:12:27,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:12:27,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:12:27,705 INFO L87 Difference]: Start difference. First operand 496 states and 513 transitions. Second operand 10 states. [2018-02-02 20:12:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:27,966 INFO L93 Difference]: Finished difference Result 521 states and 540 transitions. [2018-02-02 20:12:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:12:27,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-02-02 20:12:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:27,967 INFO L225 Difference]: With dead ends: 521 [2018-02-02 20:12:27,967 INFO L226 Difference]: Without dead ends: 521 [2018-02-02 20:12:27,967 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 20:12:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-02 20:12:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 495. [2018-02-02 20:12:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-02 20:12:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 512 transitions. [2018-02-02 20:12:27,972 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 512 transitions. Word has length 195 [2018-02-02 20:12:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:27,973 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 512 transitions. [2018-02-02 20:12:27,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:12:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 512 transitions. [2018-02-02 20:12:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 20:12:27,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:27,974 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 20:12:27,974 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 20:12:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash -713459111, now seen corresponding path program 1 times [2018-02-02 20:12:27,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:28,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:29,217 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 20:12:29,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:29,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:12:29,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:29,218 INFO L182 omatonBuilderFactory]: Interpolants [34405#true, 34406#false, 34407#(= 1 (select |#valid| append_~pointerToList.base)), 34408#(= |#valid| |old(#valid)|), 34409#(= (store |old(#valid)| |create_data_#t~malloc3.base| (select |#valid| |create_data_#t~malloc3.base|)) |#valid|), 34410#(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|))))), 34411#(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|))), 34412#(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|)))), 34413#(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|))))), 34414#(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|)))))), 34415#(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|)))), 34416#(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))), 34417#(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 20:12:29,219 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 20:12:29,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:12:29,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:12:29,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:29,219 INFO L87 Difference]: Start difference. First operand 495 states and 512 transitions. Second operand 13 states. [2018-02-02 20:12:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:30,432 INFO L93 Difference]: Finished difference Result 494 states and 511 transitions. [2018-02-02 20:12:30,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:30,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2018-02-02 20:12:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:30,434 INFO L225 Difference]: With dead ends: 494 [2018-02-02 20:12:30,434 INFO L226 Difference]: Without dead ends: 494 [2018-02-02 20:12:30,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:12:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-02 20:12:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2018-02-02 20:12:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 20:12:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 511 transitions. [2018-02-02 20:12:30,437 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 511 transitions. Word has length 196 [2018-02-02 20:12:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:30,437 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 511 transitions. [2018-02-02 20:12:30,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:12:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 511 transitions. [2018-02-02 20:12:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 20:12:30,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:30,437 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 20:12:30,437 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 20:12:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash -713459110, now seen corresponding path program 1 times [2018-02-02 20:12:30,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:30,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 16 proven. 921 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-02-02 20:12:32,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:32,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:12:32,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:32,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 20:12:32,549 INFO L182 omatonBuilderFactory]: Interpolants [35424#(= 0 |append_#in~pointerToList.offset|), 35425#(= append_~pointerToList.offset 0), 35426#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 35427#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 35428#(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|)), 35429#(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)), 35430#(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|)), 35431#(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|))))), 35432#(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|))))), 35433#(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|))))), 35434#(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|))))), 35435#(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|))))), 35436#(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|))))), 35437#(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|)) (= |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|)))) (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|))))), 35438#(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|))))), 35439#(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|))))), 35440#(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|))))), 35441#(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|))))), 35442#(and (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 35421#true, 35422#false, 35423#(= 0 |main_~#list~0.offset|)] [2018-02-02 20:12:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 16 proven. 921 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-02-02 20:12:32,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:12:32,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:12:32,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:12:32,550 INFO L87 Difference]: Start difference. First operand 494 states and 511 transitions. Second operand 22 states. [2018-02-02 20:12:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:34,037 INFO L93 Difference]: Finished difference Result 493 states and 510 transitions. [2018-02-02 20:12:34,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:12:34,037 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 196 [2018-02-02 20:12:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:34,038 INFO L225 Difference]: With dead ends: 493 [2018-02-02 20:12:34,038 INFO L226 Difference]: Without dead ends: 493 [2018-02-02 20:12:34,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:12:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-02-02 20:12:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 482. [2018-02-02 20:12:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-02 20:12:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 499 transitions. [2018-02-02 20:12:34,043 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 499 transitions. Word has length 196 [2018-02-02 20:12:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:34,044 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 499 transitions. [2018-02-02 20:12:34,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:12:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 499 transitions. [2018-02-02 20:12:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 20:12:34,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:34,044 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 20:12:34,044 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 20:12:34,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1524310655, now seen corresponding path program 1 times [2018-02-02 20:12:34,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:34,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:34,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 20:12:34,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:34,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 20:12:34,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:34,393 INFO L182 omatonBuilderFactory]: Interpolants [36448#(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)))))), 36449#(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|))))), 36450#(= 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|)))), 36451#(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|))), 36452#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem49.base|) |main_#t~mem49.offset|))), 36453#(= 1 (select |#valid| |main_#t~mem50.base|)), 36438#true, 36439#false, 36440#(= (select |#valid| |main_~#list~0.base|) 1), 36441#(= |#valid| |old(#valid)|), 36442#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 36443#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 36444#(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|)))), 36445#(= 1 (select |#valid| create_data_~data~0.base)), 36446#(= 1 (select |#valid| |create_data_#res.base|)), 36447#(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|)))))] [2018-02-02 20:12:34,394 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 20:12:34,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:12:34,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:12:34,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:12:34,394 INFO L87 Difference]: Start difference. First operand 482 states and 499 transitions. Second operand 16 states. [2018-02-02 20:12:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:35,111 INFO L93 Difference]: Finished difference Result 524 states and 549 transitions. [2018-02-02 20:12:35,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:12:35,112 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 196 [2018-02-02 20:12:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:35,113 INFO L225 Difference]: With dead ends: 524 [2018-02-02 20:12:35,114 INFO L226 Difference]: Without dead ends: 524 [2018-02-02 20:12:35,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:12:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-02-02 20:12:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 485. [2018-02-02 20:12:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-02-02 20:12:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 505 transitions. [2018-02-02 20:12:35,117 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 505 transitions. Word has length 196 [2018-02-02 20:12:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:35,117 INFO L432 AbstractCegarLoop]: Abstraction has 485 states and 505 transitions. [2018-02-02 20:12:35,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:12:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 505 transitions. [2018-02-02 20:12:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 20:12:35,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:35,118 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 20:12:35,118 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 20:12:35,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1524310654, now seen corresponding path program 1 times [2018-02-02 20:12:35,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:35,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:35,546 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 20:12:35,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:35,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:12:35,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:35,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 20:12:35,548 INFO L182 omatonBuilderFactory]: Interpolants [37504#(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))), 37505#(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)))))), 37506#(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|))))), 37507#(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|))))), 37508#(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|))), 37509#(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|)))), 37510#(and (<= 16 (select |#length| |main_#t~mem50.base|)) (= |main_#t~mem50.offset| 0)), 37493#true, 37494#false, 37495#(= (select |#valid| |main_~#list~0.base|) 1), 37496#(= |#valid| |old(#valid)|), 37497#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 37498#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 37499#(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|)))), 37500#(= 0 |create_data_#t~malloc3.offset|), 37501#(= 0 create_data_~data~0.offset), 37502#(and (= 0 create_data_~data~0.offset) (<= (+ create_data_~data~0.offset 16) (select |#length| create_data_~data~0.base))), 37503#(and (<= 16 (select |#length| |create_data_#res.base|)) (= 0 |create_data_#res.offset|))] [2018-02-02 20:12:35,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 20:12:35,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:12:35,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:12:35,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:12:35,549 INFO L87 Difference]: Start difference. First operand 485 states and 505 transitions. Second operand 18 states. [2018-02-02 20:12:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:36,303 INFO L93 Difference]: Finished difference Result 523 states and 547 transitions. [2018-02-02 20:12:36,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:12:36,303 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2018-02-02 20:12:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:36,304 INFO L225 Difference]: With dead ends: 523 [2018-02-02 20:12:36,305 INFO L226 Difference]: Without dead ends: 523 [2018-02-02 20:12:36,305 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 20:12:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-02 20:12:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 485. [2018-02-02 20:12:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-02-02 20:12:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 504 transitions. [2018-02-02 20:12:36,313 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 504 transitions. Word has length 196 [2018-02-02 20:12:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:36,313 INFO L432 AbstractCegarLoop]: Abstraction has 485 states and 504 transitions. [2018-02-02 20:12:36,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:12:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 504 transitions. [2018-02-02 20:12:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 20:12:36,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:36,315 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 20:12:36,315 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 20:12:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1813470134, now seen corresponding path program 1 times [2018-02-02 20:12:36,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:36,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:36,404 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 20:12:36,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:36,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:36,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:36,405 INFO L182 omatonBuilderFactory]: Interpolants [38547#true, 38548#false, 38549#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 38550#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 38551#(= 1 (select |#valid| |main_#t~mem53.base|))] [2018-02-02 20:12:36,405 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 20:12:36,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:36,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:36,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:36,406 INFO L87 Difference]: Start difference. First operand 485 states and 504 transitions. Second operand 5 states. [2018-02-02 20:12:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:36,528 INFO L93 Difference]: Finished difference Result 499 states and 520 transitions. [2018-02-02 20:12:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:12:36,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2018-02-02 20:12:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:36,529 INFO L225 Difference]: With dead ends: 499 [2018-02-02 20:12:36,529 INFO L226 Difference]: Without dead ends: 499 [2018-02-02 20:12:36,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-02 20:12:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 490. [2018-02-02 20:12:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-02-02 20:12:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 511 transitions. [2018-02-02 20:12:36,532 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 511 transitions. Word has length 202 [2018-02-02 20:12:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:36,533 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 511 transitions. [2018-02-02 20:12:36,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 511 transitions. [2018-02-02 20:12:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 20:12:36,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:36,533 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 20:12:36,534 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 20:12:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1813470135, now seen corresponding path program 1 times [2018-02-02 20:12:36,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:36,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:36,884 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 20:12:36,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:36,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:12:36,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:36,885 INFO L182 omatonBuilderFactory]: Interpolants [39552#(not (= |create_data_#t~malloc3.base| 0)), 39553#(not (= create_data_~data~0.base 0)), 39554#(not (= |create_data_#res.base| 0)), 39555#(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)))), 39556#(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))))), 39557#(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))), 39558#(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)), 39559#(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|))), 39560#(not (= |main_#t~mem48.base| 0)), 39561#|main_#t~short52|, 39545#true, 39546#false, 39547#(= (select |#valid| |main_~#list~0.base|) 1), 39548#(= |#valid| |old(#valid)|), 39549#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 39550#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 39551#(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|))))] [2018-02-02 20:12:36,885 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 20:12:36,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:12:36,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:12:36,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:12:36,886 INFO L87 Difference]: Start difference. First operand 490 states and 511 transitions. Second operand 17 states. [2018-02-02 20:12:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:37,637 INFO L93 Difference]: Finished difference Result 530 states and 555 transitions. [2018-02-02 20:12:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:12:37,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 202 [2018-02-02 20:12:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:37,638 INFO L225 Difference]: With dead ends: 530 [2018-02-02 20:12:37,638 INFO L226 Difference]: Without dead ends: 530 [2018-02-02 20:12:37,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:12:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-02 20:12:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 490. [2018-02-02 20:12:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-02-02 20:12:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 510 transitions. [2018-02-02 20:12:37,642 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 510 transitions. Word has length 202 [2018-02-02 20:12:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:37,642 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 510 transitions. [2018-02-02 20:12:37,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:12:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 510 transitions. [2018-02-02 20:12:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-02 20:12:37,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:37,643 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 20:12:37,643 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 20:12:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -470384195, now seen corresponding path program 1 times [2018-02-02 20:12:37,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:37,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:38,622 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 20:12:38,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:38,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:12:38,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:38,623 INFO L182 omatonBuilderFactory]: Interpolants [40614#true, 40615#false, 40616#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 40617#(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|)), 40618#(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))), 40619#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1) (= 8 (select |#length| append_~node~0.base))), 40620#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 40621#(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|)), 40622#(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|))), 40623#(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|)), 40624#(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|))))), 40625#(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|))))), 40626#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| append_~node~0.base))) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 80 (select |#length| append_~node~0.base))))), 40627#(and (or (= 80 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 8 (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|))), 40628#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 40629#(and (= |main_#t~mem47.offset| 0) (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 40630#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (select |#length| |main_#t~mem49.base|) 80) (= 8 (select |#length| |main_#t~mem49.base|))) (<= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 40631#(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|)))), 40632#(and (<= (+ |main_#t~mem53.offset| 8) (select |#length| |main_#t~mem53.base|)) (<= 0 |main_#t~mem53.offset|))] [2018-02-02 20:12:38,623 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 20:12:38,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:12:38,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:12:38,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:12:38,623 INFO L87 Difference]: Start difference. First operand 490 states and 510 transitions. Second operand 19 states. [2018-02-02 20:12:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:39,697 INFO L93 Difference]: Finished difference Result 568 states and 600 transitions. [2018-02-02 20:12:39,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:12:39,698 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-02-02 20:12:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:39,699 INFO L225 Difference]: With dead ends: 568 [2018-02-02 20:12:39,699 INFO L226 Difference]: Without dead ends: 568 [2018-02-02 20:12:39,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:12:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-02-02 20:12:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 531. [2018-02-02 20:12:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-02-02 20:12:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 560 transitions. [2018-02-02 20:12:39,703 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 560 transitions. Word has length 206 [2018-02-02 20:12:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:39,703 INFO L432 AbstractCegarLoop]: Abstraction has 531 states and 560 transitions. [2018-02-02 20:12:39,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:12:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 560 transitions. [2018-02-02 20:12:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 20:12:39,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:39,703 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 20:12:39,704 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 20:12:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1090531839, now seen corresponding path program 1 times [2018-02-02 20:12:39,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:39,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:40,034 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 20:12:40,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:40,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:12:40,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:40,035 INFO L182 omatonBuilderFactory]: Interpolants [41760#(= 0 |main_~#list~0.offset|), 41761#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 41762#(or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0))), 41763#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|)), 41764#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= 1 (select |#valid| |main_~#list~0.base|))), 41765#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (not (= (select |#valid| |main_~#list~0.base|) 0))), 41766#(and (<= 4 (select |#length| |append_#in~pointerToList.base|)) (= 0 |append_#in~pointerToList.offset|) (not (= (select |#valid| |append_#in~pointerToList.base|) 0))), 41767#(and (<= 4 (select |#length| append_~pointerToList.base)) (not (= (select |#valid| append_~pointerToList.base) 0)) (= append_~pointerToList.offset 0)), 41768#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 41758#true, 41759#false] [2018-02-02 20:12:40,035 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 20:12:40,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:12:40,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:12:40,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:12:40,036 INFO L87 Difference]: Start difference. First operand 531 states and 560 transitions. Second operand 11 states. [2018-02-02 20:12:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:40,186 INFO L93 Difference]: Finished difference Result 529 states and 555 transitions. [2018-02-02 20:12:40,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:12:40,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2018-02-02 20:12:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:40,187 INFO L225 Difference]: With dead ends: 529 [2018-02-02 20:12:40,187 INFO L226 Difference]: Without dead ends: 529 [2018-02-02 20:12:40,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-02 20:12:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 527. [2018-02-02 20:12:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-02-02 20:12:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 553 transitions. [2018-02-02 20:12:40,191 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 553 transitions. Word has length 207 [2018-02-02 20:12:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:40,192 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 553 transitions. [2018-02-02 20:12:40,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:12:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 553 transitions. [2018-02-02 20:12:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-02 20:12:40,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:40,192 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, 1, 1] [2018-02-02 20:12:40,192 INFO L371 AbstractCegarLoop]: === Iteration 56 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:12:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1068627815, now seen corresponding path program 1 times [2018-02-02 20:12:40,193 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:40,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:40,293 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 20:12:40,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:40,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:12:40,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:40,294 INFO L182 omatonBuilderFactory]: Interpolants [42832#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc34.base|))), 42833#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 42834#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 42835#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 42836#(not (= 0 |main_#t~mem59.base|)), 42829#true, 42830#false, 42831#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))] [2018-02-02 20:12:40,294 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 20:12:40,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:12:40,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:12:40,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:12:40,294 INFO L87 Difference]: Start difference. First operand 527 states and 553 transitions. Second operand 8 states. [2018-02-02 20:12:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:40,406 INFO L93 Difference]: Finished difference Result 543 states and 567 transitions. [2018-02-02 20:12:40,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:40,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 208 [2018-02-02 20:12:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:40,408 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:12:40,408 INFO L226 Difference]: Without dead ends: 543 [2018-02-02 20:12:40,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:12:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-02 20:12:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 527. [2018-02-02 20:12:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-02-02 20:12:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 551 transitions. [2018-02-02 20:12:40,412 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 551 transitions. Word has length 208 [2018-02-02 20:12:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:40,412 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 551 transitions. [2018-02-02 20:12:40,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:12:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 551 transitions. [2018-02-02 20:12:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-02 20:12:40,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:40,413 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, 1, 1, 1] [2018-02-02 20:12:40,413 INFO L371 AbstractCegarLoop]: === Iteration 57 === [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 20:12:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1262877622, now seen corresponding path program 1 times [2018-02-02 20:12:40,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:40,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:40,486 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 20:12:40,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:40,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:12:40,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:40,487 INFO L182 omatonBuilderFactory]: Interpolants [43920#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 43921#(= 1 (select |#valid| |main_#t~mem55.base|)), 43917#true, 43918#false, 43919#(= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))] [2018-02-02 20:12:40,487 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 20:12:40,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:12:40,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:12:40,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:12:40,488 INFO L87 Difference]: Start difference. First operand 527 states and 551 transitions. Second operand 5 states. [2018-02-02 20:12:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:40,611 INFO L93 Difference]: Finished difference Result 533 states and 557 transitions. [2018-02-02 20:12:40,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:12:40,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2018-02-02 20:12:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:40,614 INFO L225 Difference]: With dead ends: 533 [2018-02-02 20:12:40,614 INFO L226 Difference]: Without dead ends: 533 [2018-02-02 20:12:40,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:12:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-02 20:12:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2018-02-02 20:12:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-02 20:12:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 555 transitions. [2018-02-02 20:12:40,617 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 555 transitions. Word has length 209 [2018-02-02 20:12:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:40,618 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 555 transitions. [2018-02-02 20:12:40,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:12:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 555 transitions. [2018-02-02 20:12:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-02 20:12:40,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:40,619 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, 1, 1, 1] [2018-02-02 20:12:40,619 INFO L371 AbstractCegarLoop]: === Iteration 58 === [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 20:12:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1262877623, now seen corresponding path program 1 times [2018-02-02 20:12:40,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:40,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:41,253 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 20:12:41,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:41,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:12:41,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:41,254 INFO L182 omatonBuilderFactory]: Interpolants [44992#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc34.offset|)), 44993#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 44994#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 44995#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 44996#(and (= |main_#t~mem47.offset| 0) (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 44997#(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|) 0) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 44998#(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|)))), 44999#(and (<= 0 |main_#t~mem55.offset|) (<= (+ |main_#t~mem55.offset| 4) (select |#length| |main_#t~mem55.base|))), 44989#true, 44990#false, 44991#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))] [2018-02-02 20:12:41,254 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 20:12:41,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:12:41,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:12:41,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:12:41,254 INFO L87 Difference]: Start difference. First operand 530 states and 555 transitions. Second operand 11 states. [2018-02-02 20:12:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:41,513 INFO L93 Difference]: Finished difference Result 576 states and 609 transitions. [2018-02-02 20:12:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:12:41,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2018-02-02 20:12:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:41,515 INFO L225 Difference]: With dead ends: 576 [2018-02-02 20:12:41,515 INFO L226 Difference]: Without dead ends: 576 [2018-02-02 20:12:41,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:12:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-02-02 20:12:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 551. [2018-02-02 20:12:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-02-02 20:12:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 581 transitions. [2018-02-02 20:12:41,520 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 581 transitions. Word has length 209 [2018-02-02 20:12:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:41,520 INFO L432 AbstractCegarLoop]: Abstraction has 551 states and 581 transitions. [2018-02-02 20:12:41,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:12:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 581 transitions. [2018-02-02 20:12:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 20:12:41,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:41,522 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:41,522 INFO L371 AbstractCegarLoop]: === Iteration 59 === [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 20:12:41,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1526019633, now seen corresponding path program 1 times [2018-02-02 20:12:41,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:41,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:41,617 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 20:12:41,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:41,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:12:41,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:41,618 INFO L182 omatonBuilderFactory]: Interpolants [46146#true, 46147#false, 46148#(and (= |main_#t~mem49.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 46149#(= |main_#t~mem50.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 46150#(= 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|)))), 46151#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|))), 46152#(= 1 (select |#valid| |main_#t~mem56.base|)), 46153#(= 1 (select |#valid| |freeData_#in~data.base|)), 46154#(= 1 (select |#valid| freeData_~data.base))] [2018-02-02 20:12:41,618 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 20:12:41,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:12:41,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:12:41,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:12:41,619 INFO L87 Difference]: Start difference. First operand 551 states and 581 transitions. Second operand 9 states. [2018-02-02 20:12:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:41,902 INFO L93 Difference]: Finished difference Result 561 states and 595 transitions. [2018-02-02 20:12:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:12:41,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2018-02-02 20:12:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:41,903 INFO L225 Difference]: With dead ends: 561 [2018-02-02 20:12:41,903 INFO L226 Difference]: Without dead ends: 561 [2018-02-02 20:12:41,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:12:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-02 20:12:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 554. [2018-02-02 20:12:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-02-02 20:12:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 586 transitions. [2018-02-02 20:12:41,907 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 586 transitions. Word has length 212 [2018-02-02 20:12:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:41,908 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 586 transitions. [2018-02-02 20:12:41,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:12:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 586 transitions. [2018-02-02 20:12:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 20:12:41,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:41,909 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:41,909 INFO L371 AbstractCegarLoop]: === Iteration 60 === [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 20:12:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1526019632, now seen corresponding path program 1 times [2018-02-02 20:12:41,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:41,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:42,365 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 20:12:42,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:12:42,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 20:12:42,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:42,366 INFO L182 omatonBuilderFactory]: Interpolants [47296#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem50.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem50.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 47297#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))), 47298#(and (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|))), 47299#(and (= 0 |main_#t~mem56.offset|) (<= (+ |main_#t~mem56.offset| 12) (select |#length| |main_#t~mem56.base|))), 47300#(and (= 0 |freeData_#in~data.offset|) (<= (+ |freeData_#in~data.offset| 12) (select |#length| |freeData_#in~data.base|))), 47301#(and (= freeData_~data.offset 0) (<= (+ freeData_~data.offset 12) (select |#length| freeData_~data.base))), 47280#true, 47281#false, 47282#(= (select |#valid| |main_~#list~0.base|) 1), 47283#(= |#valid| |old(#valid)|), 47284#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 47285#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 47286#(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|)))), 47287#(= 0 |create_data_#t~malloc3.offset|), 47288#(= 0 create_data_~data~0.offset), 47289#(= 0 |create_data_#res.offset|), 47290#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret38.offset|)))), 47291#(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))))), 47292#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 47293#(= 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|))), 47294#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 47295#(and (= |main_#t~mem49.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem49.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 20:12:42,366 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 20:12:42,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:12:42,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:12:42,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:12:42,366 INFO L87 Difference]: Start difference. First operand 554 states and 586 transitions. Second operand 22 states. [2018-02-02 20:12:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:43,496 INFO L93 Difference]: Finished difference Result 607 states and 647 transitions. [2018-02-02 20:12:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:12:43,497 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 212 [2018-02-02 20:12:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:43,499 INFO L225 Difference]: With dead ends: 607 [2018-02-02 20:12:43,499 INFO L226 Difference]: Without dead ends: 607 [2018-02-02 20:12:43,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=1702, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:12:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-02-02 20:12:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 585. [2018-02-02 20:12:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-02-02 20:12:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 625 transitions. [2018-02-02 20:12:43,505 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 625 transitions. Word has length 212 [2018-02-02 20:12:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:43,505 INFO L432 AbstractCegarLoop]: Abstraction has 585 states and 625 transitions. [2018-02-02 20:12:43,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:12:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 625 transitions. [2018-02-02 20:12:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-02 20:12:43,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:43,506 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:43,506 INFO L371 AbstractCegarLoop]: === Iteration 61 === [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 20:12:43,506 INFO L82 PathProgramCache]: Analyzing trace with hash -61968161, now seen corresponding path program 1 times [2018-02-02 20:12:43,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:44,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:52,020 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 20:12:52,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:52,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-02-02 20:12:52,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:52,022 INFO L182 omatonBuilderFactory]: Interpolants [48538#true, 48539#false, 48540#(= (select |#valid| |main_~#list~0.base|) 1), 48541#(= |#valid| |old(#valid)|), 48542#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 48543#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 48544#(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|)))), 48545#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) 1)))), 48546#(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|) (= (select |#valid| append_~pointerToList.base) 1) (= (select |#valid| append_~node~0.base) 1)) (= append_~pointerToList.base append_~node~0.base))), 48547#(and (= 1 (select |#valid| |create_data_#t~malloc3.base|)) (= 0 (select |old(#valid)| |create_data_#t~malloc3.base|)) (= 0 |create_data_#t~malloc3.offset|) (= 16 (select |#length| |create_data_#t~malloc3.base|))), 48548#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 48549#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 |create_data_#t~malloc4.offset|) (not (= |create_data_#t~malloc4.base| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 48550#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)) create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 48551#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 create_data_~data~0.offset) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))), 48552#(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 (<= create_data_~counter~0 0) (< 1 create_data_~counter~0) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))))), 48553#(and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= |create_data_#t~mem7.offset| 0) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 0) (< 1 create_data_~counter~0))), 48554#(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 (<= create_data_~counter~0 1) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 3 create_data_~counter~0))), 48555#(and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= |create_data_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (or (<= create_data_~counter~0 1) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 3 create_data_~counter~0))), 48556#(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 (<= create_data_~counter~0 1) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 3 create_data_~counter~0)) (<= 0 (+ (* 4 create_data_~counter~0) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 48557#(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)))) (<= 4 (+ (* 4 create_data_~counter~0) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 4 create_data_~counter~0) (<= create_data_~counter~0 2))), 48558#(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)))) (= |create_data_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 4 (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0))) (or (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 4 create_data_~counter~0) (<= create_data_~counter~0 2))), 48559#(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)))) (<= 8 (+ (* 4 create_data_~counter~0) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (<= 5 create_data_~counter~0) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 3))), 48560#(and (= create_data_~data~0.offset 0) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (or (<= 5 create_data_~counter~0) (and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 3))))), 48561#(and (= create_data_~data~0.offset 0) (or (<= 5 create_data_~counter~0) (and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 3))))), 48562#(and (= create_data_~data~0.offset 0) (or (<= 6 create_data_~counter~0) (and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (or (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 4))))), 48563#(and (= create_data_~data~0.offset 0) (or (and (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 4)) (not (= create_data_~data~0.base |create_data_#t~mem7.base|))) (<= 6 create_data_~counter~0))), 48564#(and (= create_data_~data~0.offset 0) (or (<= 6 create_data_~counter~0) (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 4))), 48565#(and (or (<= 7 create_data_~counter~0) (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 5)) (= create_data_~data~0.offset 0)), 48566#(and (= create_data_~data~0.offset 0) (or (<= 7 create_data_~counter~0) (<= create_data_~counter~0 5) (and (or (and (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= create_data_~data~0.base |create_data_#t~mem7.base|)) (or (<= 16 (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0))) (not (= create_data_~data~0.base |create_data_#t~mem7.base|))) (= 16 (select |#length| create_data_~data~0.base))))), 48567#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 6) (<= 8 create_data_~counter~0))), 48568#(and (or (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)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 6) (<= 8 create_data_~counter~0)) (= create_data_~data~0.offset 0)), 48569#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= 9 create_data_~counter~0) (<= create_data_~counter~0 7))), 48570#(and (or (and (or (and (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= create_data_~data~0.base |create_data_#t~mem7.base|)) (<= 24 (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0))) (= 16 (select |#length| create_data_~data~0.base))) (<= 9 create_data_~counter~0) (<= create_data_~counter~0 7)) (= create_data_~data~0.offset 0)), 48571#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 8) (<= 10 create_data_~counter~0))), 48572#(and (= create_data_~data~0.offset 0) (or (and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 8) (<= 10 create_data_~counter~0))), 48573#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 9) (<= 11 create_data_~counter~0))), 48574#(and (= create_data_~data~0.offset 0) (or (<= create_data_~counter~0 9) (<= 11 create_data_~counter~0) (and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |create_data_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| 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))))), 48575#(and (= create_data_~data~0.offset 0) (or (<= 12 create_data_~counter~0) (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 10))), 48576#(and (= create_data_~data~0.offset 0) (or (<= 12 create_data_~counter~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)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 10))), 48577#(and (= create_data_~data~0.offset 0) (or (<= create_data_~counter~0 11) (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= 13 create_data_~counter~0))), 48578#(and (= create_data_~data~0.offset 0) (or (<= create_data_~counter~0 11) (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)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 13 create_data_~counter~0))), 48579#(and (= create_data_~data~0.offset 0) (or (<= 14 create_data_~counter~0) (<= create_data_~counter~0 12) (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 |old(#valid)| create_data_~data~0.base)) (= 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))))), 48580#(and (= create_data_~data~0.offset 0) (or (and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 |create_data_#t~mem7.offset|) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |create_data_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 14 create_data_~counter~0) (<= create_data_~counter~0 12))), 48581#(and (= create_data_~data~0.offset 0) (or (<= 14 create_data_~counter~0) (<= create_data_~counter~0 12) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))))), 48582#(and (= create_data_~data~0.offset 0) (or (<= 15 create_data_~counter~0) (<= create_data_~counter~0 13) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))))), 48583#(and (= create_data_~data~0.offset 0) (or (<= 15 create_data_~counter~0) (<= create_data_~counter~0 13) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (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))))), 48584#(and (= create_data_~data~0.offset 0) (or (<= 16 create_data_~counter~0) (<= create_data_~counter~0 14) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))))), 48585#(and (= create_data_~data~0.offset 0) (or (<= 16 create_data_~counter~0) (<= create_data_~counter~0 14) (and (or (and (= 0 |create_data_#t~mem7.offset|) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= |create_data_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 60 (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0))) (= 16 (select |#length| create_data_~data~0.base))))), 48586#(and (= create_data_~data~0.offset 0) (or (<= 16 create_data_~counter~0) (<= create_data_~counter~0 14) (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 |old(#valid)| create_data_~data~0.base)) (= 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))))), 48587#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= 17 create_data_~counter~0) (<= create_data_~counter~0 15))), 48588#(and (or (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)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= 17 create_data_~counter~0) (<= create_data_~counter~0 15)) (= create_data_~data~0.offset 0)), 48589#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= 18 create_data_~counter~0) (<= create_data_~counter~0 16))), 48590#(and (= create_data_~data~0.offset 0) (or (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (or (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= |create_data_#t~mem7.offset| 0) (= 16 (select |#length| create_data_~data~0.base))) (<= 18 create_data_~counter~0) (<= create_data_~counter~0 16))), 48591#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 17) (<= 19 create_data_~counter~0))), 48592#(and (= create_data_~data~0.offset 0) (or (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)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))) (<= create_data_~counter~0 17) (<= 19 create_data_~counter~0))), 48593#(and (= create_data_~data~0.offset 0) (or (<= 20 create_data_~counter~0) (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 18))), 48594#(and (= create_data_~data~0.offset 0) (or (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 |old(#valid)| create_data_~data~0.base)) (= 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))) (<= create_data_~counter~0 18))), 48595#(and (= create_data_~data~0.offset 0) (or (<= create_data_~counter~0 18) (and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))))), 48596#(and (= create_data_~data~0.offset 0) (or (<= create_data_~counter~0 18) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))))), 48597#(and (= create_data_~data~0.offset 0) (or (<= create_data_~counter~0 19) (and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))))), 48598#(and (= create_data_~data~0.offset 0) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))), 48599#(and (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |create_data_#res.base|) 4)) (= 16 (select |#length| |create_data_#res.base|)) (= 0 |create_data_#res.offset|)), 48600#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret38.offset|) (= 16 (select |#length| |append_#t~ret38.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret38.offset|)) |append_#t~ret38.base|) 4)) (not (= append_~pointerToList.base |append_#t~ret38.base|))))), 48601#(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))) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4))))), 48602#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)) (= 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|))))), 48603#(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|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))), 48604#(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| (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 48605#(and (= 16 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem49.base|) |main_#t~mem49.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))), 48606#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= (select |#length| |main_#t~mem50.base|) 16)), 48607#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))), 48608#(or (not (= main_~dataNotFinished~0 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)))), 48609#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) |main_#t~short46|), 48610#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|))), 48611#(and (= 0 |main_#t~mem56.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem56.base|) 4))), 48612#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |freeData_#in~data.base|) 4))), 48613#(and (= 0 freeData_~data.offset) (= 0 (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)))), 48614#(= |freeData_#t~mem33.offset| 0)] [2018-02-02 20:12:52,022 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 20:12:52,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-02 20:12:52,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-02 20:12:52,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5589, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 20:12:52,024 INFO L87 Difference]: Start difference. First operand 585 states and 625 transitions. Second operand 77 states. [2018-02-02 20:12:52,866 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 140 DAG size of output 122 [2018-02-02 20:12:53,778 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 152 DAG size of output 126 [2018-02-02 20:12:54,374 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 162 DAG size of output 136 [2018-02-02 20:12:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:12:57,181 INFO L93 Difference]: Finished difference Result 682 states and 739 transitions. [2018-02-02 20:12:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 20:12:57,181 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 213 [2018-02-02 20:12:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:12:57,182 INFO L225 Difference]: With dead ends: 682 [2018-02-02 20:12:57,182 INFO L226 Difference]: Without dead ends: 682 [2018-02-02 20:12:57,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3377 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=993, Invalid=12347, Unknown=0, NotChecked=0, Total=13340 [2018-02-02 20:12:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-02-02 20:12:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 643. [2018-02-02 20:12:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-02-02 20:12:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 700 transitions. [2018-02-02 20:12:57,187 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 700 transitions. Word has length 213 [2018-02-02 20:12:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:12:57,188 INFO L432 AbstractCegarLoop]: Abstraction has 643 states and 700 transitions. [2018-02-02 20:12:57,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-02 20:12:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 700 transitions. [2018-02-02 20:12:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-02 20:12:57,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:12:57,188 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:12:57,188 INFO L371 AbstractCegarLoop]: === Iteration 62 === [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 20:12:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash -61968160, now seen corresponding path program 1 times [2018-02-02 20:12:57,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:12:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:12:57,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 287 proven. 886 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-02-02 20:12:59,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:59,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 20:12:59,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:59,811 INFO L182 omatonBuilderFactory]: Interpolants [50048#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 50049#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 50050#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 50051#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 50052#(and (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 |create_data_#res.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)))), 50053#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret38.offset|) (not (= append_~pointerToList.base |append_#t~ret38.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret38.base|)) |append_#t~ret38.base|) 4)))))), 50054#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))))), 50055#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 50056#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 50057#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem47.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 50058#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem55.base|) |main_#t~mem55.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem55.base|) |main_#t~mem55.offset|)) 4)))), 50059#(and (= 0 |main_#t~mem56.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) 4)))), 50060#(and (= 0 |freeData_#in~data.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4)))), 50061#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (= 0 freeData_~data.offset)), 50062#(= 1 (select |#valid| |freeData_#t~mem33.base|)), 50018#true, 50019#false, 50020#(= (select |#valid| |main_~#list~0.base|) 1), 50021#(= |#valid| |old(#valid)|), 50022#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 50023#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc34.base|))), 50024#(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|)))), 50025#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) 1)))), 50026#(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|) (= (select |#valid| append_~pointerToList.base) 1) (= (select |#valid| append_~node~0.base) 1)) (= append_~pointerToList.base append_~node~0.base))), 50027#(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|))), 50028#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= (select |#valid| create_data_~data~0.base) 1) (= 16 (select |#length| create_data_~data~0.base))), 50029#(and (= 80 (select |#length| |create_data_#t~malloc4.base|)) (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 50030#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 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))), 50031#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 50032#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 50033#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |create_data_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 16 (select |#length| create_data_~data~0.base))), 50034#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 0 (+ (* 4 create_data_~counter~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))), 50035#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 4 (+ (* 4 create_data_~counter~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))), 50036#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 4 (+ (* 4 create_data_~counter~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))), 50037#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (<= 8 (+ (* 4 create_data_~counter~0) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 50038#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 8 (+ (* 4 create_data_~counter~0) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 16 (select |#length| create_data_~data~0.base))), 50039#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 12 (+ (* 4 create_data_~counter~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))), 50040#(and (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 12 (+ (* 4 create_data_~counter~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))), 50041#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 12 (+ (* 4 create_data_~counter~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))), 50042#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (<= 16 (+ (* 4 create_data_~counter~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))), 50043#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (or (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (and (<= 16 (+ |create_data_#t~mem7.offset| (* 4 create_data_~counter~0))) (= 16 (select |#length| create_data_~data~0.base)))) (or (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= create_data_~data~0.base |create_data_#t~mem7.base|))), 50044#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 50045#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base |create_data_#t~mem7.base|)) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 50046#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= |create_data_#t~mem7.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 50047#(and (= 0 create_data_~data~0.offset) (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))))] [2018-02-02 20:12:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 287 proven. 886 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-02-02 20:12:59,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 20:12:59,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 20:12:59,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1823, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:12:59,812 INFO L87 Difference]: Start difference. First operand 643 states and 700 transitions. Second operand 45 states. [2018-02-02 20:13:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:13:02,440 INFO L93 Difference]: Finished difference Result 664 states and 727 transitions. [2018-02-02 20:13:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:13:02,440 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 213 [2018-02-02 20:13:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:13:02,442 INFO L225 Difference]: With dead ends: 664 [2018-02-02 20:13:02,442 INFO L226 Difference]: Without dead ends: 664 [2018-02-02 20:13:02,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 19 SyntacticMatches, 13 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=615, Invalid=5705, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 20:13:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-02-02 20:13:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 650. [2018-02-02 20:13:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-02-02 20:13:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 708 transitions. [2018-02-02 20:13:02,447 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 708 transitions. Word has length 213 [2018-02-02 20:13:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:13:02,448 INFO L432 AbstractCegarLoop]: Abstraction has 650 states and 708 transitions. [2018-02-02 20:13:02,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 20:13:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 708 transitions. [2018-02-02 20:13:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-02 20:13:02,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:13:02,449 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:13:02,449 INFO L371 AbstractCegarLoop]: === Iteration 63 === [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 20:13:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash 341336210, now seen corresponding path program 1 times [2018-02-02 20:13:02,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:13:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:13:02,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:13:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 20:13:02,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:13:02,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:13:02,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:13:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:13:02,640 INFO L182 omatonBuilderFactory]: Interpolants [51456#(or (= append_~node~0.base |append_#t~mem36.base|) (= 1 (select |#valid| |append_#t~mem36.base|))), 51457#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))), 51458#(= (select |#valid| |append_#t~mem40.base|) 1), 51447#true, 51448#false, 51449#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 51450#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 51451#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 51452#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 51453#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))), 51454#(or (= |append_#t~malloc34.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)))), 51455#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset))) (= append_~node~0.base (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)))] [2018-02-02 20:13:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 20:13:02,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:13:02,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:13:02,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:13:02,640 INFO L87 Difference]: Start difference. First operand 650 states and 708 transitions. Second operand 12 states. [2018-02-02 20:13:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:13:02,961 INFO L93 Difference]: Finished difference Result 653 states and 712 transitions. [2018-02-02 20:13:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:13:02,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 213 [2018-02-02 20:13:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:13:02,963 INFO L225 Difference]: With dead ends: 653 [2018-02-02 20:13:02,964 INFO L226 Difference]: Without dead ends: 653 [2018-02-02 20:13:02,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:13:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-02-02 20:13:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2018-02-02 20:13:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-02-02 20:13:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 707 transitions. [2018-02-02 20:13:02,972 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 707 transitions. Word has length 213 [2018-02-02 20:13:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:13:02,972 INFO L432 AbstractCegarLoop]: Abstraction has 649 states and 707 transitions. [2018-02-02 20:13:02,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:13:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 707 transitions. [2018-02-02 20:13:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-02 20:13:02,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:13:02,974 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:13:02,974 INFO L371 AbstractCegarLoop]: === Iteration 64 === [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 20:13:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 341336211, now seen corresponding path program 1 times [2018-02-02 20:13:02,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:13:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:13:03,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:13:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 20:13:03,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:13:03,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:13:03,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:13:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:13:03,753 INFO L182 omatonBuilderFactory]: Interpolants [52773#true, 52774#false, 52775#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 52776#(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|)), 52777#(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))), 52778#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1) (= 8 (select |#length| append_~node~0.base))), 52779#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 52780#(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|)), 52781#(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|))), 52782#(and (or (and (= create_data_~data~0.base (@diff (store |old(#length)| |create_data_#t~malloc4.base| (select |#length| |create_data_#t~malloc4.base|)) |#length|)) (= 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|)), 52783#(= |#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|)))), 52784#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 52785#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 52786#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 52787#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (select |#length| |main_#t~mem49.base|) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 52788#(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|)))), 52789#(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|))), 52790#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)))), 52791#(and (<= 4 (select |#length| |append_#t~mem36.base|)) (= 0 |append_#t~mem36.offset|)), 52792#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)))), 52793#(and (<= 4 (select |#length| |append_#t~mem40.base|)) (= |append_#t~mem40.offset| 0))] [2018-02-02 20:13:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 20:13:03,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:13:03,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:13:03,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:13:03,754 INFO L87 Difference]: Start difference. First operand 649 states and 707 transitions. Second operand 21 states. Received shutdown request... [2018-02-02 20:13:04,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:13:04,688 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:13:04,693 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:13:04,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:13:04 BoogieIcfgContainer [2018-02-02 20:13:04,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:13:04,694 INFO L168 Benchmark]: Toolchain (without parser) took 57561.36 ms. Allocated memory was 401.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 358.3 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 256.8 MB. Max. memory is 5.3 GB. [2018-02-02 20:13:04,695 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:13:04,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.86 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 346.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:13:04,695 INFO L168 Benchmark]: Boogie Preprocessor took 42.64 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:13:04,696 INFO L168 Benchmark]: RCFGBuilder took 508.14 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 292.1 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:13:04,696 INFO L168 Benchmark]: TraceAbstraction took 56827.48 ms. Allocated memory was 401.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 292.1 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 190.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:13:04,697 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.18 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.86 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 346.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.64 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 508.14 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 292.1 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56827.48 ms. Allocated memory was 401.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 292.1 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 190.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (649states) and interpolant automaton (currently 28 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (283 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 213 locations, 91 error locations. TIMEOUT Result, 56.7s OverallTime, 64 OverallIterations, 21 TraceHistogramMax, 26.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9567 SDtfs, 7696 SDslu, 49387 SDs, 0 SdLazy, 28292 SolverSat, 1084 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1181 GetRequests, 173 SyntacticMatches, 51 SemanticMatches, 957 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7128 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 36566/48130 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 63 MinimizatonAttempts, 748 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 8378 NumberOfCodeBlocks, 8378 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8314 ConstructedInterpolants, 0 QuantifiedInterpolants, 37439736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 37 PerfectInterpolantSequences, 36566/48130 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_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-13-04-702.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-13-04-702.csv Completed graceful shutdown