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/test-0232_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:04:16,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:04:16,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:04:16,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:04:16,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:04:16,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:04:16,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:04:16,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:04:16,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:04:16,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:04:16,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:04:16,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:04:16,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:04:16,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:04:16,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:04:16,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:04:16,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:04:16,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:04:16,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:04:16,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:04:16,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:04:16,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:04:16,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:04:17,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:04:17,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:04:17,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:04:17,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:04:17,003 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:04:17,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:04:17,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:04:17,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:04:17,004 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-04 02:04:17,014 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:04:17,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:04:17,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:04:17,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:04:17,015 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:04:17,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:04:17,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:04:17,016 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:04:17,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:04:17,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:04:17,016 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:04:17,016 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:04:17,017 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:04:17,017 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:04:17,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:04:17,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:04:17,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:04:17,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:04:17,018 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:04:17,018 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:04:17,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:04:17,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:04:17,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:04:17,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:04:17,055 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:04:17,058 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:04:17,059 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:04:17,060 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:04:17,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-02-04 02:04:17,191 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:04:17,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:04:17,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:04:17,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:04:17,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:04:17,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbafac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17, skipping insertion in model container [2018-02-04 02:04:17,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,215 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:04:17,241 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:04:17,328 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:04:17,340 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:04:17,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17 WrapperNode [2018-02-04 02:04:17,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:04:17,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:04:17,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:04:17,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:04:17,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... [2018-02-04 02:04:17,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:04:17,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:04:17,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:04:17,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:04:17,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:04:17,408 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:04:17,408 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:04:17,409 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 02:04:17,409 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 02:04:17,409 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:04:17,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:04:17,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:04:17,639 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:04:17,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:04:17 BoogieIcfgContainer [2018-02-04 02:04:17,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:04:17,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:04:17,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:04:17,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:04:17,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:04:17" (1/3) ... [2018-02-04 02:04:17,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b2cbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:04:17, skipping insertion in model container [2018-02-04 02:04:17,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:17" (2/3) ... [2018-02-04 02:04:17,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b2cbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:04:17, skipping insertion in model container [2018-02-04 02:04:17,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:04:17" (3/3) ... [2018-02-04 02:04:17,645 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-02-04 02:04:17,653 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:04:17,658 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-04 02:04:17,689 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:04:17,689 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:04:17,690 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:04:17,690 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:04:17,690 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:04:17,690 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:04:17,690 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:04:17,690 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:04:17,691 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:04:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-02-04 02:04:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 02:04:17,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:17,712 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:17,712 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -758648706, now seen corresponding path program 1 times [2018-02-04 02:04:17,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:17,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:17,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:17,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:04:17,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:17,849 INFO L182 omatonBuilderFactory]: Interpolants [99#true, 100#false, 101#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-04 02:04:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:17,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:04:17,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:04:17,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:04:17,860 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2018-02-04 02:04:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:18,028 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 02:04:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:04:18,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 02:04:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:18,039 INFO L225 Difference]: With dead ends: 92 [2018-02-04 02:04:18,039 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 02:04:18,040 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-04 02:04:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 02:04:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-04 02:04:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 02:04:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-02-04 02:04:18,075 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 7 [2018-02-04 02:04:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:18,075 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-02-04 02:04:18,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:04:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-02-04 02:04:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 02:04:18,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:18,076 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:18,076 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:18,076 INFO L82 PathProgramCache]: Analyzing trace with hash -758648705, now seen corresponding path program 1 times [2018-02-04 02:04:18,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:18,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:18,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:04:18,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,123 INFO L182 omatonBuilderFactory]: Interpolants [281#true, 282#false, 283#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0))] [2018-02-04 02:04:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:04:18,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:04:18,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:04:18,125 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 3 states. [2018-02-04 02:04:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:18,172 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-02-04 02:04:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:04:18,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 02:04:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:18,173 INFO L225 Difference]: With dead ends: 88 [2018-02-04 02:04:18,173 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 02:04:18,173 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-04 02:04:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 02:04:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-02-04 02:04:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 02:04:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-04 02:04:18,181 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 7 [2018-02-04 02:04:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:18,181 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-04 02:04:18,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:04:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-04 02:04:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:04:18,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:18,181 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:18,182 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash 689934579, now seen corresponding path program 1 times [2018-02-04 02:04:18,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:18,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:18,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:04:18,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,269 INFO L182 omatonBuilderFactory]: Interpolants [458#true, 459#false, 460#(= 1 (select |#valid| |main_~#list~0.base|)), 461#(= 1 (select |#valid| |append_#in~plist.base|)), 462#(= (select |#valid| append_~plist.base) 1)] [2018-02-04 02:04:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:04:18,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:04:18,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:04:18,269 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 5 states. [2018-02-04 02:04:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:18,369 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-02-04 02:04:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:04:18,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 02:04:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:18,371 INFO L225 Difference]: With dead ends: 83 [2018-02-04 02:04:18,371 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 02:04:18,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04 02:04:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 02:04:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 02:04:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 02:04:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-04 02:04:18,375 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 13 [2018-02-04 02:04:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:18,375 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-04 02:04:18,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:04:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-04 02:04:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:04:18,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:18,375 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:18,375 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash 689934580, now seen corresponding path program 1 times [2018-02-04 02:04:18,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:18,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:18,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:04:18,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,484 INFO L182 omatonBuilderFactory]: Interpolants [631#true, 632#false, 633#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 634#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4) (= (select |#valid| |main_~#list~0.base|) 1)), 635#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|)), 636#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 637#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)))] [2018-02-04 02:04:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:04:18,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:04:18,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:04:18,485 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 7 states. [2018-02-04 02:04:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:18,668 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-04 02:04:18,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:04:18,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-04 02:04:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:18,669 INFO L225 Difference]: With dead ends: 113 [2018-02-04 02:04:18,669 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 02:04:18,669 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-04 02:04:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 02:04:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2018-02-04 02:04:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 02:04:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-02-04 02:04:18,673 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 13 [2018-02-04 02:04:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:18,673 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-02-04 02:04:18,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:04:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-02-04 02:04:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:04:18,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:18,674 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:18,674 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash -86864468, now seen corresponding path program 1 times [2018-02-04 02:04:18,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:18,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:18,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:04:18,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:18,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-04 02:04:18,709 INFO L182 omatonBuilderFactory]: Interpolants [856#true, 857#false, 858#(= 1 (select |#valid| |append_#t~malloc0.base|)), 859#(= 1 (select |#valid| append_~item~0.base))] [2018-02-04 02:04:18,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-04 02:04:18,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:04:18,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:04:18,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:04:18,710 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 4 states. [2018-02-04 02:04:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:18,761 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-02-04 02:04:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:04:18,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:04:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:18,761 INFO L225 Difference]: With dead ends: 99 [2018-02-04 02:04:18,762 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 02:04:18,762 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-04 02:04:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 02:04:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-04 02:04:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 02:04:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 02:04:18,768 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 14 [2018-02-04 02:04:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:18,768 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 02:04:18,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:04:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 02:04:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:04:18,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:18,769 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:18,769 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash -86864467, now seen corresponding path program 1 times [2018-02-04 02:04:18,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:18,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:18,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:04:18,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,808 INFO L182 omatonBuilderFactory]: Interpolants [1060#true, 1061#false, 1062#(and (= 8 (select |#length| |append_#t~malloc0.base|)) (= 0 |append_#t~malloc0.offset|)), 1063#(and (= (select |#length| append_~item~0.base) 8) (= append_~item~0.offset 0))] [2018-02-04 02:04:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:04:18,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:04:18,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:04:18,809 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-02-04 02:04:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:18,851 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-02-04 02:04:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:04:18,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:04:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:18,852 INFO L225 Difference]: With dead ends: 95 [2018-02-04 02:04:18,852 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 02:04:18,852 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-04 02:04:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 02:04:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 02:04:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 02:04:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-02-04 02:04:18,856 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 14 [2018-02-04 02:04:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:18,856 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-02-04 02:04:18,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:04:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-02-04 02:04:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 02:04:18,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:18,861 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:18,861 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1124026018, now seen corresponding path program 1 times [2018-02-04 02:04:18,862 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:18,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:18,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:04:18,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,927 INFO L182 omatonBuilderFactory]: Interpolants [1256#true, 1257#false, 1258#(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|))), 1259#(and (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 1260#(and (= 0 (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 1261#(and (= 0 |append_#t~mem2.base|) (= 0 |append_#t~mem2.offset|)), 1262#(and (= 0 (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 1263#(and (= |append_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)))] [2018-02-04 02:04:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:18,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:04:18,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:04:18,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:04:18,928 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 8 states. [2018-02-04 02:04:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:19,042 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-04 02:04:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:04:19,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 02:04:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:19,043 INFO L225 Difference]: With dead ends: 92 [2018-02-04 02:04:19,043 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 02:04:19,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:04:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 02:04:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 02:04:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 02:04:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-04 02:04:19,046 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 19 [2018-02-04 02:04:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:19,046 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-04 02:04:19,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:04:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-04 02:04:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:04:19,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:19,047 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] [2018-02-04 02:04:19,047 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash -858054687, now seen corresponding path program 1 times [2018-02-04 02:04:19,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:19,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:19,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:04:19,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,162 INFO L182 omatonBuilderFactory]: Interpolants [1458#true, 1459#false, 1460#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 1461#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset))), 1462#(or (<= 4 (select |#length| |append_#in~plist.base|)) (not (= |append_#in~plist.offset| 0))), 1463#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|)))] [2018-02-04 02:04:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:04:19,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:04:19,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:04:19,163 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 6 states. [2018-02-04 02:04:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:19,258 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-04 02:04:19,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:04:19,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 02:04:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:19,259 INFO L225 Difference]: With dead ends: 95 [2018-02-04 02:04:19,259 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 02:04:19,259 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-04 02:04:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 02:04:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-04 02:04:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 02:04:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 02:04:19,263 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 27 [2018-02-04 02:04:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:19,264 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 02:04:19,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:04:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 02:04:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 02:04:19,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:19,265 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:19,265 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134626, now seen corresponding path program 1 times [2018-02-04 02:04:19,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:19,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:19,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:04:19,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,320 INFO L182 omatonBuilderFactory]: Interpolants [1649#true, 1650#false, 1651#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 1652#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 1653#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 1654#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 1655#(= 1 (select |#valid| |main_#t~mem12.base|))] [2018-02-04 02:04:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:04:19,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:04:19,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:04:19,320 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 7 states. [2018-02-04 02:04:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:19,422 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-02-04 02:04:19,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:04:19,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 02:04:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:19,429 INFO L225 Difference]: With dead ends: 101 [2018-02-04 02:04:19,429 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 02:04:19,430 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-04 02:04:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 02:04:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-02-04 02:04:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 02:04:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-04 02:04:19,433 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 30 [2018-02-04 02:04:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:19,434 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-04 02:04:19,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:04:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-04 02:04:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 02:04:19,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:19,435 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:19,435 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134627, now seen corresponding path program 1 times [2018-02-04 02:04:19,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:19,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:19,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:04:19,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:19,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-04 02:04:19,559 INFO L182 omatonBuilderFactory]: Interpolants [1856#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 1857#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 1858#(and (= |main_#t~mem12.offset| 0) (<= 8 (select |#length| |main_#t~mem12.base|))), 1850#true, 1851#false, 1852#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 1853#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 1854#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 1855#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (<= (+ append_~item~0.offset 8) (select |#length| append_~item~0.base)))] [2018-02-04 02:04:19,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-04 02:04:19,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:04:19,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:04:19,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:04:19,560 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 9 states. [2018-02-04 02:04:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:19,733 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-02-04 02:04:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:04:19,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-04 02:04:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:19,734 INFO L225 Difference]: With dead ends: 104 [2018-02-04 02:04:19,734 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 02:04:19,734 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-04 02:04:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 02:04:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2018-02-04 02:04:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 02:04:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-02-04 02:04:19,736 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 30 [2018-02-04 02:04:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:19,736 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-02-04 02:04:19,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:04:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-02-04 02:04:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 02:04:19,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:19,737 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:19,737 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1019097774, now seen corresponding path program 1 times [2018-02-04 02:04:19,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:19,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:19,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:04:19,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,818 INFO L182 omatonBuilderFactory]: Interpolants [2064#false, 2065#(= 0 |main_~#list~0.offset|), 2066#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset))), 2067#(and (or (<= 4 (select |#length| |append_#in~plist.base|)) (not (= |append_#in~plist.offset| 0))) (= (select |#valid| |append_#in~plist.base|) 1)), 2068#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 2069#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|)), 2070#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 2071#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base))), 2063#true] [2018-02-04 02:04:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:19,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:04:19,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:04:19,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:04:19,819 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 9 states. [2018-02-04 02:04:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:19,915 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-04 02:04:19,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:04:19,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 02:04:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:19,919 INFO L225 Difference]: With dead ends: 83 [2018-02-04 02:04:19,919 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 02:04:19,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:04:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 02:04:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-02-04 02:04:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 02:04:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-04 02:04:19,923 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 32 [2018-02-04 02:04:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:19,923 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-04 02:04:19,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:04:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-04 02:04:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:04:19,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:19,925 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:19,929 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:19,929 INFO L82 PathProgramCache]: Analyzing trace with hash -952870546, now seen corresponding path program 1 times [2018-02-04 02:04:19,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:19,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:20,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:04:20,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,011 INFO L182 omatonBuilderFactory]: Interpolants [2240#(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|))), 2241#(and (= 0 |main_#t~mem20.offset|) (= |main_#t~mem20.base| 0)), 2237#true, 2238#false, 2239#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem11.offset|))] [2018-02-04 02:04:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:04:20,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:04:20,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:04:20,011 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 5 states. [2018-02-04 02:04:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:20,081 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-02-04 02:04:20,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:04:20,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 02:04:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:20,082 INFO L225 Difference]: With dead ends: 86 [2018-02-04 02:04:20,082 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 02:04:20,083 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:04:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 02:04:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-02-04 02:04:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 02:04:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-04 02:04:20,085 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 33 [2018-02-04 02:04:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:20,086 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-04 02:04:20,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:04:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-04 02:04:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:04:20,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:20,087 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:20,087 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792313, now seen corresponding path program 1 times [2018-02-04 02:04:20,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:20,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:20,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:04:20,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,145 INFO L182 omatonBuilderFactory]: Interpolants [2416#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 2417#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 2418#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 2419#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 2420#(= |main_#t~mem14.offset| 0), 2413#true, 2414#false, 2415#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|))] [2018-02-04 02:04:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:04:20,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:04:20,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:04:20,146 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 8 states. [2018-02-04 02:04:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:20,249 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-02-04 02:04:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:04:20,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 02:04:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:20,250 INFO L225 Difference]: With dead ends: 85 [2018-02-04 02:04:20,250 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 02:04:20,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:04:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 02:04:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-02-04 02:04:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 02:04:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-02-04 02:04:20,253 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 33 [2018-02-04 02:04:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:20,253 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-02-04 02:04:20,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:04:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-02-04 02:04:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:04:20,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:20,254 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:20,255 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792312, now seen corresponding path program 1 times [2018-02-04 02:04:20,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:20,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:20,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:04:20,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,292 INFO L182 omatonBuilderFactory]: Interpolants [2598#true, 2599#false, 2600#(= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 2601#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 2602#(= 1 (select |#valid| |main_#t~mem14.base|))] [2018-02-04 02:04:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:04:20,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:04:20,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:04:20,293 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-02-04 02:04:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:20,346 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-02-04 02:04:20,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:04:20,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 02:04:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:20,347 INFO L225 Difference]: With dead ends: 81 [2018-02-04 02:04:20,347 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 02:04:20,347 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-04 02:04:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 02:04:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 02:04:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 02:04:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-02-04 02:04:20,350 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 33 [2018-02-04 02:04:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:20,350 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-02-04 02:04:20,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:04:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-02-04 02:04:20,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:04:20,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:20,351 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:20,351 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash -881792853, now seen corresponding path program 1 times [2018-02-04 02:04:20,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:20,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:20,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:04:20,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,418 INFO L182 omatonBuilderFactory]: Interpolants [2769#true, 2770#false, 2771#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 2772#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 2773#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 2774#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 2775#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 2776#(not (= 0 |main_#t~mem11.base|))] [2018-02-04 02:04:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:04:20,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:04:20,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:04:20,419 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 8 states. [2018-02-04 02:04:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:20,545 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-02-04 02:04:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:04:20,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 02:04:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:20,546 INFO L225 Difference]: With dead ends: 78 [2018-02-04 02:04:20,546 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 02:04:20,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:04:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 02:04:20,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 02:04:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 02:04:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 02:04:20,548 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 35 [2018-02-04 02:04:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:20,549 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 02:04:20,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:04:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 02:04:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:04:20,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:20,550 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:20,550 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1690468264, now seen corresponding path program 1 times [2018-02-04 02:04:20,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:20,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:20,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 02:04:20,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,683 INFO L182 omatonBuilderFactory]: Interpolants [2944#false, 2945#(= 1 (select |#valid| |main_~#list~0.base|)), 2946#(= |#valid| |old(#valid)|), 2947#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 2948#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 2949#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 2950#(and (= 1 (select |#valid| |append_#in~plist.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)))), 2951#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| |main_~#list~0.base|))), 2952#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| |main_~#list~0.base|))), 2953#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| |main_~#list~0.base|))), 2954#(and (or (not (= |main_#t~mem14.base| 0)) (not (= |main_#t~mem14.offset| 0))) (= 1 (select (store |#valid| |main_#t~mem14.base| 0) |main_~#list~0.base|))), 2943#true] [2018-02-04 02:04:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:20,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:04:20,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:04:20,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:04:20,684 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 12 states. [2018-02-04 02:04:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:20,863 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-02-04 02:04:20,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:04:20,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 02:04:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:20,864 INFO L225 Difference]: With dead ends: 77 [2018-02-04 02:04:20,864 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 02:04:20,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:04:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 02:04:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 02:04:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 02:04:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-02-04 02:04:20,866 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 35 [2018-02-04 02:04:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:20,866 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-02-04 02:04:20,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:04:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-02-04 02:04:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:04:20,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:20,869 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:20,869 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash 403683132, now seen corresponding path program 1 times [2018-02-04 02:04:20,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:20,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:21,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:21,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:04:21,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:21,013 INFO L182 omatonBuilderFactory]: Interpolants [3115#true, 3116#false, 3117#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 3118#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 3119#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 3120#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 3121#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 3122#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= |append_#t~malloc0.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 3123#(or (= append_~item~0.base (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)))), 3124#(or (= append_~item~0.base |append_#t~mem2.base|) (= 1 (select |#valid| |append_#t~mem2.base|))), 3125#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))) (= (select |#valid| append_~item~0.base) 1)), 3126#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))), 3127#(= (select |#valid| |append_#t~mem4.base|) 1)] [2018-02-04 02:04:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:21,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:04:21,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:04:21,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:04:21,014 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 13 states. [2018-02-04 02:04:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:21,328 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-02-04 02:04:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:04:21,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 02:04:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:21,328 INFO L225 Difference]: With dead ends: 78 [2018-02-04 02:04:21,328 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 02:04:21,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:04:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 02:04:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-04 02:04:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 02:04:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-02-04 02:04:21,330 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 38 [2018-02-04 02:04:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:21,331 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-02-04 02:04:21,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:04:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-02-04 02:04:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:04:21,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:21,332 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:21,332 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 403683133, now seen corresponding path program 1 times [2018-02-04 02:04:21,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:21,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:21,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:21,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:04:21,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:21,515 INFO L182 omatonBuilderFactory]: Interpolants [3298#true, 3299#false, 3300#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 3301#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 3302#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 3303#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (<= (+ append_~item~0.offset 8) (select |#length| append_~item~0.base))), 3304#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 3305#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 3306#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 3307#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 3308#(and (<= 8 (select |#length| |append_#t~mem2.base|)) (= 0 |append_#t~mem2.offset|)), 3309#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)))), 3310#(and (<= 8 (select |#length| |append_#t~mem4.base|)) (= |append_#t~mem4.offset| 0))] [2018-02-04 02:04:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:21,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:04:21,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:04:21,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:04:21,516 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 13 states. [2018-02-04 02:04:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:21,876 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-02-04 02:04:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:04:21,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 02:04:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:21,877 INFO L225 Difference]: With dead ends: 77 [2018-02-04 02:04:21,877 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 02:04:21,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:04:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 02:04:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 02:04:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 02:04:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-02-04 02:04:21,879 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 38 [2018-02-04 02:04:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:21,880 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-02-04 02:04:21,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:04:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-02-04 02:04:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 02:04:21,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:21,880 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:21,881 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash 467955640, now seen corresponding path program 1 times [2018-02-04 02:04:21,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:21,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:22,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:22,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 02:04:22,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:22,321 INFO L182 omatonBuilderFactory]: Interpolants [3489#true, 3490#false, 3491#(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|))), 3492#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3493#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3494#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3495#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 3496#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= (select (select |#memory_$Pointer$.base| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)))), 3497#(and (or (= append_~plist.base append_~item~0.base) (and (= (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= append_~plist.base |append_#in~plist.base|) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)))), 3498#(or (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0) (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0)))), 3499#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 3500#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 3501#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 3502#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 3503#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (or (and (= 0 |main_#t~mem13.offset|) (= 0 |main_#t~mem13.base|)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 3504#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 3505#(and (or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 |main_#t~mem14.offset|))) (or (not (= |main_#t~mem14.base| 0)) (not (= |main_#t~mem14.offset| 0)))), 3506#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 3507#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem20.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem20.base| 0))] [2018-02-04 02:04:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:22,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:04:22,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:04:22,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:04:22,322 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-02-04 02:04:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:22,838 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-04 02:04:22,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:04:22,839 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-02-04 02:04:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:22,839 INFO L225 Difference]: With dead ends: 94 [2018-02-04 02:04:22,839 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 02:04:22,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:04:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 02:04:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-02-04 02:04:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 02:04:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-02-04 02:04:22,842 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 40 [2018-02-04 02:04:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:22,844 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-02-04 02:04:22,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:04:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-02-04 02:04:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:04:22,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:22,845 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:22,845 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:04:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1267428235, now seen corresponding path program 1 times [2018-02-04 02:04:22,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:04:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:04:22,892 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:04:22,905 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 02:04:22,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:04:22 BoogieIcfgContainer [2018-02-04 02:04:22,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:04:22,920 INFO L168 Benchmark]: Toolchain (without parser) took 5728.82 ms. Allocated memory was 408.9 MB in the beginning and 760.7 MB in the end (delta: 351.8 MB). Free memory was 365.8 MB in the beginning and 704.0 MB in the end (delta: -338.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:22,921 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 408.9 MB. Free memory is still 372.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:04:22,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.37 ms. Allocated memory is still 408.9 MB. Free memory was 365.8 MB in the beginning and 355.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:22,922 INFO L168 Benchmark]: Boogie Preprocessor took 25.09 ms. Allocated memory is still 408.9 MB. Free memory was 355.3 MB in the beginning and 353.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:22,922 INFO L168 Benchmark]: RCFGBuilder took 269.69 ms. Allocated memory is still 408.9 MB. Free memory was 353.9 MB in the beginning and 325.3 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:22,922 INFO L168 Benchmark]: TraceAbstraction took 5279.01 ms. Allocated memory was 408.9 MB in the beginning and 760.7 MB in the end (delta: 351.8 MB). Free memory was 325.3 MB in the beginning and 704.0 MB in the end (delta: -378.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:04:22,923 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 408.9 MB. Free memory is still 372.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.37 ms. Allocated memory is still 408.9 MB. Free memory was 365.8 MB in the beginning and 355.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.09 ms. Allocated memory is still 408.9 MB. Free memory was 355.3 MB in the beginning and 353.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 269.69 ms. Allocated memory is still 408.9 MB. Free memory was 353.9 MB in the beginning and 325.3 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5279.01 ms. Allocated memory was 408.9 MB in the beginning and 760.7 MB in the end (delta: 351.8 MB). Free memory was 325.3 MB in the beginning and 704.0 MB in the end (delta: -378.7 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] EXPR, FCALL item->next VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] RET, FCALL *plist = item VAL [item={11:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L640] EXPR, FCALL list->next VAL [\read(*list)={11:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L641] FCALL free(list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L642] FCALL list = next VAL [list={10:0}, next={0:0}] [L644] FCALL \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; VAL [\result=0, list={10:0}, next={0:0}] [L635] FCALL struct item *list = ((void *)0); VAL [\result=0, list={10:0}, next={0:0}] [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 41 error locations. UNSAFE Result, 5.2s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1056 SDtfs, 949 SDslu, 2878 SDs, 0 SdLazy, 2977 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 9/26 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 71 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 133677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 9/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-04-22-929.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-04-22-929.csv Received shutdown request...