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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:30:34,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:30:34,581 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:30:34,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:30:34,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:30:34,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:30:34,599 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:30:34,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:30:34,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:30:34,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:30:34,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:30:34,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:30:34,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:30:34,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:30:34,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:30:34,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:30:34,613 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:30:34,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:30:34,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:30:34,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:30:34,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:30:34,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:30:34,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:30:34,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:30:34,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:30:34,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:30:34,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:30:34,625 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:30:34,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:30:34,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:30:34,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:30:34,626 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:30:34,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:30:34,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:30:34,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:30:34,636 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:30:34,636 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:30:34,636 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:30:34,636 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:30:34,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:30:34,637 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:30:34,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:30:34,638 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:30:34,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:30:34,638 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:30:34,638 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:30:34,638 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:30:34,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:30:34,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:30:34,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:30:34,639 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:30:34,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:30:34,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:30:34,640 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:30:34,640 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:30:34,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:30:34,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:30:34,641 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:30:34,641 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:30:34,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:30:34,684 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:30:34,688 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:30:34,689 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:30:34,689 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:30:34,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-01-28 21:30:34,911 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:30:34,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:30:34,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:30:34,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:30:34,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:30:34,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:30:34" (1/1) ... [2018-01-28 21:30:34,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6157ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:34, skipping insertion in model container [2018-01-28 21:30:34,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:30:34" (1/1) ... [2018-01-28 21:30:34,940 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:30:34,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:30:35,096 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:30:35,117 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:30:35,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35 WrapperNode [2018-01-28 21:30:35,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:30:35,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:30:35,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:30:35,129 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:30:35,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... [2018-01-28 21:30:35,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... [2018-01-28 21:30:35,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... [2018-01-28 21:30:35,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... [2018-01-28 21:30:35,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... [2018-01-28 21:30:35,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... [2018-01-28 21:30:35,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... [2018-01-28 21:30:35,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:30:35,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:30:35,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:30:35,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:30:35,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (1/1) ... No working directory specified, using /storage/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-01-28 21:30:35,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:30:35,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:30:35,224 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-28 21:30:35,224 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-28 21:30:35,224 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-28 21:30:35,224 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-28 21:30:35,224 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-28 21:30:35,225 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-28 21:30:35,225 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-28 21:30:35,225 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-28 21:30:35,225 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:30:35,225 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:30:35,225 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:30:35,225 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:30:35,225 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:30:35,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:30:35,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:30:35,226 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:30:35,226 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:30:35,226 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-28 21:30:35,226 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:30:35,227 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-28 21:30:35,227 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-28 21:30:35,227 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-28 21:30:35,227 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-28 21:30:35,227 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-28 21:30:35,228 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-28 21:30:35,228 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-28 21:30:35,228 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-28 21:30:35,228 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:30:35,228 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:30:35,228 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:30:35,666 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:30:35,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:30:35 BoogieIcfgContainer [2018-01-28 21:30:35,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:30:35,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:30:35,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:30:35,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:30:35,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:30:34" (1/3) ... [2018-01-28 21:30:35,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ff8e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:30:35, skipping insertion in model container [2018-01-28 21:30:35,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:30:35" (2/3) ... [2018-01-28 21:30:35,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ff8e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:30:35, skipping insertion in model container [2018-01-28 21:30:35,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:30:35" (3/3) ... [2018-01-28 21:30:35,675 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-28 21:30:35,682 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:30:35,689 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-28 21:30:35,744 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:30:35,744 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:30:35,744 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:30:35,744 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:30:35,744 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:30:35,745 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:30:35,745 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:30:35,745 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:30:35,746 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:30:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2018-01-28 21:30:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 21:30:35,777 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:35,778 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:35,778 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-01-28 21:30:35,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1600161610, now seen corresponding path program 1 times [2018-01-28 21:30:35,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:35,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:35,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:35,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:35,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:35,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:35,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:35,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:30:35,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:30:35,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:30:35,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:30:35,979 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 3 states. [2018-01-28 21:30:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:36,190 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2018-01-28 21:30:36,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:30:36,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 21:30:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:36,200 INFO L225 Difference]: With dead ends: 251 [2018-01-28 21:30:36,200 INFO L226 Difference]: Without dead ends: 126 [2018-01-28 21:30:36,204 INFO L533 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-01-28 21:30:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-28 21:30:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-28 21:30:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-28 21:30:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2018-01-28 21:30:36,245 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 8 [2018-01-28 21:30:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:36,245 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-01-28 21:30:36,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:30:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-01-28 21:30:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 21:30:36,246 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:36,247 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:36,247 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-01-28 21:30:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1600161611, now seen corresponding path program 1 times [2018-01-28 21:30:36,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:36,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:36,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:36,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:36,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:36,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:36,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:36,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:30:36,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:30:36,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:30:36,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:30:36,350 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 3 states. [2018-01-28 21:30:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:36,462 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-01-28 21:30:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:30:36,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 21:30:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:36,465 INFO L225 Difference]: With dead ends: 126 [2018-01-28 21:30:36,465 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 21:30:36,466 INFO L533 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-01-28 21:30:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 21:30:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-28 21:30:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-28 21:30:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2018-01-28 21:30:36,479 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 8 [2018-01-28 21:30:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:36,479 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2018-01-28 21:30:36,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:30:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2018-01-28 21:30:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:30:36,480 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:36,481 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:36,481 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-01-28 21:30:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash 99746917, now seen corresponding path program 1 times [2018-01-28 21:30:36,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:36,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:36,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:36,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:36,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:36,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:36,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:36,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:30:36,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:30:36,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:30:36,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:30:36,601 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 6 states. [2018-01-28 21:30:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:36,907 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-01-28 21:30:36,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:30:36,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-28 21:30:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:36,911 INFO L225 Difference]: With dead ends: 134 [2018-01-28 21:30:36,911 INFO L226 Difference]: Without dead ends: 132 [2018-01-28 21:30:36,911 INFO L533 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-01-28 21:30:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-28 21:30:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2018-01-28 21:30:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 21:30:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-01-28 21:30:36,926 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 20 [2018-01-28 21:30:36,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:36,926 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-01-28 21:30:36,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:30:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-01-28 21:30:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:30:36,927 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:36,927 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:36,928 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-01-28 21:30:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash 99746918, now seen corresponding path program 1 times [2018-01-28 21:30:36,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:36,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:36,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:36,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:36,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:36,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:37,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:37,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:30:37,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:30:37,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:30:37,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:30:37,080 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 6 states. [2018-01-28 21:30:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:37,226 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-01-28 21:30:37,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:30:37,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-28 21:30:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:37,228 INFO L225 Difference]: With dead ends: 130 [2018-01-28 21:30:37,228 INFO L226 Difference]: Without dead ends: 128 [2018-01-28 21:30:37,229 INFO L533 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-01-28 21:30:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-28 21:30:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-01-28 21:30:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-28 21:30:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2018-01-28 21:30:37,240 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 20 [2018-01-28 21:30:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:37,241 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-01-28 21:30:37,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:30:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-01-28 21:30:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:30:37,241 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:37,242 INFO L330 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] [2018-01-28 21:30:37,242 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-01-28 21:30:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1873747092, now seen corresponding path program 1 times [2018-01-28 21:30:37,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:37,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:37,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:37,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:37,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:37,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:37,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:37,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:30:37,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:30:37,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:30:37,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:30:37,338 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 4 states. [2018-01-28 21:30:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:37,514 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-01-28 21:30:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:30:37,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-28 21:30:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:37,516 INFO L225 Difference]: With dead ends: 126 [2018-01-28 21:30:37,516 INFO L226 Difference]: Without dead ends: 125 [2018-01-28 21:30:37,517 INFO L533 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-01-28 21:30:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-28 21:30:37,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-28 21:30:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 21:30:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-01-28 21:30:37,527 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 28 [2018-01-28 21:30:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:37,527 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-01-28 21:30:37,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:30:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-01-28 21:30:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:30:37,528 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:37,529 INFO L330 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] [2018-01-28 21:30:37,529 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-01-28 21:30:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1873747091, now seen corresponding path program 1 times [2018-01-28 21:30:37,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:37,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:37,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:37,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:37,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:37,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:37,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:37,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:30:37,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:30:37,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:30:37,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:30:37,632 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 4 states. [2018-01-28 21:30:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:37,695 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-01-28 21:30:37,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:30:37,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-28 21:30:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:37,696 INFO L225 Difference]: With dead ends: 125 [2018-01-28 21:30:37,697 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 21:30:37,697 INFO L533 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-01-28 21:30:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 21:30:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-28 21:30:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-28 21:30:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2018-01-28 21:30:37,703 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 28 [2018-01-28 21:30:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:37,703 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2018-01-28 21:30:37,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:30:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2018-01-28 21:30:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:30:37,704 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:37,704 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:37,704 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-01-28 21:30:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1834792800, now seen corresponding path program 1 times [2018-01-28 21:30:37,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:37,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:37,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:37,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:37,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:37,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:37,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:37,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:30:37,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:30:37,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:30:37,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:30:37,870 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 9 states. [2018-01-28 21:30:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:38,135 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2018-01-28 21:30:38,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:30:38,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-28 21:30:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:38,136 INFO L225 Difference]: With dead ends: 133 [2018-01-28 21:30:38,136 INFO L226 Difference]: Without dead ends: 132 [2018-01-28 21:30:38,137 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:30:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-28 21:30:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-01-28 21:30:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-28 21:30:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2018-01-28 21:30:38,146 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 32 [2018-01-28 21:30:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:38,146 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2018-01-28 21:30:38,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:30:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2018-01-28 21:30:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:30:38,147 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:38,147 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:38,148 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-01-28 21:30:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1834792801, now seen corresponding path program 1 times [2018-01-28 21:30:38,148 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:38,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:38,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:38,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:38,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:38,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:38,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:38,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:30:38,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:30:38,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:30:38,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:30:38,486 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 11 states. [2018-01-28 21:30:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:38,824 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2018-01-28 21:30:38,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:30:38,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-28 21:30:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:38,826 INFO L225 Difference]: With dead ends: 157 [2018-01-28 21:30:38,826 INFO L226 Difference]: Without dead ends: 156 [2018-01-28 21:30:38,826 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:30:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-28 21:30:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-01-28 21:30:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-28 21:30:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-01-28 21:30:38,834 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 32 [2018-01-28 21:30:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:38,835 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-01-28 21:30:38,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:30:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-01-28 21:30:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:30:38,836 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:38,836 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:38,836 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-01-28 21:30:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2134570172, now seen corresponding path program 1 times [2018-01-28 21:30:38,836 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:38,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:38,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:38,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:38,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:38,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:38,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:38,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:30:38,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:30:38,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:30:38,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:30:38,921 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 5 states. [2018-01-28 21:30:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:39,051 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-01-28 21:30:39,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:30:39,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 21:30:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:39,053 INFO L225 Difference]: With dead ends: 154 [2018-01-28 21:30:39,053 INFO L226 Difference]: Without dead ends: 153 [2018-01-28 21:30:39,054 INFO L533 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-01-28 21:30:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-28 21:30:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-01-28 21:30:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-28 21:30:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-01-28 21:30:39,064 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 37 [2018-01-28 21:30:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:39,065 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-01-28 21:30:39,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:30:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-01-28 21:30:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:30:39,066 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:39,066 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:39,066 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-01-28 21:30:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2134570173, now seen corresponding path program 1 times [2018-01-28 21:30:39,066 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:39,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:39,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:39,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:39,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:39,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:39,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:39,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 21:30:39,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:30:39,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:30:39,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:30:39,280 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 13 states. [2018-01-28 21:30:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:39,637 INFO L93 Difference]: Finished difference Result 170 states and 175 transitions. [2018-01-28 21:30:39,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:30:39,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-28 21:30:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:39,639 INFO L225 Difference]: With dead ends: 170 [2018-01-28 21:30:39,639 INFO L226 Difference]: Without dead ends: 169 [2018-01-28 21:30:39,640 INFO L533 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-01-28 21:30:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-28 21:30:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2018-01-28 21:30:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-28 21:30:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-01-28 21:30:39,651 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 37 [2018-01-28 21:30:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:39,652 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-01-28 21:30:39,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:30:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-01-28 21:30:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:30:39,653 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:39,653 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:39,654 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-01-28 21:30:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1747165868, now seen corresponding path program 1 times [2018-01-28 21:30:39,654 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:39,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:39,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:39,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:39,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:39,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:39,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:39,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:30:39,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:30:39,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:30:39,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:30:39,757 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 7 states. [2018-01-28 21:30:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:40,038 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2018-01-28 21:30:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:30:40,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-28 21:30:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:40,041 INFO L225 Difference]: With dead ends: 168 [2018-01-28 21:30:40,041 INFO L226 Difference]: Without dead ends: 166 [2018-01-28 21:30:40,041 INFO L533 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-01-28 21:30:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-28 21:30:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2018-01-28 21:30:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-28 21:30:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2018-01-28 21:30:40,053 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 38 [2018-01-28 21:30:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:40,053 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2018-01-28 21:30:40,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:30:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2018-01-28 21:30:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:30:40,054 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:40,054 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:40,055 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-01-28 21:30:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1747165869, now seen corresponding path program 1 times [2018-01-28 21:30:40,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:40,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:40,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:40,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:40,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:40,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:40,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:40,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:30:40,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:30:40,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:30:40,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:30:40,199 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 8 states. [2018-01-28 21:30:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:40,455 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2018-01-28 21:30:40,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:30:40,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-28 21:30:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:40,457 INFO L225 Difference]: With dead ends: 166 [2018-01-28 21:30:40,457 INFO L226 Difference]: Without dead ends: 164 [2018-01-28 21:30:40,458 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:30:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-28 21:30:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-01-28 21:30:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-28 21:30:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2018-01-28 21:30:40,465 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 38 [2018-01-28 21:30:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:40,465 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2018-01-28 21:30:40,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:30:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2018-01-28 21:30:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:30:40,466 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:40,466 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:40,466 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-01-28 21:30:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash -305814257, now seen corresponding path program 1 times [2018-01-28 21:30:40,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:40,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:40,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:40,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:40,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:40,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:40,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:40,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-28 21:30:40,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:30:40,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:30:40,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:30:40,764 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand 17 states. [2018-01-28 21:30:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:41,207 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-01-28 21:30:41,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 21:30:41,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-01-28 21:30:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:41,209 INFO L225 Difference]: With dead ends: 199 [2018-01-28 21:30:41,209 INFO L226 Difference]: Without dead ends: 198 [2018-01-28 21:30:41,210 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-28 21:30:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-28 21:30:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2018-01-28 21:30:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-28 21:30:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2018-01-28 21:30:41,226 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 40 [2018-01-28 21:30:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:41,226 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2018-01-28 21:30:41,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:30:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2018-01-28 21:30:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:30:41,227 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:41,228 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:41,228 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-01-28 21:30:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -305814256, now seen corresponding path program 1 times [2018-01-28 21:30:41,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:41,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:41,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:41,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:41,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:41,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:41,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:30:41,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-28 21:30:41,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 21:30:41,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 21:30:41,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:30:41,865 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand 16 states. [2018-01-28 21:30:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:42,727 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2018-01-28 21:30:42,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 21:30:42,728 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-01-28 21:30:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:42,729 INFO L225 Difference]: With dead ends: 205 [2018-01-28 21:30:42,729 INFO L226 Difference]: Without dead ends: 204 [2018-01-28 21:30:42,730 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-01-28 21:30:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-28 21:30:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-01-28 21:30:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-28 21:30:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 217 transitions. [2018-01-28 21:30:42,748 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 217 transitions. Word has length 40 [2018-01-28 21:30:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:42,749 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 217 transitions. [2018-01-28 21:30:42,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 21:30:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 217 transitions. [2018-01-28 21:30:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 21:30:42,750 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:42,750 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:42,751 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-01-28 21:30:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash 612782618, now seen corresponding path program 1 times [2018-01-28 21:30:42,751 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:42,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:42,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:42,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:42,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:42,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:42,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:30:42,951 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:30:42,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:43,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:30:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:43,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:30:43,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-01-28 21:30:43,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:30:43,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:30:43,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:30:43,212 INFO L87 Difference]: Start difference. First operand 203 states and 217 transitions. Second operand 13 states. [2018-01-28 21:30:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:44,502 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2018-01-28 21:30:44,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 21:30:44,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-01-28 21:30:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:44,504 INFO L225 Difference]: With dead ends: 223 [2018-01-28 21:30:44,504 INFO L226 Difference]: Without dead ends: 222 [2018-01-28 21:30:44,505 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:30:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-28 21:30:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2018-01-28 21:30:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-28 21:30:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2018-01-28 21:30:44,522 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 55 [2018-01-28 21:30:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:44,522 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2018-01-28 21:30:44,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:30:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2018-01-28 21:30:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 21:30:44,523 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:44,523 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:44,523 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-01-28 21:30:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash 612782619, now seen corresponding path program 1 times [2018-01-28 21:30:44,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:44,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:44,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:44,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:44,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:44,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:45,002 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 19 DAG size of output 18 [2018-01-28 21:30:45,148 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 20 DAG size of output 19 [2018-01-28 21:30:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:45,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:30:45,273 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:30:45,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:45,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:30:45,339 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-01-28 21:30:45,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:45,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:45,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:30:45,489 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-01-28 21:30:45,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:45,493 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-01-28 21:30:45,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:45,496 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-01-28 21:30:45,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-28 21:30:45,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:45,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:45,572 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-01-28 21:30:45,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:45,576 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-01-28 21:30:45,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-01-28 21:30:45,578 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|)))) is different from true [2018-01-28 21:30:45,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:45,592 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-01-28 21:30:45,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:45,617 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-01-28 21:30:45,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-01-28 21:30:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:45,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:30:45,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-28 21:30:45,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 21:30:45,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 21:30:45,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=643, Unknown=10, NotChecked=52, Total=812 [2018-01-28 21:30:45,719 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand 29 states. [2018-01-28 21:30:46,368 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (= 0 (select |c_old(#valid)| insert_sub_~sub~10.base)))) (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|))))) is different from true [2018-01-28 21:30:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:47,465 INFO L93 Difference]: Finished difference Result 311 states and 347 transitions. [2018-01-28 21:30:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 21:30:47,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-01-28 21:30:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:47,470 INFO L225 Difference]: With dead ends: 311 [2018-01-28 21:30:47,470 INFO L226 Difference]: Without dead ends: 309 [2018-01-28 21:30:47,471 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=330, Invalid=1800, Unknown=40, NotChecked=182, Total=2352 [2018-01-28 21:30:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-28 21:30:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 228. [2018-01-28 21:30:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-28 21:30:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 249 transitions. [2018-01-28 21:30:47,496 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 249 transitions. Word has length 55 [2018-01-28 21:30:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:47,497 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 249 transitions. [2018-01-28 21:30:47,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 21:30:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 249 transitions. [2018-01-28 21:30:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 21:30:47,498 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:47,498 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:30:47,498 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-01-28 21:30:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1502158230, now seen corresponding path program 1 times [2018-01-28 21:30:47,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:47,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:47,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:47,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:47,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:47,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:47,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:30:47,858 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:30:47,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:47,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:30:48,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:48,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:48,047 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-01-28 21:30:48,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:48,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:48,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:48,058 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-01-28 21:30:48,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:48,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:48,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2018-01-28 21:30:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:48,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:30:48,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 26 [2018-01-28 21:30:48,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 21:30:48,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 21:30:48,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2018-01-28 21:30:48,170 INFO L87 Difference]: Start difference. First operand 228 states and 249 transitions. Second operand 27 states. [2018-01-28 21:30:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:30:48,919 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-01-28 21:30:48,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:30:48,919 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2018-01-28 21:30:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:30:48,921 INFO L225 Difference]: With dead ends: 248 [2018-01-28 21:30:48,921 INFO L226 Difference]: Without dead ends: 246 [2018-01-28 21:30:48,922 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 21:30:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-28 21:30:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 227. [2018-01-28 21:30:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-28 21:30:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 246 transitions. [2018-01-28 21:30:48,946 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 246 transitions. Word has length 67 [2018-01-28 21:30:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:30:48,947 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 246 transitions. [2018-01-28 21:30:48,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 21:30:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 246 transitions. [2018-01-28 21:30:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:30:48,948 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:30:48,948 INFO L330 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, 1, 1] [2018-01-28 21:30:48,948 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-01-28 21:30:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash -564781586, now seen corresponding path program 1 times [2018-01-28 21:30:48,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:30:48,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:30:48,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:48,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:48,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:30:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:48,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:30:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:50,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:30:50,687 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:30:50,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:30:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:30:50,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:30:50,923 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-01-28 21:30:50,925 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-01-28 21:30:50,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,934 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-01-28 21:30:50,935 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-01-28 21:30:50,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-28 21:30:50,952 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 24 treesize of output 19 [2018-01-28 21:30:50,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:50,958 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-01-28 21:30:50,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,974 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 24 treesize of output 19 [2018-01-28 21:30:50,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:50,979 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-01-28 21:30:50,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:50,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:44 [2018-01-28 21:30:53,118 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-01-28 21:30:53,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:53,134 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-01-28 21:30:53,135 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-01-28 21:30:53,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:53,136 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:53,147 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:53,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:53,155 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-01-28 21:30:53,155 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:47, output treesize:12 [2018-01-28 21:30:54,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:30:54,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:30:54,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:30:54,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:30:54,454 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-01-28 21:30:54,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:156, output treesize:230 [2018-01-28 21:30:54,756 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 72 DAG size of output 54 [2018-01-28 21:30:54,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:54,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:54,764 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-01-28 21:30:54,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:54,811 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-01-28 21:30:54,814 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-01-28 21:30:54,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:54,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:54,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, 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-01-28 21:30:54,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:54,871 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 67 treesize of output 51 [2018-01-28 21:30:54,871 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:54,888 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-01-28 21:30:54,897 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-01-28 21:30:54,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:54,900 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-01-28 21:30:54,901 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:54,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:54,927 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-01-28 21:30:54,928 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-28 21:30:54,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:30:54,976 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-01-28 21:30:54,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:54,985 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-01-28 21:30:54,986 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-28 21:30:55,006 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:30:55,012 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-01-28 21:30:55,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,021 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-01-28 21:30:55,022 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-28 21:30:55,041 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:30:55,047 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-01-28 21:30:55,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,055 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-01-28 21:30:55,056 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-28 21:30:55,077 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:30:55,131 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-28 21:30:55,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-28 21:30:55,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-28 21:30:55,306 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-01-28 21:30:55,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,309 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-01-28 21:30:55,309 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:55,313 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:55,377 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-01-28 21:30:55,377 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:273, output treesize:427 [2018-01-28 21:30:55,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,846 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 77 treesize of output 91 [2018-01-28 21:30:55,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:55,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:55,886 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 87 treesize of output 101 [2018-01-28 21:30:55,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:55,926 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-01-28 21:30:55,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:165, output treesize:181 [2018-01-28 21:30:56,208 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 100 treesize of output 98 [2018-01-28 21:30:56,211 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-01-28 21:30:56,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,310 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 110 treesize of output 108 [2018-01-28 21:30:56,313 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-01-28 21:30:56,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,386 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-01-28 21:30:56,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:211, output treesize:189 [2018-01-28 21:30:56,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:56,834 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 98 treesize of output 78 [2018-01-28 21:30:56,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:56,838 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 46 treesize of output 20 [2018-01-28 21:30:56,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:56,866 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-01-28 21:30:56,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:56,921 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 108 treesize of output 86 [2018-01-28 21:30:56,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:56,925 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 51 treesize of output 30 [2018-01-28 21:30:56,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:30:56,943 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-01-28 21:30:56,943 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,955 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:30:56,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 21:30:56,978 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:207, output treesize:57 [2018-01-28 21:30:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:30:57,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:30:57,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 66 [2018-01-28 21:30:57,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-01-28 21:30:57,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-01-28 21:30:57,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=4135, Unknown=59, NotChecked=0, Total=4422 [2018-01-28 21:30:57,239 INFO L87 Difference]: Start difference. First operand 227 states and 246 transitions. Second operand 67 states. [2018-01-28 21:31:02,506 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 74 DAG size of output 70 [2018-01-28 21:31:03,953 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 143 DAG size of output 72 [2018-01-28 21:31:04,321 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 135 DAG size of output 83 [2018-01-28 21:31:06,498 WARN L146 SmtUtils]: Spent 2101ms on a formula simplification. DAG size of input: 99 DAG size of output 73 [2018-01-28 21:31:08,663 WARN L146 SmtUtils]: Spent 2091ms on a formula simplification. DAG size of input: 101 DAG size of output 76 [2018-01-28 21:31:10,922 WARN L146 SmtUtils]: Spent 2107ms on a formula simplification. DAG size of input: 151 DAG size of output 80 [2018-01-28 21:31:11,882 WARN L146 SmtUtils]: Spent 826ms on a formula simplification. DAG size of input: 161 DAG size of output 88 [2018-01-28 21:31:12,101 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 49 DAG size of output 45 [2018-01-28 21:31:12,484 WARN L146 SmtUtils]: Spent 324ms on a formula simplification. DAG size of input: 55 DAG size of output 47 [2018-01-28 21:31:17,808 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 94 DAG size of output 84 [2018-01-28 21:31:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:20,285 INFO L93 Difference]: Finished difference Result 290 states and 317 transitions. [2018-01-28 21:31:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-28 21:31:20,285 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 69 [2018-01-28 21:31:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:20,287 INFO L225 Difference]: With dead ends: 290 [2018-01-28 21:31:20,288 INFO L226 Difference]: Without dead ends: 289 [2018-01-28 21:31:20,291 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4681 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=983, Invalid=14902, Unknown=117, NotChecked=0, Total=16002 [2018-01-28 21:31:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-01-28 21:31:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 256. [2018-01-28 21:31:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-28 21:31:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 279 transitions. [2018-01-28 21:31:20,315 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 279 transitions. Word has length 69 [2018-01-28 21:31:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:20,316 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 279 transitions. [2018-01-28 21:31:20,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-01-28 21:31:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 279 transitions. [2018-01-28 21:31:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:31:20,316 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:20,317 INFO L330 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, 1, 1] [2018-01-28 21:31:20,317 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-01-28 21:31:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -564781585, now seen corresponding path program 1 times [2018-01-28 21:31:20,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:20,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:20,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:20,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:20,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:20,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:22,272 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 47 DAG size of output 46 [2018-01-28 21:31:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:22,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:31:22,787 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:31:22,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:22,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:31:22,991 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-01-28 21:31:22,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 10 treesize of output 9 [2018-01-28 21:31:22,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:22,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,005 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-01-28 21:31:23,007 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-01-28 21:31:23,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-28 21:31:23,060 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-01-28 21:31:23,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:23,063 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-01-28 21:31:23,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,077 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-01-28 21:31:23,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:23,080 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-01-28 21:31:23,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-28 21:31:23,223 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-01-28 21:31:23,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-01-28 21:31:23,406 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-01-28 21:31:23,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,431 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-01-28 21:31:23,433 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-01-28 21:31:23,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,446 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-01-28 21:31:23,448 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-01-28 21:31:23,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:23,471 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-01-28 21:31:23,471 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:53, output treesize:12 [2018-01-28 21:31:25,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:31:25,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:31:25,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:31:25,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:31:25,550 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-01-28 21:31:25,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:289, output treesize:467 [2018-01-28 21:31:26,570 WARN L146 SmtUtils]: Spent 704ms on a formula simplification. DAG size of input: 119 DAG size of output 71 [2018-01-28 21:31:26,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:26,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:26,585 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-01-28 21:31:26,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:26,745 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-01-28 21:31:26,751 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-01-28 21:31:26,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:26,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:26,838 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-01-28 21:31:26,976 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-01-28 21:31:26,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:26,985 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 256 treesize of output 232 [2018-01-28 21:31:26,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,056 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-01-28 21:31:27,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,067 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-01-28 21:31:27,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,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-01-28 21:31:27,088 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,121 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,175 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-01-28 21:31:27,180 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-01-28 21:31:27,181 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,211 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,235 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,293 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,360 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-01-28 21:31:27,363 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-01-28 21:31:27,363 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,396 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-01-28 21:31:27,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,442 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-01-28 21:31:27,443 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,443 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-28 21:31:27,444 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,475 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 108 [2018-01-28 21:31:27,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,480 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-01-28 21:31:27,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,489 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-01-28 21:31:27,489 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,498 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,516 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-01-28 21:31:27,519 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-01-28 21:31:27,520 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,535 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,543 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,552 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,561 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:27,585 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-01-28 21:31:27,586 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:502, output treesize:129 [2018-01-28 21:31:27,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:27,959 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-01-28 21:31:27,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:28,002 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-01-28 21:31:28,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:28,026 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-01-28 21:31:28,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:129 [2018-01-28 21:31:28,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,397 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-01-28 21:31:28,401 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-01-28 21:31:28,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:28,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,496 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-01-28 21:31:28,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-28 21:31:28,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:31:28,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,643 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 120 [2018-01-28 21:31:28,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,687 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-01-28 21:31:28,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 21:31:28,717 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:28,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,740 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-01-28 21:31:28,744 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-01-28 21:31:28,744 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:28,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,825 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-01-28 21:31:28,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-01-28 21:31:28,887 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:31:28,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,893 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 139 [2018-01-28 21:31:28,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:28,917 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-01-28 21:31:28,919 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 21:31:28,974 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 21:31:29,112 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-01-28 21:31:29,112 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:159, output treesize:708 [2018-01-28 21:31:29,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:29,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:29,749 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 130 treesize of output 109 [2018-01-28 21:31:29,763 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 50 treesize of output 48 [2018-01-28 21:31:29,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:31:29,788 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 42 treesize of output 23 [2018-01-28 21:31:29,788 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:29,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:29,832 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 57 treesize of output 53 [2018-01-28 21:31:29,854 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 26 treesize of output 54 [2018-01-28 21:31:29,857 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-01-28 21:31:29,880 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-01-28 21:31:29,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:29,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 89 [2018-01-28 21:31:29,915 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-01-28 21:31:29,915 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,928 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-01-28 21:31:29,928 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,938 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:29,957 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 60 treesize of output 55 [2018-01-28 21:31:29,959 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 32 treesize of output 10 [2018-01-28 21:31:29,960 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,968 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-01-28 21:31:29,968 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,973 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:29,986 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:244, output treesize:16 [2018-01-28 21:31:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:30,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:31:30,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 71 [2018-01-28 21:31:30,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-01-28 21:31:30,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-01-28 21:31:30,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4851, Unknown=0, NotChecked=0, Total=5112 [2018-01-28 21:31:30,243 INFO L87 Difference]: Start difference. First operand 256 states and 279 transitions. Second operand 72 states. [2018-01-28 21:31:32,960 WARN L146 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 90 DAG size of output 83 [2018-01-28 21:31:34,991 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 128 DAG size of output 82 [2018-01-28 21:31:35,660 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 163 DAG size of output 94 [2018-01-28 21:31:36,998 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 99 DAG size of output 56 [2018-01-28 21:31:37,556 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 102 DAG size of output 73 [2018-01-28 21:31:38,196 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-01-28 21:31:41,387 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 89 DAG size of output 88 [2018-01-28 21:31:48,134 WARN L146 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 98 DAG size of output 71 [2018-01-28 21:31:48,529 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-01-28 21:31:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:49,276 INFO L93 Difference]: Finished difference Result 292 states and 315 transitions. [2018-01-28 21:31:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-01-28 21:31:49,277 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 69 [2018-01-28 21:31:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:49,278 INFO L225 Difference]: With dead ends: 292 [2018-01-28 21:31:49,278 INFO L226 Difference]: Without dead ends: 291 [2018-01-28 21:31:49,281 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5596 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1158, Invalid=17738, Unknown=10, NotChecked=0, Total=18906 [2018-01-28 21:31:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-28 21:31:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 225. [2018-01-28 21:31:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-28 21:31:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 242 transitions. [2018-01-28 21:31:49,310 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 242 transitions. Word has length 69 [2018-01-28 21:31:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:49,310 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 242 transitions. [2018-01-28 21:31:49,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-01-28 21:31:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 242 transitions. [2018-01-28 21:31:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-28 21:31:49,311 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:49,311 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:49,311 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-01-28 21:31:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash -464058811, now seen corresponding path program 1 times [2018-01-28 21:31:49,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:49,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:49,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:49,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:49,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:49,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:50,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:31:50,029 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:31:50,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:50,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:31:50,209 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-01-28 21:31:50,211 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-01-28 21:31:50,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,221 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-01-28 21:31:50,222 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-01-28 21:31:50,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-28 21:31:50,271 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-01-28 21:31:50,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:50,274 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-01-28 21:31:50,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,290 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-01-28 21:31:50,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:50,292 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-01-28 21:31:50,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-28 21:31:50,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:50,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:50,443 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-01-28 21:31:50,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-01-28 21:31:50,540 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-01-28 21:31:50,556 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-01-28 21:31:50,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,576 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-01-28 21:31:50,578 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-01-28 21:31:50,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:32 [2018-01-28 21:31:50,698 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-01-28 21:31:50,699 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-01-28 21:31:50,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,706 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-01-28 21:31:50,707 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-01-28 21:31:50,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:50,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:12 [2018-01-28 21:31:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:50,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:31:50,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 42 [2018-01-28 21:31:50,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-28 21:31:50,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-28 21:31:50,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2018-01-28 21:31:50,853 INFO L87 Difference]: Start difference. First operand 225 states and 242 transitions. Second operand 43 states. [2018-01-28 21:31:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:52,254 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2018-01-28 21:31:52,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 21:31:52,254 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 75 [2018-01-28 21:31:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:52,255 INFO L225 Difference]: With dead ends: 246 [2018-01-28 21:31:52,255 INFO L226 Difference]: Without dead ends: 245 [2018-01-28 21:31:52,256 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=333, Invalid=3699, Unknown=0, NotChecked=0, Total=4032 [2018-01-28 21:31:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-28 21:31:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 225. [2018-01-28 21:31:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-28 21:31:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 241 transitions. [2018-01-28 21:31:52,277 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 241 transitions. Word has length 75 [2018-01-28 21:31:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:52,278 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 241 transitions. [2018-01-28 21:31:52,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-28 21:31:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 241 transitions. [2018-01-28 21:31:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-28 21:31:52,279 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:52,279 INFO L330 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, 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] [2018-01-28 21:31:52,279 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-01-28 21:31:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash -536404132, now seen corresponding path program 1 times [2018-01-28 21:31:52,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:52,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:52,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:52,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:52,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:52,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-28 21:31:52,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:31:52,791 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:31:52,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:52,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:31:52,858 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-01-28 21:31:52,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:52,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:52,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:31:53,004 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-01-28 21:31:53,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,007 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-01-28 21:31:53,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,008 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-01-28 21:31:53,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-28 21:31:53,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:53,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:53,166 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-01-28 21:31:53,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,171 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-01-28 21:31:53,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:19 [2018-01-28 21:31:53,207 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-01-28 21:31:53,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,211 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-01-28 21:31:53,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,212 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-01-28 21:31:53,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-28 21:31:53,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:53,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:53,259 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-01-28 21:31:53,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,263 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-01-28 21:31:53,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:18 [2018-01-28 21:31:53,264 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_32 Int) (insert_sub_~sub~10.base Int)) (and (= (store (store |c_old(#length)| insert_sub_~sub~10.base 12) v_prenex_32 12) |c_#length|) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|)) (not (= v_prenex_32 |c_create_sub_list_#in~sub.base|)))) is different from true [2018-01-28 21:31:53,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:53,269 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-01-28 21:31:53,271 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-01-28 21:31:53,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:53,282 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-01-28 21:31:53,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2018-01-28 21:31:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2018-01-28 21:31:53,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:31:53,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-01-28 21:31:53,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-28 21:31:53,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-28 21:31:53,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1315, Unknown=10, NotChecked=74, Total=1560 [2018-01-28 21:31:53,389 INFO L87 Difference]: Start difference. First operand 225 states and 241 transitions. Second operand 40 states. [2018-01-28 21:31:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:56,011 INFO L93 Difference]: Finished difference Result 388 states and 445 transitions. [2018-01-28 21:31:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-28 21:31:56,011 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-01-28 21:31:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:56,013 INFO L225 Difference]: With dead ends: 388 [2018-01-28 21:31:56,013 INFO L226 Difference]: Without dead ends: 387 [2018-01-28 21:31:56,015 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1949 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=731, Invalid=5882, Unknown=33, NotChecked=160, Total=6806 [2018-01-28 21:31:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-28 21:31:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 250. [2018-01-28 21:31:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-28 21:31:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 276 transitions. [2018-01-28 21:31:56,047 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 276 transitions. Word has length 84 [2018-01-28 21:31:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:56,047 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 276 transitions. [2018-01-28 21:31:56,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-28 21:31:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 276 transitions. [2018-01-28 21:31:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-28 21:31:56,054 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:56,054 INFO L330 BasicCegarLoop]: trace histogram [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, 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] [2018-01-28 21:31:56,054 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-01-28 21:31:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash 826013570, now seen corresponding path program 1 times [2018-01-28 21:31:56,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:56,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:56,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:56,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:56,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:56,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-28 21:31:56,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:56,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 21:31:56,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 21:31:56,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 21:31:56,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:31:56,348 INFO L87 Difference]: Start difference. First operand 250 states and 276 transitions. Second operand 14 states. [2018-01-28 21:31:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:56,844 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2018-01-28 21:31:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:31:56,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-01-28 21:31:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:56,846 INFO L225 Difference]: With dead ends: 312 [2018-01-28 21:31:56,846 INFO L226 Difference]: Without dead ends: 311 [2018-01-28 21:31:56,846 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-01-28 21:31:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-28 21:31:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 277. [2018-01-28 21:31:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-28 21:31:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 313 transitions. [2018-01-28 21:31:56,882 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 313 transitions. Word has length 91 [2018-01-28 21:31:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:56,882 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 313 transitions. [2018-01-28 21:31:56,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 21:31:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 313 transitions. [2018-01-28 21:31:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-28 21:31:56,884 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:56,884 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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-01-28 21:31:56,884 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-01-28 21:31:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1900611517, now seen corresponding path program 1 times [2018-01-28 21:31:56,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:56,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:56,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:56,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:56,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:56,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-28 21:31:57,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:31:57,357 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:31:57,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:57,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:31:57,434 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-01-28 21:31:57,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:31:57,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:57,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:57,448 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-01-28 21:31:57,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-01-28 21:31:57,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:57,540 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-01-28 21:31:57,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,541 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-01-28 21:31:57,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 21:31:57,590 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_insert_sub_~sub~10.base_BEFORE_CALL_3 Int)) (= (select |c_#valid| v_insert_sub_~sub~10.base_BEFORE_CALL_3) 1)) (exists ((insert_sub_~sub~10.base Int)) (and (= 0 (select |c_old(#valid)| insert_sub_~sub~10.base)) (= (store |c_old(#valid)| insert_sub_~sub~10.base 1) |c_#valid|)))) is different from true [2018-01-28 21:31:57,677 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-01-28 21:31:57,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,679 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-01-28 21:31:57,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 21:31:57,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:57,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:57,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:57,749 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 25 treesize of output 40 [2018-01-28 21:31:57,763 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 28 treesize of output 33 [2018-01-28 21:31:57,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,780 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-01-28 21:31:57,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 [2018-01-28 21:31:57,823 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-01-28 21:31:57,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,824 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-01-28 21:31:57,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 21:31:57,869 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 22 treesize of output 33 [2018-01-28 21:31:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:57,877 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-01-28 21:31:57,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2018-01-28 21:31:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 53 trivial. 4 not checked. [2018-01-28 21:31:57,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:31:57,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26] total 33 [2018-01-28 21:31:57,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-28 21:31:57,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-28 21:31:57,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=898, Unknown=14, NotChecked=62, Total=1122 [2018-01-28 21:31:57,996 INFO L87 Difference]: Start difference. First operand 277 states and 313 transitions. Second operand 34 states. [2018-01-28 21:31:58,996 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 33 DAG size of output 25 [2018-01-28 21:31:59,258 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 43 DAG size of output 27 [2018-01-28 21:32:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:32:00,192 INFO L93 Difference]: Finished difference Result 349 states and 414 transitions. [2018-01-28 21:32:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-28 21:32:00,192 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 120 [2018-01-28 21:32:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:32:00,194 INFO L225 Difference]: With dead ends: 349 [2018-01-28 21:32:00,194 INFO L226 Difference]: Without dead ends: 348 [2018-01-28 21:32:00,194 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 112 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=418, Invalid=2328, Unknown=14, NotChecked=102, Total=2862 [2018-01-28 21:32:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-28 21:32:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 277. [2018-01-28 21:32:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-28 21:32:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 313 transitions. [2018-01-28 21:32:00,232 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 313 transitions. Word has length 120 [2018-01-28 21:32:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:32:00,233 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 313 transitions. [2018-01-28 21:32:00,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-28 21:32:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 313 transitions. [2018-01-28 21:32:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-28 21:32:00,234 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:32:00,234 INFO L330 BasicCegarLoop]: trace histogram [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, 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] [2018-01-28 21:32:00,234 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-01-28 21:32:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash 826013571, now seen corresponding path program 1 times [2018-01-28 21:32:00,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:32:00,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:32:00,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:32:00,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:32:00,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:32:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:32:00,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:32:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-28 21:32:00,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:32:00,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 21:32:00,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 21:32:00,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 21:32:00,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:32:00,891 INFO L87 Difference]: Start difference. First operand 277 states and 313 transitions. Second operand 14 states. [2018-01-28 21:32:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:32:01,574 INFO L93 Difference]: Finished difference Result 305 states and 354 transitions. [2018-01-28 21:32:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 21:32:01,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-01-28 21:32:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:32:01,575 INFO L225 Difference]: With dead ends: 305 [2018-01-28 21:32:01,575 INFO L226 Difference]: Without dead ends: 304 [2018-01-28 21:32:01,576 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:32:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-28 21:32:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-01-28 21:32:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-28 21:32:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 350 transitions. [2018-01-28 21:32:01,613 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 350 transitions. Word has length 91 [2018-01-28 21:32:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:32:01,613 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 350 transitions. [2018-01-28 21:32:01,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 21:32:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 350 transitions. [2018-01-28 21:32:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-28 21:32:01,614 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:32:01,614 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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-01-28 21:32:01,614 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-01-28 21:32:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1900611516, now seen corresponding path program 1 times [2018-01-28 21:32:01,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:32:01,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:32:01,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:32:01,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:32:01,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:32:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:32:01,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:32:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-28 21:32:02,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:32:02,292 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:32:02,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:32:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:32:02,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:32:02,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 6 treesize of output 5 [2018-01-28 21:32:02,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,370 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-01-28 21:32:02,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:32:02,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:32:02,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:32:02,478 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-01-28 21:32:02,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:32:02,488 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-01-28 21:32:02,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-01-28 21:32:02,668 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-01-28 21:32:02,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,671 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-01-28 21:32:02,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:32:02,672 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-01-28 21:32:02,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-28 21:32:02,858 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#length)_BEFORE_CALL_10| term size 11 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-28 21:32:02,861 INFO L168 Benchmark]: Toolchain (without parser) took 87949.69 ms. Allocated memory was 304.6 MB in the beginning and 757.6 MB in the end (delta: 453.0 MB). Free memory was 264.6 MB in the beginning and 636.6 MB in the end (delta: -372.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:32:02,862 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:32:02,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.66 ms. Allocated memory is still 304.6 MB. Free memory was 263.6 MB in the beginning and 252.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:32:02,862 INFO L168 Benchmark]: Boogie Preprocessor took 45.93 ms. Allocated memory is still 304.6 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:32:02,863 INFO L168 Benchmark]: RCFGBuilder took 492.44 ms. Allocated memory is still 304.6 MB. Free memory was 250.5 MB in the beginning and 217.6 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:32:02,863 INFO L168 Benchmark]: TraceAbstraction took 87191.83 ms. Allocated memory was 304.6 MB in the beginning and 757.6 MB in the end (delta: 453.0 MB). Free memory was 216.6 MB in the beginning and 636.6 MB in the end (delta: -420.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:32:02,864 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.66 ms. Allocated memory is still 304.6 MB. Free memory was 263.6 MB in the beginning and 252.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.93 ms. Allocated memory is still 304.6 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 492.44 ms. Allocated memory is still 304.6 MB. Free memory was 250.5 MB in the beginning and 217.6 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 87191.83 ms. Allocated memory was 304.6 MB in the beginning and 757.6 MB in the end (delta: 453.0 MB). Free memory was 216.6 MB in the beginning and 636.6 MB in the end (delta: -420.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#length)_BEFORE_CALL_10| term size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#length)_BEFORE_CALL_10| term size 11: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-32-02-869.csv Received shutdown request...