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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:14:20,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:14:20,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:14:20,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:14:20,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:14:20,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:14:20,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:14:20,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:14:20,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:14:20,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:14:20,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:14:20,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:14:20,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:14:20,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:14:20,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:14:20,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:14:20,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:14:20,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:14:20,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:14:20,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:14:20,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:14:20,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:14:20,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:14:20,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:14:20,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:14:20,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:14:20,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:14:20,394 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:14:20,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:14:20,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:14:20,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:14:20,395 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:14:20,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:14:20,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:14:20,405 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:14:20,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:14:20,405 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:14:20,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:14:20,406 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:14:20,406 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:14:20,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:14:20,406 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:14:20,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:14:20,406 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:14:20,407 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:14:20,407 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:14:20,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:14:20,407 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:14:20,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:14:20,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:14:20,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:14:20,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:14:20,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:14:20,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:14:20,408 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:14:20,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:14:20,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:14:20,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:14:20,441 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:14:20,444 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:14:20,445 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:14:20,445 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:14:20,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-02-03 23:14:20,585 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:14:20,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:14:20,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:14:20,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:14:20,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:14:20,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d59df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20, skipping insertion in model container [2018-02-03 23:14:20,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,610 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:14:20,638 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:14:20,733 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:14:20,748 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:14:20,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20 WrapperNode [2018-02-03 23:14:20,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:14:20,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:14:20,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:14:20,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:14:20,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (1/1) ... [2018-02-03 23:14:20,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:14:20,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:14:20,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:14:20,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:14:20,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (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-03 23:14:20,814 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:14:20,814 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:14:20,814 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-03 23:14:20,814 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-02-03 23:14:20,815 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-02-03 23:14:20,815 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-02-03 23:14:20,815 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-02-03 23:14:20,815 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-02-03 23:14:20,815 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-02-03 23:14:20,815 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-02-03 23:14:20,815 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:14:20,815 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 23:14:20,815 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 23:14:20,815 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:14:20,815 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:14:20,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:14:20,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:14:20,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:14:20,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:14:21,121 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:14:21,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:14:21 BoogieIcfgContainer [2018-02-03 23:14:21,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:14:21,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:14:21,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:14:21,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:14:21,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:14:20" (1/3) ... [2018-02-03 23:14:21,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785e328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:14:21, skipping insertion in model container [2018-02-03 23:14:21,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:20" (2/3) ... [2018-02-03 23:14:21,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785e328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:14:21, skipping insertion in model container [2018-02-03 23:14:21,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:14:21" (3/3) ... [2018-02-03 23:14:21,128 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-02-03 23:14:21,134 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:14:21,140 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-03 23:14:21,163 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:14:21,163 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:14:21,163 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:14:21,163 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:14:21,163 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:14:21,163 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:14:21,163 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:14:21,164 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:14:21,164 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:14:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-02-03 23:14:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-03 23:14:21,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:21,182 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:21,182 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-02-03 23:14:21,186 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:21,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:21,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,220 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:21,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:21,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:21,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:21,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:14:21,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:14:21,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:14:21,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:14:21,310 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-02-03 23:14:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:21,456 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-03 23:14:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:14:21,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-03 23:14:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:21,463 INFO L225 Difference]: With dead ends: 117 [2018-02-03 23:14:21,463 INFO L226 Difference]: Without dead ends: 114 [2018-02-03 23:14:21,464 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-03 23:14:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-03 23:14:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-03 23:14:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-03 23:14:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-03 23:14:21,494 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-02-03 23:14:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:21,494 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-03 23:14:21,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:14:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-03 23:14:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-03 23:14:21,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:21,495 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:21,495 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-02-03 23:14:21,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:21,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:21,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:21,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:21,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:21,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:21,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:14:21,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:14:21,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:14:21,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:14:21,546 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-02-03 23:14:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:21,644 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-02-03 23:14:21,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:14:21,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-03 23:14:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:21,646 INFO L225 Difference]: With dead ends: 112 [2018-02-03 23:14:21,647 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 23:14:21,647 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-03 23:14:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 23:14:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-03 23:14:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-03 23:14:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-03 23:14:21,655 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-02-03 23:14:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:21,656 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-03 23:14:21,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:14:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-03 23:14:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:14:21,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:21,656 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-03 23:14:21,657 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-02-03 23:14:21,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:21,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:21,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,658 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:21,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:21,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:21,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:21,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:14:21,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:14:21,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:14:21,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:14:21,723 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-02-03 23:14:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:21,863 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-03 23:14:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:14:21,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-03 23:14:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:21,866 INFO L225 Difference]: With dead ends: 120 [2018-02-03 23:14:21,866 INFO L226 Difference]: Without dead ends: 120 [2018-02-03 23:14:21,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:14:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-03 23:14:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-02-03 23:14:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-03 23:14:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-03 23:14:21,880 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-02-03 23:14:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:21,880 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-03 23:14:21,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:14:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-03 23:14:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:14:21,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:21,881 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:21,881 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-02-03 23:14:21,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:21,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:21,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:21,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:21,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:21,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:21,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:14:21,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:14:21,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:14:21,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:14:21,995 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-02-03 23:14:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:22,111 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-02-03 23:14:22,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:14:22,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-03 23:14:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:22,112 INFO L225 Difference]: With dead ends: 116 [2018-02-03 23:14:22,112 INFO L226 Difference]: Without dead ends: 116 [2018-02-03 23:14:22,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:14:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-03 23:14:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-03 23:14:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-03 23:14:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-03 23:14:22,118 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-02-03 23:14:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:22,118 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-03 23:14:22,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:14:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-03 23:14:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:14:22,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:22,119 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-03 23:14:22,119 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-02-03 23:14:22,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:22,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:22,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:22,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:22,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:22,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:22,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:14:22,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:14:22,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:14:22,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:14:22,181 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-02-03 23:14:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:22,254 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-03 23:14:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:14:22,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-03 23:14:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:22,255 INFO L225 Difference]: With dead ends: 113 [2018-02-03 23:14:22,255 INFO L226 Difference]: Without dead ends: 113 [2018-02-03 23:14:22,256 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-03 23:14:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-03 23:14:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-03 23:14:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-03 23:14:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-03 23:14:22,260 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-02-03 23:14:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:22,260 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-03 23:14:22,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:14:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-03 23:14:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:14:22,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:22,261 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-03 23:14:22,261 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-02-03 23:14:22,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:22,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:22,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:22,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:22,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:22,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:22,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:14:22,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:14:22,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:14:22,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:14:22,323 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-02-03 23:14:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:22,365 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-02-03 23:14:22,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:14:22,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-03 23:14:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:22,366 INFO L225 Difference]: With dead ends: 112 [2018-02-03 23:14:22,366 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 23:14:22,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:14:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 23:14:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-03 23:14:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-03 23:14:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-03 23:14:22,371 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-02-03 23:14:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:22,371 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-03 23:14:22,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:14:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-03 23:14:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:14:22,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:22,372 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-03 23:14:22,372 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-02-03 23:14:22,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:22,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:22,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,373 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:22,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:22,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:22,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:22,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:14:22,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:14:22,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:14:22,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:14:22,473 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 9 states. [2018-02-03 23:14:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:22,743 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-03 23:14:22,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:14:22,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-03 23:14:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:22,748 INFO L225 Difference]: With dead ends: 119 [2018-02-03 23:14:22,748 INFO L226 Difference]: Without dead ends: 119 [2018-02-03 23:14:22,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:14:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-03 23:14:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-02-03 23:14:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-03 23:14:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-02-03 23:14:22,754 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 30 [2018-02-03 23:14:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:22,754 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-02-03 23:14:22,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:14:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-02-03 23:14:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:14:22,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:22,755 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-03 23:14:22,755 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036197, now seen corresponding path program 1 times [2018-02-03 23:14:22,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:22,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:22,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:22,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:22,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:22,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:22,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 23:14:22,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:14:22,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:14:22,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:14:22,943 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 11 states. [2018-02-03 23:14:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:23,236 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-02-03 23:14:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:14:23,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-03 23:14:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:23,237 INFO L225 Difference]: With dead ends: 140 [2018-02-03 23:14:23,237 INFO L226 Difference]: Without dead ends: 140 [2018-02-03 23:14:23,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:14:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-03 23:14:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-02-03 23:14:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-03 23:14:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-02-03 23:14:23,240 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 30 [2018-02-03 23:14:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:23,240 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-02-03 23:14:23,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:14:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-02-03 23:14:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:14:23,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:23,241 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-03 23:14:23,241 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash 98146345, now seen corresponding path program 1 times [2018-02-03 23:14:23,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:23,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:23,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:23,242 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:23,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:23,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:23,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:23,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:14:23,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:14:23,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:14:23,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:14:23,323 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-02-03 23:14:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:23,418 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-02-03 23:14:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:14:23,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-03 23:14:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:23,420 INFO L225 Difference]: With dead ends: 137 [2018-02-03 23:14:23,420 INFO L226 Difference]: Without dead ends: 137 [2018-02-03 23:14:23,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:14:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-03 23:14:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-03 23:14:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-03 23:14:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-02-03 23:14:23,425 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 33 [2018-02-03 23:14:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:23,425 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-02-03 23:14:23,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:14:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-02-03 23:14:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:14:23,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:23,426 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-03 23:14:23,427 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:23,427 INFO L82 PathProgramCache]: Analyzing trace with hash 98146346, now seen corresponding path program 1 times [2018-02-03 23:14:23,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:23,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:23,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:23,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:23,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:23,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:23,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:23,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 23:14:23,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 23:14:23,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 23:14:23,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:14:23,561 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 13 states. [2018-02-03 23:14:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:23,788 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2018-02-03 23:14:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 23:14:23,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-03 23:14:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:23,790 INFO L225 Difference]: With dead ends: 151 [2018-02-03 23:14:23,790 INFO L226 Difference]: Without dead ends: 151 [2018-02-03 23:14:23,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-03 23:14:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-03 23:14:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-02-03 23:14:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-03 23:14:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-02-03 23:14:23,794 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 33 [2018-02-03 23:14:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:23,794 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-02-03 23:14:23,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 23:14:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-02-03 23:14:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:14:23,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:23,795 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] [2018-02-03 23:14:23,795 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430627, now seen corresponding path program 1 times [2018-02-03 23:14:23,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:23,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:23,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:23,796 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:23,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:23,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:23,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:23,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:14:23,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:14:23,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:14:23,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:14:23,844 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 7 states. [2018-02-03 23:14:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:24,001 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-02-03 23:14:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:14:24,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-03 23:14:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:24,003 INFO L225 Difference]: With dead ends: 148 [2018-02-03 23:14:24,003 INFO L226 Difference]: Without dead ends: 148 [2018-02-03 23:14:24,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:14:24,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-03 23:14:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-02-03 23:14:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-03 23:14:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-02-03 23:14:24,008 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 34 [2018-02-03 23:14:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:24,008 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-02-03 23:14:24,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:14:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-02-03 23:14:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:14:24,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:24,009 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] [2018-02-03 23:14:24,009 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430626, now seen corresponding path program 1 times [2018-02-03 23:14:24,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:24,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:24,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:24,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:24,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:24,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:24,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:24,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:14:24,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:14:24,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:14:24,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:14:24,113 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 8 states. [2018-02-03 23:14:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:24,341 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-02-03 23:14:24,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:14:24,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-03 23:14:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:24,342 INFO L225 Difference]: With dead ends: 146 [2018-02-03 23:14:24,342 INFO L226 Difference]: Without dead ends: 146 [2018-02-03 23:14:24,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:14:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-03 23:14:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-02-03 23:14:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-03 23:14:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-03 23:14:24,346 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2018-02-03 23:14:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:24,346 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-03 23:14:24,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:14:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-03 23:14:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:14:24,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:24,347 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:24,347 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -994990400, now seen corresponding path program 1 times [2018-02-03 23:14:24,347 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:24,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:24,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:24,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:24,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:24,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:24,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:24,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-03 23:14:24,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 23:14:24,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 23:14:24,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:14:24,592 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-02-03 23:14:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:24,984 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-02-03 23:14:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 23:14:24,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-02-03 23:14:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:24,985 INFO L225 Difference]: With dead ends: 176 [2018-02-03 23:14:24,985 INFO L226 Difference]: Without dead ends: 176 [2018-02-03 23:14:24,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:14:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-03 23:14:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-02-03 23:14:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-03 23:14:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-02-03 23:14:24,989 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 36 [2018-02-03 23:14:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:24,989 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-02-03 23:14:24,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 23:14:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-02-03 23:14:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:14:24,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:24,990 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:24,990 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash -994990399, now seen corresponding path program 1 times [2018-02-03 23:14:24,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:24,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:24,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:24,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:24,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:25,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:25,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:25,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-03 23:14:25,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 23:14:25,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 23:14:25,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:14:25,301 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 16 states. [2018-02-03 23:14:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:25,773 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-02-03 23:14:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:14:25,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-02-03 23:14:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:25,774 INFO L225 Difference]: With dead ends: 180 [2018-02-03 23:14:25,774 INFO L226 Difference]: Without dead ends: 180 [2018-02-03 23:14:25,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-02-03 23:14:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-03 23:14:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-02-03 23:14:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-03 23:14:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-02-03 23:14:25,777 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 36 [2018-02-03 23:14:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:25,777 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-02-03 23:14:25,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 23:14:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-02-03 23:14:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-03 23:14:25,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:25,778 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:25,778 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash -315835362, now seen corresponding path program 1 times [2018-02-03 23:14:25,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:25,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:25,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:25,779 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:25,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:25,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:25,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:14:25,891 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:14:25,900 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:25,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:26,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:14:26,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-02-03 23:14:26,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 23:14:26,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 23:14:26,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:14:26,083 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 13 states. [2018-02-03 23:14:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:26,421 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-02-03 23:14:26,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:14:26,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-02-03 23:14:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:26,423 INFO L225 Difference]: With dead ends: 198 [2018-02-03 23:14:26,423 INFO L226 Difference]: Without dead ends: 198 [2018-02-03 23:14:26,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-03 23:14:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-03 23:14:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2018-02-03 23:14:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-03 23:14:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2018-02-03 23:14:26,432 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 50 [2018-02-03 23:14:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:26,432 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2018-02-03 23:14:26,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 23:14:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2018-02-03 23:14:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-03 23:14:26,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:26,433 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:26,433 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash -315835361, now seen corresponding path program 1 times [2018-02-03 23:14:26,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:26,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:26,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:26,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:26,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:26,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:26,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:14:26,652 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:14:26,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:26,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:26,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:14:26,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:26,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:26,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:14:26,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:14:26,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:26,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:14:26,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:26,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:26,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-03 23:14:26,888 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~0.base Int)) (= (select |c_#length| insert_sub_~sub~0.base) 12)) (exists ((v_prenex_1 Int)) (and (= (select |c_old(#valid)| v_prenex_1) 0) (= |c_#length| (store |c_old(#length)| v_prenex_1 12))))) is different from true [2018-02-03 23:14:26,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:26,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:26,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:14:26,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:26,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:26,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:16 [2018-02-03 23:14:26,905 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~0.base Int)) (= (select |c_#length| insert_sub_~sub~0.base) 12)) (exists ((v_prenex_1 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_1 12)) (not (= v_prenex_1 |c_create_sub_list_#in~sub.base|))))) is different from true [2018-02-03 23:14:26,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:26,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 23:14:26,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:26,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:26,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 23:14:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:27,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:14:27,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-02-03 23:14:27,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 23:14:27,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 23:14:27,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=467, Unknown=3, NotChecked=90, Total=650 [2018-02-03 23:14:27,016 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 26 states. [2018-02-03 23:14:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:28,441 INFO L93 Difference]: Finished difference Result 232 states and 261 transitions. [2018-02-03 23:14:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-03 23:14:28,441 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-02-03 23:14:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:28,442 INFO L225 Difference]: With dead ends: 232 [2018-02-03 23:14:28,442 INFO L226 Difference]: Without dead ends: 232 [2018-02-03 23:14:28,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=1352, Unknown=18, NotChecked=158, Total=1806 [2018-02-03 23:14:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-03 23:14:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 196. [2018-02-03 23:14:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-03 23:14:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 215 transitions. [2018-02-03 23:14:28,447 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 215 transitions. Word has length 50 [2018-02-03 23:14:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:28,447 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 215 transitions. [2018-02-03 23:14:28,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 23:14:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 215 transitions. [2018-02-03 23:14:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-03 23:14:28,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:28,448 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:28,448 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash -345518987, now seen corresponding path program 1 times [2018-02-03 23:14:28,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:28,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:28,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:28,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:28,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:28,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:28,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:14:28,699 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:14:28,704 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:28,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:28,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:28,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:28,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:14:28,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:28,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:28,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:28,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:14:28,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:28,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:28,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2018-02-03 23:14:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:28,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:14:28,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-02-03 23:14:28,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-03 23:14:28,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-03 23:14:28,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2018-02-03 23:14:28,948 INFO L87 Difference]: Start difference. First operand 196 states and 215 transitions. Second operand 29 states. [2018-02-03 23:14:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:29,588 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2018-02-03 23:14:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 23:14:29,588 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-02-03 23:14:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:29,589 INFO L225 Difference]: With dead ends: 214 [2018-02-03 23:14:29,589 INFO L226 Difference]: Without dead ends: 214 [2018-02-03 23:14:29,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 23:14:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-03 23:14:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 195. [2018-02-03 23:14:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-03 23:14:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2018-02-03 23:14:29,596 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 61 [2018-02-03 23:14:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:29,596 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2018-02-03 23:14:29,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-03 23:14:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2018-02-03 23:14:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-03 23:14:29,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:29,597 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:29,597 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:14:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1287618042, now seen corresponding path program 1 times [2018-02-03 23:14:29,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:29,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:29,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:29,599 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:29,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:29,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:30,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:14:30,408 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:14:30,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:30,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:30,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:14:30,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:14:30,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:14:30,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:14:30,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-03 23:14:30,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:14:30,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:30,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:14:30,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:14:30,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:30,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:14:30,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-03 23:14:30,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:14:30,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 23:14:30,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:14:30,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,915 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,915 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:30,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:30,920 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:47, output treesize:12 [2018-02-03 23:14:31,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:31,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:31,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:31,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:31,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-03 23:14:31,605 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:156, output treesize:230 [2018-02-03 23:14:31,848 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 71 DAG size of output 53 [2018-02-03 23:14:31,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:31,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:31,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:14:31,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:31,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 130 [2018-02-03 23:14:31,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:14:31,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:31,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:31,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2018-02-03 23:14:31,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:31,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-02-03 23:14:31,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:31,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-02-03 23:14:31,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-02-03 23:14:31,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:31,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-03 23:14:31,975 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:31,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 36 [2018-02-03 23:14:32,019 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 23:14:32,041 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:14:32,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-02-03 23:14:32,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2018-02-03 23:14:32,082 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-03 23:14:32,101 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:14:32,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-02-03 23:14:32,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2018-02-03 23:14:32,117 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-03 23:14:32,138 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:14:32,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-02-03 23:14:32,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2018-02-03 23:14:32,153 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-03 23:14:32,172 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:14:32,213 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:14:32,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:14:32,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:14:32,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-02-03 23:14:32,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-02-03 23:14:32,351 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:32,353 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:32,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-02-03 23:14:32,397 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:270, output treesize:457 [2018-02-03 23:14:32,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-02-03 23:14:32,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:32,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:32,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 102 [2018-02-03 23:14:32,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:32,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 23:14:32,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:175, output treesize:189 [2018-02-03 23:14:33,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2018-02-03 23:14:33,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:14:33,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2018-02-03 23:14:33,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:14:33,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-03 23:14:33,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:219, output treesize:181 [2018-02-03 23:14:33,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:33,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 69 [2018-02-03 23:14:33,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:33,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-03 23:14:33,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2018-02-03 23:14:33,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:33,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 77 [2018-02-03 23:14:33,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:33,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-03 23:14:33,540 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:33,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 22 [2018-02-03 23:14:33,551 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:33,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-03 23:14:33,570 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:175, output treesize:57 [2018-02-03 23:14:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:14:33,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:14:33,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34] total 62 [2018-02-03 23:14:33,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-03 23:14:33,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-03 23:14:33,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3665, Unknown=54, NotChecked=0, Total=3906 [2018-02-03 23:14:33,810 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand 63 states. [2018-02-03 23:14:45,937 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 138 DAG size of output 80 [2018-02-03 23:14:46,156 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 131 DAG size of output 93 [2018-02-03 23:14:54,587 WARN L146 SmtUtils]: Spent 8127ms on a formula simplification. DAG size of input: 142 DAG size of output 87 [2018-02-03 23:14:54,851 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 32 DAG size of output 28 [2018-02-03 23:14:55,165 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-02-03 23:15:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:05,963 INFO L93 Difference]: Finished difference Result 244 states and 266 transitions. [2018-02-03 23:15:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-03 23:15:05,964 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 61 [2018-02-03 23:15:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:05,964 INFO L225 Difference]: With dead ends: 244 [2018-02-03 23:15:05,965 INFO L226 Difference]: Without dead ends: 244 [2018-02-03 23:15:05,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3011 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=754, Invalid=11575, Unknown=103, NotChecked=0, Total=12432 [2018-02-03 23:15:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-03 23:15:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 213. [2018-02-03 23:15:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-03 23:15:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-02-03 23:15:05,972 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 61 [2018-02-03 23:15:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:05,972 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-02-03 23:15:05,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-03 23:15:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-02-03 23:15:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-03 23:15:05,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:05,973 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:05,973 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1287618041, now seen corresponding path program 1 times [2018-02-03 23:15:05,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:05,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:05,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:05,974 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:05,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:06,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:15:07,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:07,211 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:07,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:07,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:07,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:15:07,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:15:07,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:15:07,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:15:07,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-03 23:15:07,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:15:07,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:07,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:15:07,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:15:07,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:07,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:15:07,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-03 23:15:07,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:07,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-02-03 23:15:07,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:15:07,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 23:15:07,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:15:07,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 23:15:07,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:15:07,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:07,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:07,698 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:53, output treesize:12 [2018-02-03 23:15:08,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:08,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:08,861 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:08,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:08,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:08,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:289, output treesize:467 [2018-02-03 23:15:09,757 WARN L146 SmtUtils]: Spent 621ms on a formula simplification. DAG size of input: 119 DAG size of output 71 [2018-02-03 23:15:09,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:09,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:09,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:15:09,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:09,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 325 [2018-02-03 23:15:09,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:15:09,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:09,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:09,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 286 [2018-02-03 23:15:10,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 228 [2018-02-03 23:15:10,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-02-03 23:15:10,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-02-03 23:15:10,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-03 23:15:10,088 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 83 [2018-02-03 23:15:10,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-02-03 23:15:10,144 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,163 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 193 [2018-02-03 23:15:10,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-03 23:15:10,260 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 145 [2018-02-03 23:15:10,313 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-03 23:15:10,313 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-02-03 23:15:10,316 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 102 [2018-02-03 23:15:10,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-02-03 23:15:10,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-02-03 23:15:10,349 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,356 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 114 [2018-02-03 23:15:10,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-02-03 23:15:10,372 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,384 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,391 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,398 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,405 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:10,424 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:502, output treesize:139 [2018-02-03 23:15:10,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:15:10,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-03 23:15:10,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:10,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:129 [2018-02-03 23:15:10,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 141 [2018-02-03 23:15:10,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 143 [2018-02-03 23:15:10,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 101 [2018-02-03 23:15:10,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-03 23:15:11,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:15:11,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 128 [2018-02-03 23:15:11,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,119 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 103 [2018-02-03 23:15:11,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:15:11,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:15:11,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 109 [2018-02-03 23:15:11,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,179 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 85 [2018-02-03 23:15:11,180 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:15:11,201 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:11,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 188 [2018-02-03 23:15:11,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 173 [2018-02-03 23:15:11,220 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:11,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:11,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 121 [2018-02-03 23:15:11,291 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-03 23:15:11,338 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:15:11,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-02-03 23:15:11,450 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:159, output treesize:720 [2018-02-03 23:15:12,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:12,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:12,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 115 [2018-02-03 23:15:12,040 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 64 [2018-02-03 23:15:12,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:15:12,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 48 [2018-02-03 23:15:12,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 88 [2018-02-03 23:15:12,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2018-02-03 23:15:12,111 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2018-02-03 23:15:12,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,133 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-02-03 23:15:12,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-03 23:15:12,188 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:15:12,199 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,209 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:12,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:12,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-02-03 23:15:12,279 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 56 [2018-02-03 23:15:12,281 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-02-03 23:15:12,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-03 23:15:12,307 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,311 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:12,323 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:252, output treesize:16 [2018-02-03 23:15:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:15:12,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:12,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 62 [2018-02-03 23:15:12,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-03 23:15:12,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-03 23:15:12,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3701, Unknown=0, NotChecked=0, Total=3906 [2018-02-03 23:15:12,527 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 63 states. [2018-02-03 23:15:13,999 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 90 DAG size of output 77 [2018-02-03 23:15:16,414 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 100 DAG size of output 67 [2018-02-03 23:15:22,589 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 99 DAG size of output 86 [2018-02-03 23:15:25,992 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 91 DAG size of output 90 [2018-02-03 23:15:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:26,931 INFO L93 Difference]: Finished difference Result 246 states and 265 transitions. [2018-02-03 23:15:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-03 23:15:26,931 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 61 [2018-02-03 23:15:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:26,932 INFO L225 Difference]: With dead ends: 246 [2018-02-03 23:15:26,932 INFO L226 Difference]: Without dead ends: 246 [2018-02-03 23:15:26,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=791, Invalid=12539, Unknown=10, NotChecked=0, Total=13340 [2018-02-03 23:15:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-03 23:15:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 207. [2018-02-03 23:15:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-03 23:15:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 222 transitions. [2018-02-03 23:15:26,937 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 222 transitions. Word has length 61 [2018-02-03 23:15:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:26,937 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 222 transitions. [2018-02-03 23:15:26,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-03 23:15:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 222 transitions. [2018-02-03 23:15:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-03 23:15:26,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:26,938 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:26,938 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash -555497455, now seen corresponding path program 1 times [2018-02-03 23:15:26,938 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:26,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:26,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:26,938 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:26,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:26,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:15:27,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:27,438 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:27,443 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:27,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:27,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:15:27,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:15:27,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:15:27,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:15:27,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-03 23:15:27,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:15:27,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:27,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:15:27,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:15:27,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:27,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:15:27,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-03 23:15:27,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:27,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:27,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:15:27,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-02-03 23:15:27,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-03 23:15:27,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:15:27,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-03 23:15:27,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:15:27,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:32 [2018-02-03 23:15:27,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-03 23:15:27,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-02-03 23:15:27,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-03 23:15:27,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-02-03 23:15:27,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:27,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:9 [2018-02-03 23:15:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:15:28,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:28,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2018-02-03 23:15:28,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-03 23:15:28,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-03 23:15:28,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2018-02-03 23:15:28,104 INFO L87 Difference]: Start difference. First operand 207 states and 222 transitions. Second operand 41 states. [2018-02-03 23:15:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:29,525 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-02-03 23:15:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-03 23:15:29,525 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 67 [2018-02-03 23:15:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:29,526 INFO L225 Difference]: With dead ends: 227 [2018-02-03 23:15:29,526 INFO L226 Difference]: Without dead ends: 227 [2018-02-03 23:15:29,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=313, Invalid=3469, Unknown=0, NotChecked=0, Total=3782 [2018-02-03 23:15:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-03 23:15:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 207. [2018-02-03 23:15:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-03 23:15:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 221 transitions. [2018-02-03 23:15:29,532 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 221 transitions. Word has length 67 [2018-02-03 23:15:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:29,532 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 221 transitions. [2018-02-03 23:15:29,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-03 23:15:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 221 transitions. [2018-02-03 23:15:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-03 23:15:29,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:29,533 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-03 23:15:29,533 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1860213531, now seen corresponding path program 1 times [2018-02-03 23:15:29,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:29,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:29,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:29,534 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:29,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:29,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-03 23:15:29,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:29,902 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:29,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:29,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:29,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:29,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:29,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:29,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:15:30,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:30,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:15:30,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:30,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-03 23:15:30,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:30,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:30,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:15:30,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:30,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:19 [2018-02-03 23:15:30,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:30,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:15:30,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:30,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-03 23:15:30,209 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~0.base Int)) (= (select |c_#length| insert_sub_~sub~0.base) 12)) (exists ((v_prenex_28 Int)) (and (= (select |c_old(#valid)| v_prenex_28) 0) (= |c_#length| (store |c_old(#length)| v_prenex_28 12))))) is different from true [2018-02-03 23:15:30,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:30,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:30,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:15:30,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:30,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:23 [2018-02-03 23:15:30,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:30,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-02-03 23:15:30,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-02-03 23:15:30,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:30,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:30,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2018-02-03 23:15:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2018-02-03 23:15:30,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:30,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-02-03 23:15:30,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-03 23:15:30,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-03 23:15:30,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1285, Unknown=41, NotChecked=74, Total=1560 [2018-02-03 23:15:30,360 INFO L87 Difference]: Start difference. First operand 207 states and 221 transitions. Second operand 40 states. [2018-02-03 23:15:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:32,083 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2018-02-03 23:15:32,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-03 23:15:32,083 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-02-03 23:15:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:32,084 INFO L225 Difference]: With dead ends: 260 [2018-02-03 23:15:32,084 INFO L226 Difference]: Without dead ends: 260 [2018-02-03 23:15:32,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=533, Invalid=3957, Unknown=70, NotChecked=132, Total=4692 [2018-02-03 23:15:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-03 23:15:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 190. [2018-02-03 23:15:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-03 23:15:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2018-02-03 23:15:32,088 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 75 [2018-02-03 23:15:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:32,088 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 200 transitions. [2018-02-03 23:15:32,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-03 23:15:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2018-02-03 23:15:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-03 23:15:32,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:32,089 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:32,089 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:32,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1524414898, now seen corresponding path program 1 times [2018-02-03 23:15:32,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:32,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:32,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:32,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:32,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:32,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-03 23:15:32,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:32,295 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:32,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:32,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:32,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:32,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:15:32,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:32,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:32,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:15:32,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-03 23:15:32,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 23:15:32,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:32,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-02-03 23:15:32,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-02-03 23:15:32,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:32,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2018-02-03 23:15:32,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 23:15:32,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:32,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-02-03 23:15:32,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-02-03 23:15:32,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:32,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:32,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2018-02-03 23:15:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-03 23:15:32,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:15:32,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [13] total 21 [2018-02-03 23:15:32,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 23:15:32,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 23:15:32,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=380, Unknown=9, NotChecked=0, Total=462 [2018-02-03 23:15:32,656 INFO L87 Difference]: Start difference. First operand 190 states and 200 transitions. Second operand 22 states. [2018-02-03 23:15:34,756 WARN L146 SmtUtils]: Spent 1766ms on a formula simplification. DAG size of input: 29 DAG size of output 25 [2018-02-03 23:15:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:35,041 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2018-02-03 23:15:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 23:15:35,042 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2018-02-03 23:15:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:35,042 INFO L225 Difference]: With dead ends: 250 [2018-02-03 23:15:35,043 INFO L226 Difference]: Without dead ends: 250 [2018-02-03 23:15:35,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=205, Invalid=976, Unknown=9, NotChecked=0, Total=1190 [2018-02-03 23:15:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-03 23:15:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 215. [2018-02-03 23:15:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-03 23:15:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 234 transitions. [2018-02-03 23:15:35,046 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 234 transitions. Word has length 81 [2018-02-03 23:15:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:35,046 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 234 transitions. [2018-02-03 23:15:35,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 23:15:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 234 transitions. [2018-02-03 23:15:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-03 23:15:35,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:35,047 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:35,047 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1524414897, now seen corresponding path program 1 times [2018-02-03 23:15:35,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:35,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:35,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:35,047 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:35,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:35,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-03 23:15:35,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:35,355 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:35,360 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:35,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:35,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:35,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:35,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 23:15:35,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:15:35,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 23:15:35,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-02-03 23:15:35,646 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~0.base Int)) (and (= (select |c_old(#valid)| insert_sub_~sub~0.base) 0) (= |c_#length| (store |c_old(#length)| insert_sub_~sub~0.base 12)))) is different from true [2018-02-03 23:15:35,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:35,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:15:35,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:35,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-03 23:15:35,669 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~0.base Int)) (= (select |c_#length| insert_sub_~sub~0.base) 12)) (exists ((v_prenex_32 Int)) (and (= (store |c_old(#length)| v_prenex_32 12) |c_#length|) (= (select |c_old(#valid)| v_prenex_32) 0)))) is different from true [2018-02-03 23:15:35,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 48 [2018-02-03 23:15:35,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:15:35,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:35,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:24 [2018-02-03 23:15:35,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:35,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:35,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:35,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2018-02-03 23:15:35,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:35,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 41 [2018-02-03 23:15:35,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-03 23:15:35,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-02-03 23:15:35,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:86 [2018-02-03 23:15:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2018-02-03 23:15:36,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:36,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 42 [2018-02-03 23:15:36,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-03 23:15:36,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-03 23:15:36,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1470, Unknown=33, NotChecked=158, Total=1806 [2018-02-03 23:15:36,135 INFO L87 Difference]: Start difference. First operand 215 states and 234 transitions. Second operand 43 states. [2018-02-03 23:15:37,783 WARN L146 SmtUtils]: Spent 748ms on a formula simplification. DAG size of input: 55 DAG size of output 50 [2018-02-03 23:15:38,943 WARN L146 SmtUtils]: Spent 1127ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-02-03 23:15:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:39,589 INFO L93 Difference]: Finished difference Result 259 states and 289 transitions. [2018-02-03 23:15:39,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-03 23:15:39,589 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2018-02-03 23:15:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:39,590 INFO L225 Difference]: With dead ends: 259 [2018-02-03 23:15:39,590 INFO L226 Difference]: Without dead ends: 259 [2018-02-03 23:15:39,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=351, Invalid=3396, Unknown=43, NotChecked=242, Total=4032 [2018-02-03 23:15:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-03 23:15:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2018-02-03 23:15:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-03 23:15:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 257 transitions. [2018-02-03 23:15:39,596 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 257 transitions. Word has length 81 [2018-02-03 23:15:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:39,596 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 257 transitions. [2018-02-03 23:15:39,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-03 23:15:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 257 transitions. [2018-02-03 23:15:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-03 23:15:39,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:39,597 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:39,598 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash 36504776, now seen corresponding path program 1 times [2018-02-03 23:15:39,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:39,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:39,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:39,599 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:39,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:39,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-03 23:15:39,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:39,902 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:39,908 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:39,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:39,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:39,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:39,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:39,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:15:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:40,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:15:40,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-03 23:15:40,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:40,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-03 23:15:40,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:40,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-03 23:15:40,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 23:15:40,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:40,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-02-03 23:15:40,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:40,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:40,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:40,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-02-03 23:15:40,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-02-03 23:15:40,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:40,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:39 [2018-02-03 23:15:40,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 23:15:40,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:40,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-02-03 23:15:40,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-02-03 23:15:40,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:40,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:40,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:46 [2018-02-03 23:15:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-03 23:15:40,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:40,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 31 [2018-02-03 23:15:40,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-03 23:15:40,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-03 23:15:40,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=839, Unknown=13, NotChecked=0, Total=992 [2018-02-03 23:15:40,532 INFO L87 Difference]: Start difference. First operand 232 states and 257 transitions. Second operand 32 states. [2018-02-03 23:15:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:41,624 INFO L93 Difference]: Finished difference Result 298 states and 353 transitions. [2018-02-03 23:15:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-03 23:15:41,624 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 106 [2018-02-03 23:15:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:41,625 INFO L225 Difference]: With dead ends: 298 [2018-02-03 23:15:41,625 INFO L226 Difference]: Without dead ends: 298 [2018-02-03 23:15:41,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 93 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=2071, Unknown=13, NotChecked=0, Total=2450 [2018-02-03 23:15:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-03 23:15:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 261. [2018-02-03 23:15:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-03 23:15:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 305 transitions. [2018-02-03 23:15:41,631 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 305 transitions. Word has length 106 [2018-02-03 23:15:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:41,631 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 305 transitions. [2018-02-03 23:15:41,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-03 23:15:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 305 transitions. [2018-02-03 23:15:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-03 23:15:41,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:41,632 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:41,632 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 36504777, now seen corresponding path program 1 times [2018-02-03 23:15:41,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:41,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:41,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:41,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:41,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:41,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-03 23:15:42,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:42,099 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:42,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:42,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:42,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:42,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:42,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 23:15:42,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 23:15:42,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:15:42,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-02-03 23:15:42,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:15:42,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:15:42,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:42,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-03 23:15:42,487 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_insert_sub_~sub~0.base_BEFORE_CALL_4 Int)) (= 12 (select |c_#length| v_insert_sub_~sub~0.base_BEFORE_CALL_4))) (exists ((insert_sub_~sub~0.base Int)) (and (= (select |c_old(#valid)| insert_sub_~sub~0.base) 0) (= |c_#length| (store |c_old(#length)| insert_sub_~sub~0.base 12))))) is different from true [2018-02-03 23:15:42,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 23:15:42,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:42,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-02-03 23:15:42,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:15:42,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 56 [2018-02-03 23:15:42,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 43 [2018-02-03 23:15:42,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-03 23:15:42,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:15:42,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-02-03 23:15:42,699 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:108 [2018-02-03 23:15:42,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 23:15:42,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:42,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:15:42,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-02-03 23:15:42,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 78 [2018-02-03 23:15:42,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-03 23:15:42,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 60 [2018-02-03 23:15:42,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 23:15:42,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:42,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 59 [2018-02-03 23:15:42,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 23:15:43,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 20 dim-0 vars, and 7 xjuncts. [2018-02-03 23:15:43,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:147, output treesize:275 [2018-02-03 23:15:45,286 WARN L146 SmtUtils]: Spent 2168ms on a formula simplification. DAG size of input: 127 DAG size of output 72 [2018-02-03 23:15:47,437 WARN L143 SmtUtils]: Spent 2090ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-03 23:15:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 43 trivial. 4 not checked. [2018-02-03 23:15:47,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:47,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 42 [2018-02-03 23:15:47,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-03 23:15:47,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-03 23:15:47,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1566, Unknown=4, NotChecked=80, Total=1806 [2018-02-03 23:15:47,577 INFO L87 Difference]: Start difference. First operand 261 states and 305 transitions. Second operand 43 states. [2018-02-03 23:15:53,468 WARN L146 SmtUtils]: Spent 4718ms on a formula simplification. DAG size of input: 84 DAG size of output 68 [2018-02-03 23:15:57,568 WARN L146 SmtUtils]: Spent 4056ms on a formula simplification. DAG size of input: 120 DAG size of output 82 [2018-02-03 23:15:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:58,601 INFO L93 Difference]: Finished difference Result 300 states and 359 transitions. [2018-02-03 23:15:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-03 23:15:58,602 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 106 [2018-02-03 23:15:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:58,603 INFO L225 Difference]: With dead ends: 300 [2018-02-03 23:15:58,603 INFO L226 Difference]: Without dead ends: 300 [2018-02-03 23:15:58,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 90 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=388, Invalid=3394, Unknown=4, NotChecked=120, Total=3906 [2018-02-03 23:15:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-03 23:15:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 238. [2018-02-03 23:15:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-03 23:15:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2018-02-03 23:15:58,607 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 106 [2018-02-03 23:15:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:58,607 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2018-02-03 23:15:58,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-03 23:15:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2018-02-03 23:15:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-03 23:15:58,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:58,608 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:58,608 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1140095168, now seen corresponding path program 1 times [2018-02-03 23:15:58,608 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:58,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:58,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:58,609 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:58,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:58,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-03 23:15:58,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:15:58,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 23:15:58,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:15:58,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:15:58,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:15:58,717 INFO L87 Difference]: Start difference. First operand 238 states and 266 transitions. Second operand 12 states. [2018-02-03 23:15:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:58,873 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2018-02-03 23:15:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:15:58,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2018-02-03 23:15:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:58,874 INFO L225 Difference]: With dead ends: 237 [2018-02-03 23:15:58,874 INFO L226 Difference]: Without dead ends: 237 [2018-02-03 23:15:58,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:15:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-03 23:15:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-02-03 23:15:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-03 23:15:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2018-02-03 23:15:58,881 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 84 [2018-02-03 23:15:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:58,882 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2018-02-03 23:15:58,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:15:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2018-02-03 23:15:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-03 23:15:58,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:58,882 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:58,882 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash 983211783, now seen corresponding path program 1 times [2018-02-03 23:15:58,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:58,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:58,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:58,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:58,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:58,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-03 23:15:58,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:58,994 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:58,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:59,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 23:15:59,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:59,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-03 23:15:59,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:15:59,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:15:59,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:15:59,087 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand 15 states. [2018-02-03 23:15:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:15:59,344 INFO L93 Difference]: Finished difference Result 255 states and 285 transitions. [2018-02-03 23:15:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 23:15:59,344 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2018-02-03 23:15:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:15:59,345 INFO L225 Difference]: With dead ends: 255 [2018-02-03 23:15:59,345 INFO L226 Difference]: Without dead ends: 255 [2018-02-03 23:15:59,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-02-03 23:15:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-03 23:15:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 236. [2018-02-03 23:15:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-03 23:15:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 264 transitions. [2018-02-03 23:15:59,348 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 264 transitions. Word has length 85 [2018-02-03 23:15:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:15:59,348 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 264 transitions. [2018-02-03 23:15:59,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:15:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 264 transitions. [2018-02-03 23:15:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-03 23:15:59,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:15:59,349 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:15:59,349 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:15:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash 983211784, now seen corresponding path program 1 times [2018-02-03 23:15:59,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:15:59,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:15:59,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:59,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:59,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:15:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:59,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:15:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-03 23:15:59,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:15:59,544 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:15:59,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:15:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:15:59,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:15:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-03 23:15:59,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:15:59,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 26 [2018-02-03 23:15:59,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 23:15:59,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 23:15:59,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:15:59,726 INFO L87 Difference]: Start difference. First operand 236 states and 264 transitions. Second operand 27 states. [2018-02-03 23:16:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:16:00,071 INFO L93 Difference]: Finished difference Result 234 states and 262 transitions. [2018-02-03 23:16:00,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:16:00,072 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-02-03 23:16:00,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:16:00,072 INFO L225 Difference]: With dead ends: 234 [2018-02-03 23:16:00,072 INFO L226 Difference]: Without dead ends: 234 [2018-02-03 23:16:00,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 23:16:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-03 23:16:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-02-03 23:16:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-03 23:16:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 262 transitions. [2018-02-03 23:16:00,076 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 262 transitions. Word has length 85 [2018-02-03 23:16:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:16:00,077 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 262 transitions. [2018-02-03 23:16:00,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 23:16:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 262 transitions. [2018-02-03 23:16:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-03 23:16:00,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:16:00,077 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:16:00,077 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-02-03 23:16:00,078 INFO L82 PathProgramCache]: Analyzing trace with hash -26282390, now seen corresponding path program 1 times [2018-02-03 23:16:00,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:16:00,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:16:00,078 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:16:00,078 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:16:00,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:16:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:16:00,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:16:02,811 WARN L143 SmtUtils]: Spent 148ms on a formula simplification that was a NOOP. DAG size: 74 [2018-02-03 23:16:03,159 WARN L143 SmtUtils]: Spent 160ms on a formula simplification that was a NOOP. DAG size: 71 [2018-02-03 23:16:03,822 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 67 DAG size of output 66 [2018-02-03 23:16:04,196 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 65 DAG size of output 62 [2018-02-03 23:16:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-03 23:16:04,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:16:04,536 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:16:04,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:16:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:16:04,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:16:04,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:16:04,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:04,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:16:04,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:16:04,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:16:04,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:16:04,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:04,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:16:04,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:16:04,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-03 23:16:04,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:04,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:04,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:16:04,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:04,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:16:04,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-02-03 23:16:05,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:05,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-03 23:16:05,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:05,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:05,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:16:05,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:16:05,334 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:9 [2018-02-03 23:16:05,832 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_insert_sub_~sub~0.base_BEFORE_CALL_5 Int)) (= 1 (select |c_#valid| v_insert_sub_~sub~0.base_BEFORE_CALL_5))) (exists ((__list_add_~new.offset Int) (__list_add_~next.offset Int) (__list_add_~prev.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |c___list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___list_add_#in~next.base|) (+ __list_add_~next.offset 4) |c___list_add_#in~new.base|)))) (store .cse1 |c___list_add_#in~new.base| (store (store (select .cse1 |c___list_add_#in~new.base|) __list_add_~new.offset |c___list_add_#in~next.base|) (+ __list_add_~new.offset 4) |c___list_add_#in~prev.base|))))) (store .cse0 |c___list_add_#in~prev.base| (store (select .cse0 |c___list_add_#in~prev.base|) __list_add_~prev.offset |c___list_add_#in~new.base|)))))) is different from true [2018-02-03 23:16:05,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:16:05,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:16:05,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-03 23:16:05,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:133, output treesize:214 [2018-02-03 23:16:06,406 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-02-03 23:16:06,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-03 23:16:06,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:06,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 232 [2018-02-03 23:16:06,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-03 23:16:06,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-03 23:16:06,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:06,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:16:06,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 147 [2018-02-03 23:16:06,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:16:06,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:06,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 104 [2018-02-03 23:16:06,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 76 [2018-02-03 23:16:06,659 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-03 23:16:06,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 74 [2018-02-03 23:16:06,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-02-03 23:16:06,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 36 [2018-02-03 23:16:06,722 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-03 23:16:06,740 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:06,754 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:16:06,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 63 [2018-02-03 23:16:06,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 40 [2018-02-03 23:16:06,788 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,804 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-02-03 23:16:06,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 40 [2018-02-03 23:16:06,817 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,833 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2018-02-03 23:16:06,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 40 [2018-02-03 23:16:06,846 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,862 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,914 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:16:06,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 76 [2018-02-03 23:16:06,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-02-03 23:16:06,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-03 23:16:06,932 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:06,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:06,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 36 [2018-02-03 23:16:06,951 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:06,967 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:16:06,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-02-03 23:16:06,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:07,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2018-02-03 23:16:07,009 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-02-03 23:16:07,056 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:16:07,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 72 [2018-02-03 23:16:07,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:07,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2018-02-03 23:16:07,076 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-02-03 23:16:07,113 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:16:07,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-02-03 23:16:07,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:07,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2018-02-03 23:16:07,133 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-02-03 23:16:07,171 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:16:07,266 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-02-03 23:16:07,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 74 [2018-02-03 23:16:07,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-02-03 23:16:07,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:07,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 36 [2018-02-03 23:16:07,294 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:07,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:16:07,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-03 23:16:07,313 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-03 23:16:07,328 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:16:07,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 63 [2018-02-03 23:16:07,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 40 [2018-02-03 23:16:07,362 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:07,378 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:16:07,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2018-02-03 23:16:07,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 40 [2018-02-03 23:16:07,391 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:07,407 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:16:07,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-02-03 23:16:07,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 40 [2018-02-03 23:16:07,420 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-02-03 23:16:07,436 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:16:07,484 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:16:07,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 21 xjuncts. [2018-02-03 23:16:07,883 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 21 xjuncts. [2018-02-03 23:16:08,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 21 xjuncts. [2018-02-03 23:16:08,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 39 dim-0 vars, and 21 xjuncts. [2018-02-03 23:16:08,302 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 8 variables, input treesize:593, output treesize:2194 [2018-02-03 23:16:32,802 WARN L146 SmtUtils]: Spent 24170ms on a formula simplification. DAG size of input: 361 DAG size of output 102 [2018-02-03 23:16:37,504 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__list_add_~new.offset Int) (__list_add_~next.offset Int) (__list_add_~prev.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |c___list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___list_add_#in~next.base|) (+ __list_add_~next.offset 4) |c___list_add_#in~new.base|)))) (store .cse1 |c___list_add_#in~new.base| (store (store (select .cse1 |c___list_add_#in~new.base|) __list_add_~new.offset |c___list_add_#in~next.base|) (+ __list_add_~new.offset 4) |c___list_add_#in~prev.base|))))) (store .cse0 |c___list_add_#in~prev.base| (store (select .cse0 |c___list_add_#in~prev.base|) __list_add_~prev.offset |c___list_add_#in~new.base|))))) is different from true [2018-02-03 23:16:37,509 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__list_add_~new.offset Int) (__list_add_~next.offset Int) (__list_add_~prev.offset Int)) (= (let ((.cse3 (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head.base|))) (let ((.cse1 (select .cse3 (+ |c_list_add_tail_#in~head.offset| 4)))) (let ((.cse0 (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head.base| (store .cse3 (+ __list_add_~next.offset 4) |c_list_add_tail_#in~new.base|)))) (store .cse2 |c_list_add_tail_#in~new.base| (store (store (select .cse2 |c_list_add_tail_#in~new.base|) __list_add_~new.offset |c_list_add_tail_#in~head.base|) (+ __list_add_~new.offset 4) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) __list_add_~prev.offset |c_list_add_tail_#in~new.base|))))) |c_#memory_$Pointer$.base|)) is different from true [2018-02-03 23:16:37,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:16:37,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:16:37,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-03 23:16:37,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:122, output treesize:203 [2018-02-03 23:16:37,530 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~0.base Int) (__list_add_~new.offset Int) (v_DerPreprocessor_16 Int) (__list_add_~next.offset Int) (__list_add_~prev.offset Int) (insert_sub_~sub~0.offset Int)) (and (= (select |c_old(#valid)| insert_sub_~sub~0.base) 0) (= (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| insert_sub_~sub~0.base (store (select |c_old(#memory_$Pointer$.base)| insert_sub_~sub~0.base) insert_sub_~sub~0.offset v_DerPreprocessor_16)))) (let ((.cse4 (select .cse3 |c_insert_sub_#in~head.base|))) (let ((.cse1 (select .cse4 (+ |c_insert_sub_#in~head.offset| 4)))) (let ((.cse0 (let ((.cse2 (store .cse3 |c_insert_sub_#in~head.base| (store .cse4 (+ __list_add_~next.offset 4) insert_sub_~sub~0.base)))) (store .cse2 insert_sub_~sub~0.base (store (store (select .cse2 insert_sub_~sub~0.base) __list_add_~new.offset |c_insert_sub_#in~head.base|) (+ __list_add_~new.offset 4) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) __list_add_~prev.offset insert_sub_~sub~0.base)))))) |c_#memory_$Pointer$.base|))) is different from true [2018-02-03 23:16:37,540 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~0.base Int) (__list_add_~new.offset Int) (v_DerPreprocessor_16 Int) (__list_add_~next.offset Int) (__list_add_~prev.offset Int) (insert_sub_~sub~0.offset Int)) (and (= (select |c_old(#valid)| insert_sub_~sub~0.base) 0) (= |c_#memory_$Pointer$.base| (let ((.cse5 (+ |c_create_sub_list_#in~sub.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| |c_create_sub_list_#in~sub.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_create_sub_list_#in~sub.base|) .cse5 |c_create_sub_list_#in~sub.base|) |c_create_sub_list_#in~sub.offset| |c_create_sub_list_#in~sub.base|)))) (store .cse6 insert_sub_~sub~0.base (store (select .cse6 insert_sub_~sub~0.base) insert_sub_~sub~0.offset v_DerPreprocessor_16))))) (let ((.cse4 (select .cse3 |c_create_sub_list_#in~sub.base|))) (let ((.cse1 (select .cse4 .cse5))) (let ((.cse0 (let ((.cse2 (store .cse3 |c_create_sub_list_#in~sub.base| (store .cse4 (+ __list_add_~next.offset 4) insert_sub_~sub~0.base)))) (store .cse2 insert_sub_~sub~0.base (store (store (select .cse2 insert_sub_~sub~0.base) __list_add_~new.offset |c_create_sub_list_#in~sub.base|) (+ __list_add_~new.offset 4) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) __list_add_~prev.offset insert_sub_~sub~0.base)))))))))) is different from true Received shutdown request... [2018-02-03 23:17:42,327 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 23:17:42,327 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:17:42,330 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:17:42,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:17:42 BoogieIcfgContainer [2018-02-03 23:17:42,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:17:42,331 INFO L168 Benchmark]: Toolchain (without parser) took 201745.51 ms. Allocated memory was 405.8 MB in the beginning and 1.0 GB in the end (delta: 603.5 MB). Free memory was 362.7 MB in the beginning and 619.0 MB in the end (delta: -256.4 MB). Peak memory consumption was 347.1 MB. Max. memory is 5.3 GB. [2018-02-03 23:17:42,332 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:17:42,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.46 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 350.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:17:42,332 INFO L168 Benchmark]: Boogie Preprocessor took 26.54 ms. Allocated memory is still 405.8 MB. Free memory was 350.8 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:17:42,333 INFO L168 Benchmark]: RCFGBuilder took 339.98 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 316.7 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 5.3 GB. [2018-02-03 23:17:42,333 INFO L168 Benchmark]: TraceAbstraction took 201208.54 ms. Allocated memory was 405.8 MB in the beginning and 1.0 GB in the end (delta: 603.5 MB). Free memory was 316.7 MB in the beginning and 619.0 MB in the end (delta: -302.3 MB). Peak memory consumption was 301.1 MB. Max. memory is 5.3 GB. [2018-02-03 23:17:42,334 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.12 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.46 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 350.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.54 ms. Allocated memory is still 405.8 MB. Free memory was 350.8 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 339.98 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 316.7 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 201208.54 ms. Allocated memory was 405.8 MB in the beginning and 1.0 GB in the end (delta: 603.5 MB). Free memory was 316.7 MB in the beginning and 619.0 MB in the end (delta: -302.3 MB). Peak memory consumption was 301.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 695]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 695). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 351. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 119 locations, 33 error locations. TIMEOUT Result, 201.1s OverallTime, 29 OverallIterations, 4 TraceHistogramMax, 73.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2547 SDtfs, 3401 SDslu, 17965 SDs, 0 SdLazy, 26784 SolverSat, 1295 SolverUnsat, 329 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1751 GetRequests, 814 SyntacticMatches, 87 SemanticMatches, 850 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 12459 ImplicationChecksByTransitivity, 63.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 447 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 2394 NumberOfCodeBlocks, 2394 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2353 ConstructedInterpolants, 387 QuantifiedInterpolants, 1867211 SizeOfPredicates, 239 NumberOfNonLiveVariables, 5734 ConjunctsInSsa, 892 ConjunctsInUnsatCore, 41 InterpolantComputations, 16 PerfectInterpolantSequences, 585/878 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-17-42-340.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-17-42-340.csv Completed graceful shutdown