java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:01:23,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:01:23,141 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:01:23,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:01:23,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:01:23,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:01:23,155 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:01:23,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:01:23,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:01:23,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:01:23,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:01:23,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:01:23,160 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:01:23,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:01:23,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:01:23,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:01:23,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:01:23,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:01:23,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:01:23,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:01:23,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:01:23,169 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:01:23,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:01:23,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:01:23,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:01:23,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:01:23,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:01:23,172 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:01:23,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:01:23,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:01:23,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:01:23,173 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 01:01:23,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:01:23,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:01:23,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:01:23,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:01:23,184 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:01:23,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:01:23,184 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:01:23,184 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:01:23,184 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:01:23,185 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:01:23,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:01:23,185 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:01:23,185 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:01:23,185 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:01:23,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:01:23,185 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:01:23,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:01:23,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:01:23,186 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:01:23,186 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:01:23,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:01:23,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:01:23,187 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 01:01:23,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 01:01:23,187 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 01:01:23,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:01:23,222 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:01:23,225 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:01:23,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:01:23,227 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:01:23,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-02-04 01:01:23,369 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:01:23,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:01:23,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:01:23,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:01:23,375 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:01:23,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb24ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23, skipping insertion in model container [2018-02-04 01:01:23,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,391 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:01:23,417 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:01:23,506 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:01:23,519 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:01:23,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23 WrapperNode [2018-02-04 01:01:23,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:01:23,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:01:23,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:01:23,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:01:23,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... [2018-02-04 01:01:23,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:01:23,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:01:23,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:01:23,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:01:23,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:01:23,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:01:23,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:01:23,584 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 01:01:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-02-04 01:01:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-02-04 01:01:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-02-04 01:01:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 01:01:23,585 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-02-04 01:01:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-02-04 01:01:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-02-04 01:01:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:01:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:01:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:01:23,903 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:01:23,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:01:23 BoogieIcfgContainer [2018-02-04 01:01:23,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:01:23,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:01:23,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:01:23,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:01:23,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:01:23" (1/3) ... [2018-02-04 01:01:23,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688bbb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:01:23, skipping insertion in model container [2018-02-04 01:01:23,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:01:23" (2/3) ... [2018-02-04 01:01:23,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688bbb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:01:23, skipping insertion in model container [2018-02-04 01:01:23,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:01:23" (3/3) ... [2018-02-04 01:01:23,910 INFO L107 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-02-04 01:01:23,915 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:01:23,924 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 01:01:23,956 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:01:23,956 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:01:23,956 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 01:01:23,956 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 01:01:23,956 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:01:23,957 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:01:23,957 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:01:23,957 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:01:23,958 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:01:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-02-04 01:01:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 01:01:23,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:23,979 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:23,979 INFO L371 AbstractCegarLoop]: === Iteration 1 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash 436525791, now seen corresponding path program 1 times [2018-02-04 01:01:23,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:23,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:24,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:24,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:24,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:24,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:24,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:01:24,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:01:24,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:01:24,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:01:24,128 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-02-04 01:01:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:24,286 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-04 01:01:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:01:24,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 01:01:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:24,293 INFO L225 Difference]: With dead ends: 120 [2018-02-04 01:01:24,293 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 01:01:24,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:01:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 01:01:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-04 01:01:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 01:01:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-04 01:01:24,326 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 7 [2018-02-04 01:01:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:24,327 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-04 01:01:24,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:01:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-04 01:01:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 01:01:24,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:24,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:24,327 INFO L371 AbstractCegarLoop]: === Iteration 2 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 436525792, now seen corresponding path program 1 times [2018-02-04 01:01:24,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:24,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:24,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:24,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:24,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:24,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:24,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:01:24,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:01:24,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:01:24,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:01:24,387 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2018-02-04 01:01:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:24,483 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-02-04 01:01:24,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:01:24,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 01:01:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:24,484 INFO L225 Difference]: With dead ends: 114 [2018-02-04 01:01:24,484 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 01:01:24,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:01:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 01:01:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 01:01:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 01:01:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-02-04 01:01:24,493 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 7 [2018-02-04 01:01:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:24,493 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-02-04 01:01:24,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:01:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-02-04 01:01:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 01:01:24,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:24,494 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:24,494 INFO L371 AbstractCegarLoop]: === Iteration 3 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -711243012, now seen corresponding path program 1 times [2018-02-04 01:01:24,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:24,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:24,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:24,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:24,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:24,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:24,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:01:24,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:01:24,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:01:24,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:01:24,545 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 5 states. [2018-02-04 01:01:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:24,601 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2018-02-04 01:01:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:01:24,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 01:01:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:24,604 INFO L225 Difference]: With dead ends: 150 [2018-02-04 01:01:24,604 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 01:01:24,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:01:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 01:01:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-02-04 01:01:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 01:01:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2018-02-04 01:01:24,613 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 15 [2018-02-04 01:01:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:24,613 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2018-02-04 01:01:24,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:01:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-02-04 01:01:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 01:01:24,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:24,613 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:24,613 INFO L371 AbstractCegarLoop]: === Iteration 4 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash -714029430, now seen corresponding path program 1 times [2018-02-04 01:01:24,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:24,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:24,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:24,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:24,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:24,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:24,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:01:24,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:01:24,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:01:24,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:01:24,647 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 4 states. [2018-02-04 01:01:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:24,746 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-02-04 01:01:24,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:01:24,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 01:01:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:24,748 INFO L225 Difference]: With dead ends: 154 [2018-02-04 01:01:24,748 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 01:01:24,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:01:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 01:01:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-02-04 01:01:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 01:01:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-02-04 01:01:24,758 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 15 [2018-02-04 01:01:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:24,759 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-02-04 01:01:24,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:01:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-02-04 01:01:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 01:01:24,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:24,759 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:24,760 INFO L371 AbstractCegarLoop]: === Iteration 5 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash -714029429, now seen corresponding path program 1 times [2018-02-04 01:01:24,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:24,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:24,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,761 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:24,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:24,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:24,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:24,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:01:24,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:01:24,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:01:24,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:01:24,816 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 4 states. [2018-02-04 01:01:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:24,907 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2018-02-04 01:01:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:01:24,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 01:01:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:24,908 INFO L225 Difference]: With dead ends: 155 [2018-02-04 01:01:24,908 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 01:01:24,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:01:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 01:01:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-02-04 01:01:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 01:01:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-02-04 01:01:24,914 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 15 [2018-02-04 01:01:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:24,915 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-02-04 01:01:24,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:01:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-02-04 01:01:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:01:24,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:24,915 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:24,916 INFO L371 AbstractCegarLoop]: === Iteration 6 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485069, now seen corresponding path program 1 times [2018-02-04 01:01:24,916 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:24,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:24,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,917 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:24,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:24,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:24,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:24,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:01:24,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:01:24,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:01:24,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:01:24,992 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 7 states. [2018-02-04 01:01:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:25,172 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2018-02-04 01:01:25,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:01:25,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 01:01:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:25,173 INFO L225 Difference]: With dead ends: 162 [2018-02-04 01:01:25,173 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 01:01:25,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:01:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 01:01:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 133. [2018-02-04 01:01:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 01:01:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-02-04 01:01:25,181 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 17 [2018-02-04 01:01:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:25,181 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-02-04 01:01:25,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:01:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-02-04 01:01:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:01:25,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:25,182 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:25,182 INFO L371 AbstractCegarLoop]: === Iteration 7 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485070, now seen corresponding path program 1 times [2018-02-04 01:01:25,182 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:25,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:25,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,183 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:25,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:25,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:25,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:25,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:01:25,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:01:25,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:01:25,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:01:25,253 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 4 states. [2018-02-04 01:01:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:25,332 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-02-04 01:01:25,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:01:25,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 01:01:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:25,333 INFO L225 Difference]: With dead ends: 132 [2018-02-04 01:01:25,333 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 01:01:25,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:01:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 01:01:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-04 01:01:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 01:01:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-02-04 01:01:25,336 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 17 [2018-02-04 01:01:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:25,336 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-02-04 01:01:25,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:01:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-02-04 01:01:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:01:25,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:25,336 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:25,337 INFO L371 AbstractCegarLoop]: === Iteration 8 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937321, now seen corresponding path program 1 times [2018-02-04 01:01:25,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:25,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:25,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:25,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:25,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:25,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:25,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:01:25,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:01:25,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:01:25,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:01:25,377 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-02-04 01:01:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:25,525 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2018-02-04 01:01:25,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:01:25,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 01:01:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:25,526 INFO L225 Difference]: With dead ends: 155 [2018-02-04 01:01:25,526 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 01:01:25,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 01:01:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-02-04 01:01:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 01:01:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2018-02-04 01:01:25,529 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 20 [2018-02-04 01:01:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:25,529 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2018-02-04 01:01:25,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:01:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-02-04 01:01:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:01:25,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:25,529 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:25,529 INFO L371 AbstractCegarLoop]: === Iteration 9 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937322, now seen corresponding path program 1 times [2018-02-04 01:01:25,529 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:25,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:25,530 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,530 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:25,530 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:25,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:25,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:25,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:01:25,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:01:25,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:01:25,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:01:25,585 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand 6 states. [2018-02-04 01:01:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:25,749 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-02-04 01:01:25,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:01:25,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 01:01:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:25,750 INFO L225 Difference]: With dead ends: 152 [2018-02-04 01:01:25,750 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 01:01:25,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 01:01:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-02-04 01:01:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 01:01:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2018-02-04 01:01:25,755 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 20 [2018-02-04 01:01:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:25,755 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2018-02-04 01:01:25,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:01:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2018-02-04 01:01:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:01:25,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:25,756 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:25,756 INFO L371 AbstractCegarLoop]: === Iteration 10 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2044804781, now seen corresponding path program 1 times [2018-02-04 01:01:25,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:25,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:25,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,757 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:25,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:25,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:25,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:25,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:01:25,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:01:25,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:01:25,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:01:25,897 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand 9 states. [2018-02-04 01:01:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:26,068 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2018-02-04 01:01:26,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:01:26,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 01:01:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:26,070 INFO L225 Difference]: With dead ends: 170 [2018-02-04 01:01:26,070 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 01:01:26,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:01:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 01:01:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-02-04 01:01:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 01:01:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-02-04 01:01:26,077 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 24 [2018-02-04 01:01:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:26,077 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-02-04 01:01:26,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:01:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-02-04 01:01:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:01:26,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:26,078 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:26,078 INFO L371 AbstractCegarLoop]: === Iteration 11 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash 560220083, now seen corresponding path program 1 times [2018-02-04 01:01:26,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:26,079 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:26,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:26,080 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:26,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:26,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:26,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:01:26,115 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:01:26,121 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:26,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:01:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:26,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:01:26,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 01:01:26,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:01:26,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:01:26,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:01:26,212 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 6 states. [2018-02-04 01:01:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:26,351 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-02-04 01:01:26,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:01:26,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 01:01:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:26,355 INFO L225 Difference]: With dead ends: 169 [2018-02-04 01:01:26,356 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 01:01:26,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 01:01:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-02-04 01:01:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 01:01:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2018-02-04 01:01:26,361 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 24 [2018-02-04 01:01:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:26,361 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2018-02-04 01:01:26,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:01:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2018-02-04 01:01:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:01:26,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:26,362 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:26,362 INFO L371 AbstractCegarLoop]: === Iteration 12 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash 560220084, now seen corresponding path program 1 times [2018-02-04 01:01:26,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:26,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:26,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:26,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:26,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:26,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:26,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:01:26,533 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:01:26,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:26,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:01:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:26,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:01:26,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2018-02-04 01:01:26,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:01:26,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:01:26,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:01:26,666 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 16 states. [2018-02-04 01:01:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:26,976 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2018-02-04 01:01:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:01:26,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-02-04 01:01:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:26,977 INFO L225 Difference]: With dead ends: 168 [2018-02-04 01:01:26,977 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 01:01:26,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:01:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 01:01:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-02-04 01:01:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 01:01:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2018-02-04 01:01:26,983 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 24 [2018-02-04 01:01:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:26,983 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2018-02-04 01:01:26,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:01:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2018-02-04 01:01:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:01:26,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:26,984 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:26,984 INFO L371 AbstractCegarLoop]: === Iteration 13 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1681609457, now seen corresponding path program 1 times [2018-02-04 01:01:26,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:26,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:26,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:26,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:26,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:26,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:27,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:27,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:01:27,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:01:27,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:01:27,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:27,082 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand 8 states. [2018-02-04 01:01:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:27,229 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2018-02-04 01:01:27,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:01:27,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 01:01:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:27,230 INFO L225 Difference]: With dead ends: 172 [2018-02-04 01:01:27,230 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 01:01:27,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:01:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 01:01:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2018-02-04 01:01:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 01:01:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2018-02-04 01:01:27,239 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 26 [2018-02-04 01:01:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:27,239 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2018-02-04 01:01:27,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:01:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2018-02-04 01:01:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:01:27,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:27,240 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:27,240 INFO L371 AbstractCegarLoop]: === Iteration 14 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1579097554, now seen corresponding path program 1 times [2018-02-04 01:01:27,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:27,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:27,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:27,242 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:27,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:27,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:27,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:01:27,321 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:01:27,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:27,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:01:27,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-02-04 01:01:27,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 01:01:27,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:27,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:27,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:01:27,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 01:01:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:27,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:01:27,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-02-04 01:01:27,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:01:27,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:01:27,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:27,444 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand 8 states. [2018-02-04 01:01:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:27,674 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2018-02-04 01:01:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:01:27,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-04 01:01:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:27,675 INFO L225 Difference]: With dead ends: 187 [2018-02-04 01:01:27,675 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 01:01:27,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:01:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 01:01:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 164. [2018-02-04 01:01:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 01:01:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2018-02-04 01:01:27,681 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 29 [2018-02-04 01:01:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:27,682 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2018-02-04 01:01:27,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:01:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2018-02-04 01:01:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 01:01:27,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:27,683 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 01:01:27,683 INFO L371 AbstractCegarLoop]: === Iteration 15 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:27,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1385679684, now seen corresponding path program 1 times [2018-02-04 01:01:27,683 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:27,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:27,684 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:27,684 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:27,684 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:27,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:27,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:01:27,838 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:01:27,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:27,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:01:27,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:01:27,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:01:27,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-04 01:01:27,950 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 21 treesize of output 17 [2018-02-04 01:01:27,951 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 17 treesize of output 5 [2018-02-04 01:01:27,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:27,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-04 01:01:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:28,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:01:28,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-02-04 01:01:28,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 01:01:28,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 01:01:28,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:01:28,015 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand 19 states. [2018-02-04 01:01:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:28,761 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2018-02-04 01:01:28,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 01:01:28,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-02-04 01:01:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:28,762 INFO L225 Difference]: With dead ends: 243 [2018-02-04 01:01:28,762 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 01:01:28,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 01:01:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 01:01:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 205. [2018-02-04 01:01:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 01:01:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2018-02-04 01:01:28,769 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 30 [2018-02-04 01:01:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:28,769 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2018-02-04 01:01:28,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 01:01:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2018-02-04 01:01:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:01:28,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:28,770 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:28,770 INFO L371 AbstractCegarLoop]: === Iteration 16 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902430, now seen corresponding path program 1 times [2018-02-04 01:01:28,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:28,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:28,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:28,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:28,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:28,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:28,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:28,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:01:28,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:01:28,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:01:28,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:01:28,813 INFO L87 Difference]: Start difference. First operand 205 states and 242 transitions. Second operand 6 states. [2018-02-04 01:01:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:28,996 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2018-02-04 01:01:28,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:01:28,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 01:01:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:28,998 INFO L225 Difference]: With dead ends: 240 [2018-02-04 01:01:28,998 INFO L226 Difference]: Without dead ends: 240 [2018-02-04 01:01:28,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-04 01:01:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2018-02-04 01:01:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 01:01:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 241 transitions. [2018-02-04 01:01:29,005 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 241 transitions. Word has length 31 [2018-02-04 01:01:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:29,005 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 241 transitions. [2018-02-04 01:01:29,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:01:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 241 transitions. [2018-02-04 01:01:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:01:29,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:29,006 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:29,006 INFO L371 AbstractCegarLoop]: === Iteration 17 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:29,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902431, now seen corresponding path program 1 times [2018-02-04 01:01:29,006 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:29,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:29,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:29,007 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:29,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:29,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:01:29,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:29,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:01:29,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:01:29,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:01:29,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:01:29,043 INFO L87 Difference]: Start difference. First operand 204 states and 241 transitions. Second operand 4 states. [2018-02-04 01:01:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:29,048 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2018-02-04 01:01:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:01:29,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-04 01:01:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:29,049 INFO L225 Difference]: With dead ends: 215 [2018-02-04 01:01:29,049 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 01:01:29,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:01:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 01:01:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204. [2018-02-04 01:01:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 01:01:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2018-02-04 01:01:29,053 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 31 [2018-02-04 01:01:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:29,053 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2018-02-04 01:01:29,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:01:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2018-02-04 01:01:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:01:29,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:29,054 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:29,054 INFO L371 AbstractCegarLoop]: === Iteration 18 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636396, now seen corresponding path program 1 times [2018-02-04 01:01:29,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:29,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:29,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:29,055 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:29,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:29,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:29,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:01:29,480 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:01:29,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:29,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:01:29,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:01:29,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:01:29,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:29,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:29,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:01:29,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 01:01:29,685 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 21 treesize of output 17 [2018-02-04 01:01:29,691 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-02-04 01:01:29,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:01:29,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:01:29,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:01:29,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2018-02-04 01:01:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:29,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:01:29,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-02-04 01:01:29,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 01:01:29,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 01:01:29,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:01:29,778 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand 26 states. [2018-02-04 01:01:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:31,769 INFO L93 Difference]: Finished difference Result 391 states and 473 transitions. [2018-02-04 01:01:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 01:01:31,769 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-04 01:01:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:31,770 INFO L225 Difference]: With dead ends: 391 [2018-02-04 01:01:31,770 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 01:01:31,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 01:01:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 01:01:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 286. [2018-02-04 01:01:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 01:01:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2018-02-04 01:01:31,779 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 33 [2018-02-04 01:01:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:31,780 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2018-02-04 01:01:31,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 01:01:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2018-02-04 01:01:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:01:31,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:31,781 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:31,781 INFO L371 AbstractCegarLoop]: === Iteration 19 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636395, now seen corresponding path program 1 times [2018-02-04 01:01:31,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:31,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:31,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:31,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:31,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:31,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:32,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:01:32,209 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:01:32,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:32,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:01:32,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:01:32,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:01:32,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:01:32,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:01:32,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:38 [2018-02-04 01:01:32,424 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 29 treesize of output 25 [2018-02-04 01:01:32,428 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 25 treesize of output 13 [2018-02-04 01:01:32,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,434 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 41 treesize of output 33 [2018-02-04 01:01:32,436 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 33 treesize of output 14 [2018-02-04 01:01:32,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:32,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:14 [2018-02-04 01:01:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:32,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:01:32,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-02-04 01:01:32,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 01:01:32,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 01:01:32,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=621, Unknown=3, NotChecked=0, Total=702 [2018-02-04 01:01:32,479 INFO L87 Difference]: Start difference. First operand 286 states and 349 transitions. Second operand 27 states. [2018-02-04 01:01:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:34,369 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2018-02-04 01:01:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 01:01:34,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-02-04 01:01:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:34,401 INFO L225 Difference]: With dead ends: 398 [2018-02-04 01:01:34,401 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 01:01:34,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=369, Invalid=2068, Unknown=13, NotChecked=0, Total=2450 [2018-02-04 01:01:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 01:01:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 322. [2018-02-04 01:01:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-04 01:01:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 395 transitions. [2018-02-04 01:01:34,409 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 395 transitions. Word has length 33 [2018-02-04 01:01:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:34,409 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 395 transitions. [2018-02-04 01:01:34,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 01:01:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 395 transitions. [2018-02-04 01:01:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 01:01:34,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:34,410 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:34,410 INFO L371 AbstractCegarLoop]: === Iteration 20 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217638, now seen corresponding path program 1 times [2018-02-04 01:01:34,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:34,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:34,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:34,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:34,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:34,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:34,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:34,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:01:34,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:01:34,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:01:34,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:01:34,466 INFO L87 Difference]: Start difference. First operand 322 states and 395 transitions. Second operand 7 states. [2018-02-04 01:01:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:34,605 INFO L93 Difference]: Finished difference Result 357 states and 433 transitions. [2018-02-04 01:01:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:01:34,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-04 01:01:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:34,607 INFO L225 Difference]: With dead ends: 357 [2018-02-04 01:01:34,607 INFO L226 Difference]: Without dead ends: 357 [2018-02-04 01:01:34,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-04 01:01:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2018-02-04 01:01:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 01:01:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 425 transitions. [2018-02-04 01:01:34,613 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 425 transitions. Word has length 36 [2018-02-04 01:01:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:34,613 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 425 transitions. [2018-02-04 01:01:34,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:01:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 425 transitions. [2018-02-04 01:01:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 01:01:34,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:34,614 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:34,614 INFO L371 AbstractCegarLoop]: === Iteration 21 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217639, now seen corresponding path program 1 times [2018-02-04 01:01:34,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:34,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:34,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:34,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:34,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:34,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:34,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:01:34,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:01:34,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:01:34,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:01:34,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:01:34,644 INFO L87 Difference]: Start difference. First operand 342 states and 425 transitions. Second operand 7 states. [2018-02-04 01:01:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:01:34,807 INFO L93 Difference]: Finished difference Result 347 states and 419 transitions. [2018-02-04 01:01:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:01:34,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-04 01:01:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:01:34,809 INFO L225 Difference]: With dead ends: 347 [2018-02-04 01:01:34,809 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 01:01:34,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:01:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 01:01:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 339. [2018-02-04 01:01:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 01:01:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 413 transitions. [2018-02-04 01:01:34,815 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 413 transitions. Word has length 36 [2018-02-04 01:01:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:01:34,816 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 413 transitions. [2018-02-04 01:01:34,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:01:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 413 transitions. [2018-02-04 01:01:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 01:01:34,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:01:34,817 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:01:34,817 INFO L371 AbstractCegarLoop]: === Iteration 22 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:01:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1964561354, now seen corresponding path program 1 times [2018-02-04 01:01:34,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:01:34,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:01:34,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:34,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:34,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:01:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:34,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:01:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:35,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:01:35,068 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:01:35,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:01:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:01:35,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:01:35,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:01:35,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:01:35,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:01:35,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:01:35,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:01:35,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-02-04 01:01:37,322 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 20 treesize of output 16 [2018-02-04 01:01:37,327 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-02-04 01:01:37,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:01:37,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:01:37,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:01:37,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:18 [2018-02-04 01:01:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:01:37,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:01:37,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-02-04 01:01:37,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 01:01:37,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 01:01:37,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=530, Unknown=1, NotChecked=0, Total=600 [2018-02-04 01:01:37,395 INFO L87 Difference]: Start difference. First operand 339 states and 413 transitions. Second operand 25 states. [2018-02-04 01:03:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:03,596 INFO L93 Difference]: Finished difference Result 410 states and 493 transitions. [2018-02-04 01:03:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 01:03:03,597 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2018-02-04 01:03:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:03,598 INFO L225 Difference]: With dead ends: 410 [2018-02-04 01:03:03,599 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 01:03:03,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=340, Invalid=1720, Unknown=10, NotChecked=0, Total=2070 [2018-02-04 01:03:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 01:03:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 316. [2018-02-04 01:03:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 01:03:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2018-02-04 01:03:03,611 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 35 [2018-02-04 01:03:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:03,612 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2018-02-04 01:03:03,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 01:03:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2018-02-04 01:03:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:03:03,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:03,613 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 01:03:03,613 INFO L371 AbstractCegarLoop]: === Iteration 23 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash -137022243, now seen corresponding path program 1 times [2018-02-04 01:03:03,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:03,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:03,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:03,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:03,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:03,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 01:03:03,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:03,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:03:03,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:03:03,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:03:03,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:03:03,672 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand 7 states. [2018-02-04 01:03:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:03,824 INFO L93 Difference]: Finished difference Result 332 states and 399 transitions. [2018-02-04 01:03:03,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:03:03,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 01:03:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:03,826 INFO L225 Difference]: With dead ends: 332 [2018-02-04 01:03:03,826 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 01:03:03,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:03:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 01:03:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 310. [2018-02-04 01:03:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-04 01:03:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2018-02-04 01:03:03,830 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 38 [2018-02-04 01:03:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:03,830 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2018-02-04 01:03:03,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:03:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2018-02-04 01:03:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:03:03,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:03,831 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:03,831 INFO L371 AbstractCegarLoop]: === Iteration 24 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1296859951, now seen corresponding path program 1 times [2018-02-04 01:03:03,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:03,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:03,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:03,832 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:03,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:03,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:03,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:03,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:03:03,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:03:03,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:03:03,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:03:03,941 INFO L87 Difference]: Start difference. First operand 310 states and 374 transitions. Second operand 10 states. [2018-02-04 01:03:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:04,153 INFO L93 Difference]: Finished difference Result 377 states and 459 transitions. [2018-02-04 01:03:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:03:04,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-04 01:03:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:04,155 INFO L225 Difference]: With dead ends: 377 [2018-02-04 01:03:04,155 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 01:03:04,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:03:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 01:03:04,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 350. [2018-02-04 01:03:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 01:03:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 428 transitions. [2018-02-04 01:03:04,162 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 428 transitions. Word has length 39 [2018-02-04 01:03:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:04,162 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 428 transitions. [2018-02-04 01:03:04,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:03:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 428 transitions. [2018-02-04 01:03:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:03:04,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:04,163 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 01:03:04,163 INFO L371 AbstractCegarLoop]: === Iteration 25 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:04,163 INFO L82 PathProgramCache]: Analyzing trace with hash 190013480, now seen corresponding path program 1 times [2018-02-04 01:03:04,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:04,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:04,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:04,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:04,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:04,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:04,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:04,438 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:03:04,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:04,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:04,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:03:04,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:03:04,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:03:04,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:03:04,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2018-02-04 01:03:04,757 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 29 treesize of output 25 [2018-02-04 01:03:04,759 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 25 treesize of output 13 [2018-02-04 01:03:04,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,771 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 41 treesize of output 33 [2018-02-04 01:03:04,775 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 33 treesize of output 14 [2018-02-04 01:03:04,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:04,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2018-02-04 01:03:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:04,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:03:04,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2018-02-04 01:03:04,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 01:03:04,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 01:03:04,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:03:04,883 INFO L87 Difference]: Start difference. First operand 350 states and 428 transitions. Second operand 30 states. [2018-02-04 01:03:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:05,323 INFO L93 Difference]: Finished difference Result 357 states and 436 transitions. [2018-02-04 01:03:05,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:03:05,323 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2018-02-04 01:03:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:05,324 INFO L225 Difference]: With dead ends: 357 [2018-02-04 01:03:05,324 INFO L226 Difference]: Without dead ends: 357 [2018-02-04 01:03:05,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 01:03:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-04 01:03:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 350. [2018-02-04 01:03:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 01:03:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 427 transitions. [2018-02-04 01:03:05,330 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 427 transitions. Word has length 39 [2018-02-04 01:03:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:05,330 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 427 transitions. [2018-02-04 01:03:05,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 01:03:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 427 transitions. [2018-02-04 01:03:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:03:05,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:05,330 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:05,330 INFO L371 AbstractCegarLoop]: === Iteration 26 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1458117372, now seen corresponding path program 1 times [2018-02-04 01:03:05,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:05,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:05,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:05,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:05,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:05,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:05,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:05,755 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:03:05,762 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:05,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:05,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:03:05,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 01:03:05,817 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 11 treesize of output 8 [2018-02-04 01:03:05,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 8 treesize of output 7 [2018-02-04 01:03:05,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,830 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 11 treesize of output 8 [2018-02-04 01:03:05,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:03:05,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-02-04 01:03:05,844 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 26 treesize of output 21 [2018-02-04 01:03:05,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:05,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 01:03:05,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,862 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 26 treesize of output 21 [2018-02-04 01:03:05,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:05,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 01:03:05,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-02-04 01:03:05,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:05,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:05,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:03:05,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-02-04 01:03:05,981 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 28 treesize of output 29 [2018-02-04 01:03:05,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 01:03:05,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:05,999 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 28 treesize of output 37 [2018-02-04 01:03:06,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 8 treesize of output 7 [2018-02-04 01:03:06,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:68 [2018-02-04 01:03:06,049 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 61 treesize of output 56 [2018-02-04 01:03:06,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:06,053 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 36 treesize of output 47 [2018-02-04 01:03:06,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,079 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 45 treesize of output 48 [2018-02-04 01:03:06,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:06,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 01:03:06,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-04 01:03:06,135 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 74 treesize of output 71 [2018-02-04 01:03:06,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:06,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:06,145 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 27 treesize of output 61 [2018-02-04 01:03:06,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:06,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:06,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 98 [2018-02-04 01:03:06,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:06,207 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:06,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-02-04 01:03:06,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:06,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 96 [2018-02-04 01:03:06,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:06,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:06,242 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 2 case distinctions, treesize of input 31 treesize of output 73 [2018-02-04 01:03:06,242 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:06,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:06,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:06,294 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:207 [2018-02-04 01:03:06,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 139 [2018-02-04 01:03:06,814 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 01:03:06,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:07,027 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 119 treesize of output 118 [2018-02-04 01:03:07,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:07,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:07,171 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 2 case distinctions, treesize of input 116 treesize of output 156 [2018-02-04 01:03:07,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:07,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:07,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 127 [2018-02-04 01:03:07,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:07,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 01:03:07,518 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 137 [2018-02-04 01:03:07,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:07,525 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:07,525 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:07,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 185 [2018-02-04 01:03:07,526 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:07,773 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 119 treesize of output 118 [2018-02-04 01:03:07,774 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:07,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:07,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 144 [2018-02-04 01:03:07,851 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:07,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:07,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 116 [2018-02-04 01:03:07,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:07,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 71 [2018-02-04 01:03:07,919 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:07,934 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:07,937 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:07,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 113 [2018-02-04 01:03:07,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:07,942 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:07,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 87 [2018-02-04 01:03:07,943 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:07,961 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:08,107 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 140 treesize of output 170 [2018-02-04 01:03:08,123 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 01:03:08,123 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:08,404 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 145 treesize of output 144 [2018-02-04 01:03:08,404 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:08,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:08,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:08,582 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 173 [2018-02-04 01:03:08,583 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-02-04 01:03:08,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:08,735 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 160 [2018-02-04 01:03:08,736 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:08,849 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 01:03:09,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 131 [2018-02-04 01:03:09,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,062 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 90 treesize of output 83 [2018-02-04 01:03:09,063 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:09,078 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:09,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 135 [2018-02-04 01:03:09,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,093 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 34 treesize of output 89 [2018-02-04 01:03:09,094 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:09,114 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:09,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 157 [2018-02-04 01:03:09,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,157 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 2 case distinctions, treesize of input 138 treesize of output 141 [2018-02-04 01:03:09,158 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:09,376 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 137 treesize of output 136 [2018-02-04 01:03:09,376 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:09,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,489 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 177 [2018-02-04 01:03:09,490 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-02-04 01:03:09,642 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 01:03:09,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 147 [2018-02-04 01:03:09,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:09,657 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 2 case distinctions, treesize of input 121 treesize of output 125 [2018-02-04 01:03:09,657 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:09,708 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:09,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-02-04 01:03:09,927 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 12 variables, input treesize:263, output treesize:1071 [2018-02-04 01:03:34,064 WARN L146 SmtUtils]: Spent 24045ms on a formula simplification. DAG size of input: 230 DAG size of output 184 [2018-02-04 01:03:34,141 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 144 [2018-02-04 01:03:34,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 137 [2018-02-04 01:03:34,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:34,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 154 [2018-02-04 01:03:34,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:34,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 132 [2018-02-04 01:03:34,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:34,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 116 [2018-02-04 01:03:34,559 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:03:34,680 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 110 treesize of output 103 [2018-02-04 01:03:34,680 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:34,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,802 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 98 [2018-02-04 01:03:34,803 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:03:34,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 107 [2018-02-04 01:03:34,805 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:03:34,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:34,915 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:34,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 128 [2018-02-04 01:03:34,919 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:35,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 113 [2018-02-04 01:03:35,047 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:35,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-02-04 01:03:35,433 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 148 treesize of output 125 [2018-02-04 01:03:35,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,440 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 87 [2018-02-04 01:03:35,441 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:35,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,472 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 82 treesize of output 68 [2018-02-04 01:03:35,473 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:35,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,474 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 100 treesize of output 62 [2018-02-04 01:03:35,475 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:35,492 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:35,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 70 [2018-02-04 01:03:35,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 01:03:35,770 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:35,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-02-04 01:03:35,789 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:35,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,800 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-02-04 01:03:35,800 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:35,805 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:35,815 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 102 [2018-02-04 01:03:35,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:35,830 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 84 [2018-02-04 01:03:35,830 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:35,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 72 treesize of output 65 [2018-02-04 01:03:35,935 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 82 [2018-02-04 01:03:36,034 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,131 INFO L267 ElimStorePlain]: Start of recursive call 20: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 78 [2018-02-04 01:03:36,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,145 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-04 01:03:36,145 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 50 treesize of output 43 [2018-02-04 01:03:36,178 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-02-04 01:03:36,205 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,232 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2018-02-04 01:03:36,233 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,255 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-02-04 01:03:36,255 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,265 INFO L267 ElimStorePlain]: Start of recursive call 24: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 78 [2018-02-04 01:03:36,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,276 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-02-04 01:03:36,276 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,308 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 62 [2018-02-04 01:03:36,308 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2018-02-04 01:03:36,340 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,361 INFO L267 ElimStorePlain]: Start of recursive call 30: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 69 [2018-02-04 01:03:36,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-02-04 01:03:36,371 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2018-02-04 01:03:36,416 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:36,451 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 62 treesize of output 55 [2018-02-04 01:03:36,452 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-02-04 01:03:36,483 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2018-02-04 01:03:36,517 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:36,534 INFO L267 ElimStorePlain]: Start of recursive call 34: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:36,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 74 [2018-02-04 01:03:36,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,556 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 74 [2018-02-04 01:03:36,557 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,594 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:36,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-02-04 01:03:36,594 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,629 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:36,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-02-04 01:03:36,631 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2018-02-04 01:03:36,654 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:36,698 INFO L267 ElimStorePlain]: Start of recursive call 40: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:36,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 118 [2018-02-04 01:03:36,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,911 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:36,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-02-04 01:03:36,911 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:36,927 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 58 treesize of output 40 [2018-02-04 01:03:36,927 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:36,939 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 56 [2018-02-04 01:03:37,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:37,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:37,148 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-02-04 01:03:37,148 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:03:37,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:37,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 01:03:37,159 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,165 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-02-04 01:03:37,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:37,169 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 25 treesize of output 14 [2018-02-04 01:03:37,169 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-02-04 01:03:37,176 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,180 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,338 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 62 treesize of output 39 [2018-02-04 01:03:37,339 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 21 treesize of output 7 [2018-02-04 01:03:37,339 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:37,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 01:03:37,345 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,347 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:37,383 INFO L202 ElimStorePlain]: Needed 56 recursive calls to eliminate 27 variables, input treesize:968, output treesize:7 [2018-02-04 01:03:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:37,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:03:37,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2018-02-04 01:03:37,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 01:03:37,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 01:03:37,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=606, Unknown=8, NotChecked=0, Total=702 [2018-02-04 01:03:37,430 INFO L87 Difference]: Start difference. First operand 350 states and 427 transitions. Second operand 27 states. [2018-02-04 01:03:43,292 WARN L146 SmtUtils]: Spent 3739ms on a formula simplification. DAG size of input: 208 DAG size of output 205 [2018-02-04 01:03:45,080 WARN L143 SmtUtils]: Spent 1695ms on a formula simplification that was a NOOP. DAG size: 193 [2018-02-04 01:03:48,421 WARN L143 SmtUtils]: Spent 3249ms on a formula simplification that was a NOOP. DAG size: 197 [2018-02-04 01:03:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:49,236 INFO L93 Difference]: Finished difference Result 463 states and 553 transitions. [2018-02-04 01:03:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 01:03:49,236 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2018-02-04 01:03:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:49,237 INFO L225 Difference]: With dead ends: 463 [2018-02-04 01:03:49,237 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 01:03:49,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=311, Invalid=1920, Unknown=25, NotChecked=0, Total=2256 [2018-02-04 01:03:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 01:03:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 330. [2018-02-04 01:03:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 01:03:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 398 transitions. [2018-02-04 01:03:49,242 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 398 transitions. Word has length 39 [2018-02-04 01:03:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:49,242 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 398 transitions. [2018-02-04 01:03:49,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 01:03:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 398 transitions. [2018-02-04 01:03:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:03:49,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:49,243 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:49,243 INFO L371 AbstractCegarLoop]: === Iteration 27 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash 750521981, now seen corresponding path program 1 times [2018-02-04 01:03:49,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:49,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:49,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:49,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:49,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:49,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:49,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:49,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:03:49,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:03:49,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:03:49,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:03:49,435 INFO L87 Difference]: Start difference. First operand 330 states and 398 transitions. Second operand 10 states. [2018-02-04 01:03:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:49,646 INFO L93 Difference]: Finished difference Result 353 states and 421 transitions. [2018-02-04 01:03:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:03:49,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-02-04 01:03:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:49,647 INFO L225 Difference]: With dead ends: 353 [2018-02-04 01:03:49,647 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 01:03:49,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:03:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 01:03:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 330. [2018-02-04 01:03:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 01:03:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 394 transitions. [2018-02-04 01:03:49,651 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 394 transitions. Word has length 41 [2018-02-04 01:03:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:49,651 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 394 transitions. [2018-02-04 01:03:49,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:03:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 394 transitions. [2018-02-04 01:03:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 01:03:49,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:49,651 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 01:03:49,651 INFO L371 AbstractCegarLoop]: === Iteration 28 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash -296541728, now seen corresponding path program 1 times [2018-02-04 01:03:49,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:49,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:49,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:49,652 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:49,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:49,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:03:49,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:49,939 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:03:49,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:49,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:50,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:03:50,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:03:50,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 01:03:50,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:03:50,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-02-04 01:03:50,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 01:03:50,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-04 01:03:50,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:50,081 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 20 treesize of output 19 [2018-02-04 01:03:50,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:50,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 01:03:50,116 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 24 treesize of output 23 [2018-02-04 01:03:50,116 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,126 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:50,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:50,148 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:54, output treesize:87 [2018-02-04 01:03:51,357 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 83 treesize of output 68 [2018-02-04 01:03:51,363 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 1 case distinctions, treesize of input 21 treesize of output 18 [2018-02-04 01:03:51,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:51,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 29 [2018-02-04 01:03:51,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:03:51,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:51,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2018-02-04 01:03:51,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 25 [2018-02-04 01:03:51,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:03:51,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:51,408 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 15 treesize of output 8 [2018-02-04 01:03:51,408 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:51,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:51,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-02-04 01:03:51,422 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 1 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 01:03:51,422 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:51,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 18 [2018-02-04 01:03:51,432 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:51,433 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-02-04 01:03:51,433 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:51,441 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:51,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 01:03:51,454 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:110, output treesize:25 [2018-02-04 01:03:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:03:51,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:03:51,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-02-04 01:03:51,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 01:03:51,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 01:03:51,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=710, Unknown=6, NotChecked=0, Total=812 [2018-02-04 01:03:51,531 INFO L87 Difference]: Start difference. First operand 330 states and 394 transitions. Second operand 29 states. [2018-02-04 01:03:52,118 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 81 DAG size of output 60 [2018-02-04 01:03:52,401 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 62 DAG size of output 60 [2018-02-04 01:03:52,967 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 94 DAG size of output 67 [2018-02-04 01:03:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:54,300 INFO L93 Difference]: Finished difference Result 428 states and 522 transitions. [2018-02-04 01:03:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 01:03:54,301 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2018-02-04 01:03:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:54,302 INFO L225 Difference]: With dead ends: 428 [2018-02-04 01:03:54,302 INFO L226 Difference]: Without dead ends: 428 [2018-02-04 01:03:54,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=411, Invalid=2234, Unknown=7, NotChecked=0, Total=2652 [2018-02-04 01:03:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-04 01:03:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 360. [2018-02-04 01:03:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-04 01:03:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 436 transitions. [2018-02-04 01:03:54,308 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 436 transitions. Word has length 42 [2018-02-04 01:03:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:54,308 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 436 transitions. [2018-02-04 01:03:54,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 01:03:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 436 transitions. [2018-02-04 01:03:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 01:03:54,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:54,309 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 01:03:54,309 INFO L371 AbstractCegarLoop]: === Iteration 29 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1152741502, now seen corresponding path program 1 times [2018-02-04 01:03:54,309 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:54,309 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:54,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:54,310 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:54,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:54,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:03:54,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:54,495 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:03:54,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:54,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:54,550 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 11 treesize of output 8 [2018-02-04 01:03:54,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:03:54,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:54,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:54,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:54,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 01:03:54,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 01:03:54,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:54,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 01:03:54,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:54,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:54,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:54,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-04 01:03:54,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-02-04 01:03:54,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 31 treesize of output 30 [2018-02-04 01:03:54,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:54,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:54,646 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 2 case distinctions, treesize of input 26 treesize of output 43 [2018-02-04 01:03:54,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 01:03:54,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:54,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 01:03:54,674 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:75 [2018-02-04 01:03:55,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-02-04 01:03:55,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 01:03:55,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:55,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:55,392 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 26 treesize of output 16 [2018-02-04 01:03:55,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:55,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:55,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:55,399 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:53, output treesize:5 [2018-02-04 01:03:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:03:55,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:03:55,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-02-04 01:03:55,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 01:03:55,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 01:03:55,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:03:55,437 INFO L87 Difference]: Start difference. First operand 360 states and 436 transitions. Second operand 28 states. [2018-02-04 01:03:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:57,535 INFO L93 Difference]: Finished difference Result 426 states and 521 transitions. [2018-02-04 01:03:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 01:03:57,535 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2018-02-04 01:03:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:57,536 INFO L225 Difference]: With dead ends: 426 [2018-02-04 01:03:57,537 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 01:03:57,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=352, Invalid=1810, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 01:03:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 01:03:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 372. [2018-02-04 01:03:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-04 01:03:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 451 transitions. [2018-02-04 01:03:57,541 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 451 transitions. Word has length 44 [2018-02-04 01:03:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:57,541 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 451 transitions. [2018-02-04 01:03:57,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 01:03:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 451 transitions. [2018-02-04 01:03:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 01:03:57,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:57,542 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 01:03:57,542 INFO L371 AbstractCegarLoop]: === Iteration 30 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:03:57,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1152741501, now seen corresponding path program 1 times [2018-02-04 01:03:57,542 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:57,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:57,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:57,543 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:57,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:57,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:03:57,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:57,776 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:03:57,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:57,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:57,840 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 11 treesize of output 8 [2018-02-04 01:03:57,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:03:57,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,850 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 11 treesize of output 8 [2018-02-04 01:03:57,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:03:57,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-02-04 01:03:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 01:03:57,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:57,881 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:57,881 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 30 [2018-02-04 01:03:57,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 01:03:57,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:57,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 01:03:57,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-02-04 01:03:57,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 52 [2018-02-04 01:03:57,957 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 39 treesize of output 38 [2018-02-04 01:03:57,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:57,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 51 [2018-02-04 01:03:57,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:57,999 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:03:58,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-02-04 01:03:58,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,023 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 40 treesize of output 39 [2018-02-04 01:03:58,023 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:58,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:03:58,062 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:75, output treesize:124 [2018-02-04 01:03:58,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2018-02-04 01:03:58,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:58,931 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 47 treesize of output 35 [2018-02-04 01:03:58,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,937 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 11 treesize of output 1 [2018-02-04 01:03:58,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-02-04 01:03:58,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:58,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-02-04 01:03:58,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 01:03:58,973 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:58,989 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:103, output treesize:11 [2018-02-04 01:03:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:03:59,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:03:59,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2018-02-04 01:03:59,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 01:03:59,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 01:03:59,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:03:59,058 INFO L87 Difference]: Start difference. First operand 372 states and 451 transitions. Second operand 30 states. [2018-02-04 01:04:00,227 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 117 DAG size of output 115 [2018-02-04 01:04:01,278 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 123 DAG size of output 53 [2018-02-04 01:04:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:03,383 INFO L93 Difference]: Finished difference Result 457 states and 570 transitions. [2018-02-04 01:04:03,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 01:04:03,383 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-02-04 01:04:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:03,384 INFO L225 Difference]: With dead ends: 457 [2018-02-04 01:04:03,384 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 01:04:03,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=622, Invalid=3160, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 01:04:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 01:04:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 374. [2018-02-04 01:04:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 01:04:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 451 transitions. [2018-02-04 01:04:03,392 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 451 transitions. Word has length 44 [2018-02-04 01:04:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:03,392 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 451 transitions. [2018-02-04 01:04:03,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 01:04:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 451 transitions. [2018-02-04 01:04:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 01:04:03,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:03,393 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-04 01:04:03,393 INFO L371 AbstractCegarLoop]: === Iteration 31 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:04:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1242028496, now seen corresponding path program 1 times [2018-02-04 01:04:03,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:03,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:03,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:03,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:03,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:03,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:03,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:03,819 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:04:03,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:03,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:03,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:03,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:03,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:04:03,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:03,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:03,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 01:04:03,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-02-04 01:04:03,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:04:03,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:03,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:03,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-02-04 01:04:03,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:04:03,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:03,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:03,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:03,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-02-04 01:04:04,007 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 23 treesize of output 24 [2018-02-04 01:04:04,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 01:04:04,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,022 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 23 treesize of output 30 [2018-02-04 01:04:04,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:04:04,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:71 [2018-02-04 01:04:04,281 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 95 treesize of output 80 [2018-02-04 01:04:04,282 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 27 treesize of output 3 [2018-02-04 01:04:04,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 35 [2018-02-04 01:04:04,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:04,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:04,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-02-04 01:04:04,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-02-04 01:04:04,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:04,308 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 15 treesize of output 3 [2018-02-04 01:04:04,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:04,313 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:113, output treesize:7 [2018-02-04 01:04:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:04,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:04,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2018-02-04 01:04:04,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 01:04:04,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 01:04:04,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=867, Unknown=15, NotChecked=0, Total=992 [2018-02-04 01:04:04,359 INFO L87 Difference]: Start difference. First operand 374 states and 451 transitions. Second operand 32 states. [2018-02-04 01:04:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:06,047 INFO L93 Difference]: Finished difference Result 479 states and 606 transitions. [2018-02-04 01:04:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 01:04:06,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-02-04 01:04:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:06,048 INFO L225 Difference]: With dead ends: 479 [2018-02-04 01:04:06,048 INFO L226 Difference]: Without dead ends: 479 [2018-02-04 01:04:06,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=425, Invalid=2420, Unknown=17, NotChecked=0, Total=2862 [2018-02-04 01:04:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-02-04 01:04:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 305. [2018-02-04 01:04:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-04 01:04:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 361 transitions. [2018-02-04 01:04:06,055 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 361 transitions. Word has length 45 [2018-02-04 01:04:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:06,055 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 361 transitions. [2018-02-04 01:04:06,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 01:04:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 361 transitions. [2018-02-04 01:04:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 01:04:06,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:06,056 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:06,056 INFO L371 AbstractCegarLoop]: === Iteration 32 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:04:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1440013922, now seen corresponding path program 1 times [2018-02-04 01:04:06,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:06,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:06,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:06,057 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:06,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:06,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:06,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:06,731 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:04:06,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:06,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:06,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:04:06,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:06,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:06,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 01:04:06,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:06,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:06,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:04:06,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:06,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:06,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 01:04:06,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-02-04 01:04:06,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 01:04:06,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:06,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:06,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:06,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-02-04 01:04:08,932 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~tail~0.offset Int)) (and (<= main_~tail~0.offset 0) (not (= v_main_~x~0.base_BEFORE_CALL_16 (select (select |c_#memory_$Pointer$.base| v_main_~x~0.base_BEFORE_CALL_16) (+ main_~tail~0.offset 4)))))) is different from true [2018-02-04 01:04:09,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:09,167 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 45 treesize of output 49 [2018-02-04 01:04:09,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 01:04:09,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:09,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:09,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:09,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:31 [2018-02-04 01:04:09,440 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 31 treesize of output 25 [2018-02-04 01:04:09,442 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:04:09,442 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 25 treesize of output 17 [2018-02-04 01:04:09,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:09,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:09,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:09,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:5 [2018-02-04 01:04:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:09,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:04:09,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2018-02-04 01:04:09,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 01:04:09,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 01:04:09,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1301, Unknown=1, NotChecked=72, Total=1482 [2018-02-04 01:04:09,486 INFO L87 Difference]: Start difference. First operand 305 states and 361 transitions. Second operand 39 states. [2018-02-04 01:04:15,923 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-04 01:04:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:04:27,563 INFO L93 Difference]: Finished difference Result 463 states and 538 transitions. [2018-02-04 01:04:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 01:04:27,563 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-02-04 01:04:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:04:27,564 INFO L225 Difference]: With dead ends: 463 [2018-02-04 01:04:27,564 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 01:04:27,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=552, Invalid=4995, Unknown=7, NotChecked=146, Total=5700 [2018-02-04 01:04:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 01:04:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 319. [2018-02-04 01:04:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 01:04:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 373 transitions. [2018-02-04 01:04:27,570 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 373 transitions. Word has length 52 [2018-02-04 01:04:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:04:27,570 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 373 transitions. [2018-02-04 01:04:27,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 01:04:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 373 transitions. [2018-02-04 01:04:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 01:04:27,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:04:27,576 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:04:27,576 INFO L371 AbstractCegarLoop]: === Iteration 33 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-02-04 01:04:27,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1440013923, now seen corresponding path program 1 times [2018-02-04 01:04:27,576 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:04:27,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:04:27,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:27,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:27,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:04:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:27,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:04:27,939 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 52 DAG size of output 47 [2018-02-04 01:04:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:04:28,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:04:28,375 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:04:28,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:04:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:04:28,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:04:28,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:04:28,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 01:04:28,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:28,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:28,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:04:28,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-02-04 01:04:28,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-02-04 01:04:28,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 01:04:28,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-02-04 01:04:28,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 01:04:28,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:28,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:28,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:54 [2018-02-04 01:04:36,749 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 30 treesize of output 26 [2018-02-04 01:04:36,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 [2018-02-04 01:04:36,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:36,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:36,763 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 32 treesize of output 26 [2018-02-04 01:04:36,764 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-02-04 01:04:36,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:36,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:36,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:36,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:12 [2018-02-04 01:04:36,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:36,978 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 61 treesize of output 62 [2018-02-04 01:04:36,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 01:04:36,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:36,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:04:37,002 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 66 treesize of output 70 [2018-02-04 01:04:37,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 01:04:37,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:04:37,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:04:37,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 01:04:37,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:108, output treesize:62 Received shutdown request... [2018-02-04 01:04:45,120 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 01:04:45,121 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 01:04:45,124 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 01:04:45,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:04:45 BoogieIcfgContainer [2018-02-04 01:04:45,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:04:45,125 INFO L168 Benchmark]: Toolchain (without parser) took 201756.06 ms. Allocated memory was 396.4 MB in the beginning and 612.9 MB in the end (delta: 216.5 MB). Free memory was 353.0 MB in the beginning and 494.7 MB in the end (delta: -141.6 MB). Peak memory consumption was 74.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:45,126 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:04:45,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.72 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 342.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:45,126 INFO L168 Benchmark]: Boogie Preprocessor took 26.47 ms. Allocated memory is still 396.4 MB. Free memory was 342.5 MB in the beginning and 339.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:45,126 INFO L168 Benchmark]: RCFGBuilder took 352.53 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 306.3 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:45,126 INFO L168 Benchmark]: TraceAbstraction took 201220.53 ms. Allocated memory was 396.4 MB in the beginning and 612.9 MB in the end (delta: 216.5 MB). Free memory was 306.3 MB in the beginning and 494.7 MB in the end (delta: -188.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:04:45,127 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.13 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.72 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 342.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.47 ms. Allocated memory is still 396.4 MB. Free memory was 342.5 MB in the beginning and 339.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 352.53 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 306.3 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 201220.53 ms. Allocated memory was 396.4 MB in the beginning and 612.9 MB in the end (delta: 216.5 MB). Free memory was 306.3 MB in the beginning and 494.7 MB in the end (delta: -188.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 587]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 587). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 122 locations, 43 error locations. TIMEOUT Result, 201.1s OverallTime, 33 OverallIterations, 3 TraceHistogramMax, 135.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3962 SDtfs, 5414 SDslu, 22790 SDs, 0 SdLazy, 22286 SolverSat, 3762 SolverUnsat, 106 SolverUnknown, 0 SolverNotchecked, 81.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1132 GetRequests, 403 SyntacticMatches, 55 SemanticMatches, 674 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7096 ImplicationChecksByTransitivity, 89.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 1265 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 46.8s InterpolantComputationTime, 1461 NumberOfCodeBlocks, 1461 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1415 ConstructedInterpolants, 140 QuantifiedInterpolants, 1170167 SizeOfPredicates, 188 NumberOfNonLiveVariables, 2463 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 46 InterpolantComputations, 18 PerfectInterpolantSequences, 77/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-04-45-132.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-04-45-132.csv Completed graceful shutdown