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-c17473d-m [2018-02-04 14:14:55,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:14:55,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:14:55,433 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:14:55,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:14:55,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:14:55,435 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:14:55,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:14:55,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:14:55,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:14:55,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:14:55,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:14:55,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:14:55,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:14:55,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:14:55,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:14:55,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:14:55,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:14:55,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:14:55,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:14:55,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:14:55,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:14:55,450 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:14:55,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:14:55,452 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:14:55,452 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:14:55,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:14:55,453 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:14:55,453 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:14:55,454 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:14:55,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:14:55,454 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 14:14:55,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:14:55,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:14:55,465 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:14:55,465 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:14:55,465 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:14:55,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:14:55,465 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:14:55,466 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:14:55,466 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:14:55,466 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:14:55,466 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:14:55,466 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:14:55,466 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:14:55,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:14:55,467 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:14:55,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:14:55,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:14:55,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:14:55,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:14:55,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:14:55,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:14:55,468 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:14:55,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:14:55,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:14:55,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:14:55,509 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:14:55,515 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:14:55,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:14:55,516 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:14:55,517 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 14:14:55,646 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:14:55,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:14:55,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:14:55,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:14:55,652 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:14:55,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7783ef04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55, skipping insertion in model container [2018-02-04 14:14:55,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,670 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:14:55,697 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:14:55,787 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:14:55,800 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:14:55,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55 WrapperNode [2018-02-04 14:14:55,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:14:55,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:14:55,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:14:55,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:14:55,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (1/1) ... [2018-02-04 14:14:55,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:14:55,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:14:55,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:14:55,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:14:55,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (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 14:14:55,876 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:14:55,876 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:14:55,876 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 14:14:55,876 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-02-04 14:14:55,877 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-02-04 14:14:55,877 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-02-04 14:14:55,877 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:14:55,877 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:14:55,877 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:14:55,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:14:55,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-02-04 14:14:55,878 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:14:55,879 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:14:55,879 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:14:56,171 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:14:56,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:14:56 BoogieIcfgContainer [2018-02-04 14:14:56,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:14:56,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:14:56,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:14:56,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:14:56,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:14:55" (1/3) ... [2018-02-04 14:14:56,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b740347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:14:56, skipping insertion in model container [2018-02-04 14:14:56,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:14:55" (2/3) ... [2018-02-04 14:14:56,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b740347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:14:56, skipping insertion in model container [2018-02-04 14:14:56,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:14:56" (3/3) ... [2018-02-04 14:14:56,178 INFO L107 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-02-04 14:14:56,185 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:14:56,192 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 14:14:56,220 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:14:56,221 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:14:56,221 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:14:56,221 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:14:56,221 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:14:56,221 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:14:56,221 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:14:56,221 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:14:56,221 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:14:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-02-04 14:14:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 14:14:56,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:56,240 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:14:56,240 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 14:14:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash 436525791, now seen corresponding path program 1 times [2018-02-04 14:14:56,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:56,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:56,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:56,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:56,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:56,357 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 14:14:56,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:56,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:14:56,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:14:56,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:14:56,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:14:56,370 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-02-04 14:14:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:56,527 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-04 14:14:56,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:14:56,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 14:14:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:56,534 INFO L225 Difference]: With dead ends: 120 [2018-02-04 14:14:56,534 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 14:14:56,535 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 14:14:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 14:14:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-04 14:14:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 14:14:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-04 14:14:56,568 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 7 [2018-02-04 14:14:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:56,568 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-04 14:14:56,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:14:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-04 14:14:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 14:14:56,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:56,569 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:14:56,569 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 14:14:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash 436525792, now seen corresponding path program 1 times [2018-02-04 14:14:56,570 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:56,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:56,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:56,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:56,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:56,636 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 14:14:56,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:56,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:14:56,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:14:56,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:14:56,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:14:56,639 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2018-02-04 14:14:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:56,731 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-02-04 14:14:56,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:14:56,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 14:14:56,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:56,733 INFO L225 Difference]: With dead ends: 114 [2018-02-04 14:14:56,733 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 14:14:56,733 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 14:14:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 14:14:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 14:14:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 14:14:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-02-04 14:14:56,741 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 7 [2018-02-04 14:14:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:56,741 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-02-04 14:14:56,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:14:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-02-04 14:14:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:14:56,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:56,742 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:14:56,742 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 14:14:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -711243012, now seen corresponding path program 1 times [2018-02-04 14:14:56,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:56,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:56,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:56,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:56,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:56,799 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 14:14:56,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:56,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:14:56,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:14:56,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:14:56,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:14:56,800 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 5 states. [2018-02-04 14:14:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:56,867 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2018-02-04 14:14:56,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:14:56,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 14:14:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:56,870 INFO L225 Difference]: With dead ends: 150 [2018-02-04 14:14:56,870 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 14:14:56,871 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 14:14:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 14:14:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-02-04 14:14:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 14:14:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2018-02-04 14:14:56,879 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 15 [2018-02-04 14:14:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:56,879 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2018-02-04 14:14:56,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:14:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-02-04 14:14:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:14:56,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:56,880 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:14:56,880 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 14:14:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash -714029430, now seen corresponding path program 1 times [2018-02-04 14:14:56,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:56,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:56,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,881 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:56,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:56,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:56,919 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 14:14:56,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:56,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:14:56,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:14:56,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:14:56,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:14:56,920 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 4 states. [2018-02-04 14:14:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:57,061 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-02-04 14:14:57,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:14:57,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 14:14:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:57,062 INFO L225 Difference]: With dead ends: 154 [2018-02-04 14:14:57,062 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 14:14:57,062 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 14:14:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 14:14:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-02-04 14:14:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 14:14:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-02-04 14:14:57,070 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 15 [2018-02-04 14:14:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:57,071 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-02-04 14:14:57,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:14:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-02-04 14:14:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:14:57,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:57,071 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:14:57,071 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 14:14:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash -714029429, now seen corresponding path program 1 times [2018-02-04 14:14:57,071 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:57,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:57,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:57,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:57,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:57,128 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 14:14:57,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:57,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:14:57,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:14:57,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:14:57,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:14:57,129 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 4 states. [2018-02-04 14:14:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:57,229 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2018-02-04 14:14:57,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:14:57,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 14:14:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:57,230 INFO L225 Difference]: With dead ends: 155 [2018-02-04 14:14:57,230 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 14:14:57,231 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 14:14:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 14:14:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-02-04 14:14:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 14:14:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-02-04 14:14:57,238 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 15 [2018-02-04 14:14:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:57,239 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-02-04 14:14:57,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:14:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-02-04 14:14:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:14:57,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:57,239 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 14:14:57,240 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 14:14:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485069, now seen corresponding path program 1 times [2018-02-04 14:14:57,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:57,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:57,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:57,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:57,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:57,305 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 14:14:57,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:57,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:14:57,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:14:57,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:14:57,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:14:57,306 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 7 states. [2018-02-04 14:14:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:57,468 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2018-02-04 14:14:57,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:14:57,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 14:14:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:57,469 INFO L225 Difference]: With dead ends: 162 [2018-02-04 14:14:57,469 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 14:14:57,469 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 14:14:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 14:14:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 133. [2018-02-04 14:14:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 14:14:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-02-04 14:14:57,477 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 17 [2018-02-04 14:14:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:57,477 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-02-04 14:14:57,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:14:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-02-04 14:14:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:14:57,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:57,478 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 14:14:57,479 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 14:14:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485070, now seen corresponding path program 1 times [2018-02-04 14:14:57,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:57,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:57,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:57,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:57,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:57,538 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 14:14:57,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:57,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:14:57,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:14:57,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:14:57,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:14:57,539 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 4 states. [2018-02-04 14:14:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:57,622 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-02-04 14:14:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:14:57,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 14:14:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:57,623 INFO L225 Difference]: With dead ends: 132 [2018-02-04 14:14:57,623 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 14:14:57,624 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 14:14:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 14:14:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-04 14:14:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 14:14:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-02-04 14:14:57,627 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 17 [2018-02-04 14:14:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:57,627 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-02-04 14:14:57,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:14:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-02-04 14:14:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:14:57,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:57,627 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 14:14:57,628 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 14:14:57,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937321, now seen corresponding path program 1 times [2018-02-04 14:14:57,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:57,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:57,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:57,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:57,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:57,680 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 14:14:57,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:57,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:14:57,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:14:57,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:14:57,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:14:57,681 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-02-04 14:14:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:57,827 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2018-02-04 14:14:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:14:57,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 14:14:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:57,829 INFO L225 Difference]: With dead ends: 155 [2018-02-04 14:14:57,829 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 14:14:57,829 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 14:14:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 14:14:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-02-04 14:14:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 14:14:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2018-02-04 14:14:57,834 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 20 [2018-02-04 14:14:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:57,834 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2018-02-04 14:14:57,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:14:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-02-04 14:14:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:14:57,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:57,835 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 14:14:57,835 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 14:14:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937322, now seen corresponding path program 1 times [2018-02-04 14:14:57,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:57,835 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:57,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:57,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:57,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:57,895 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 14:14:57,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:57,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:14:57,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:14:57,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:14:57,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:14:57,896 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand 6 states. [2018-02-04 14:14:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:58,062 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-02-04 14:14:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:14:58,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 14:14:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:58,063 INFO L225 Difference]: With dead ends: 152 [2018-02-04 14:14:58,063 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 14:14:58,064 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 14:14:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 14:14:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-02-04 14:14:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 14:14:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2018-02-04 14:14:58,067 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 20 [2018-02-04 14:14:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:58,068 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2018-02-04 14:14:58,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:14:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2018-02-04 14:14:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:14:58,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:58,069 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 14:14:58,069 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 14:14:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2044804781, now seen corresponding path program 1 times [2018-02-04 14:14:58,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:58,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:58,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:58,070 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:58,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:58,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:14:58,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:58,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:14:58,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:14:58,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:14:58,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:14:58,180 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand 9 states. [2018-02-04 14:14:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:58,341 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2018-02-04 14:14:58,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:14:58,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 14:14:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:58,342 INFO L225 Difference]: With dead ends: 170 [2018-02-04 14:14:58,342 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 14:14:58,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:14:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 14:14:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-02-04 14:14:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 14:14:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-02-04 14:14:58,348 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 24 [2018-02-04 14:14:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:58,348 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-02-04 14:14:58,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:14:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-02-04 14:14:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:14:58,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:58,349 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 14:14:58,349 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 14:14:58,349 INFO L82 PathProgramCache]: Analyzing trace with hash 560220083, now seen corresponding path program 1 times [2018-02-04 14:14:58,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:58,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:58,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:58,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:58,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:58,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:58,386 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 14:14:58,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:14:58,386 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 14:14:58,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:58,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:14:58,452 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 14:14:58,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:14:58,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 14:14:58,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:14:58,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:14:58,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:14:58,477 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 6 states. [2018-02-04 14:14:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:58,592 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-02-04 14:14:58,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:14:58,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 14:14:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:58,593 INFO L225 Difference]: With dead ends: 169 [2018-02-04 14:14:58,593 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 14:14:58,594 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 14:14:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 14:14:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-02-04 14:14:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 14:14:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2018-02-04 14:14:58,605 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 24 [2018-02-04 14:14:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:58,605 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2018-02-04 14:14:58,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:14:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2018-02-04 14:14:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:14:58,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:58,607 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 14:14:58,607 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 14:14:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash 560220084, now seen corresponding path program 1 times [2018-02-04 14:14:58,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:58,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:58,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:58,608 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:58,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:58,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:58,768 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 14:14:58,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:14:58,768 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 14:14:58,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:58,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:14:58,870 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 14:14:58,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:14:58,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2018-02-04 14:14:58,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 14:14:58,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 14:14:58,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:14:58,900 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 16 states. [2018-02-04 14:14:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:59,193 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2018-02-04 14:14:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:14:59,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-02-04 14:14:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:59,195 INFO L225 Difference]: With dead ends: 168 [2018-02-04 14:14:59,195 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 14:14:59,195 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 14:14:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 14:14:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-02-04 14:14:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 14:14:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2018-02-04 14:14:59,201 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 24 [2018-02-04 14:14:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:59,201 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2018-02-04 14:14:59,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 14:14:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2018-02-04 14:14:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 14:14:59,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:59,202 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 14:14:59,202 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 14:14:59,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1681609457, now seen corresponding path program 1 times [2018-02-04 14:14:59,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:59,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:59,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:59,204 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:59,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:59,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:14:59,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:14:59,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:14:59,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:14:59,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:14:59,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:14:59,280 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand 8 states. [2018-02-04 14:14:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:59,389 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2018-02-04 14:14:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:14:59,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 14:14:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:59,390 INFO L225 Difference]: With dead ends: 172 [2018-02-04 14:14:59,390 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 14:14:59,390 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 14:14:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 14:14:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2018-02-04 14:14:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 14:14:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2018-02-04 14:14:59,395 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 26 [2018-02-04 14:14:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:59,395 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2018-02-04 14:14:59,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:14:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2018-02-04 14:14:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 14:14:59,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:59,396 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 14:14:59,396 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 14:14:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1579097554, now seen corresponding path program 1 times [2018-02-04 14:14:59,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:59,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:59,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:59,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:59,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:59,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:59,435 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 14:14:59,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:14:59,435 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 14:14:59,443 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:59,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:14:59,498 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 14:14:59,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:59,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:59,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:14:59,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:59,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:59,514 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 14:14:59,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:59,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:59,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 14:14:59,530 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 14:14:59,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:14:59,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-02-04 14:14:59,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:14:59,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:14:59,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:14:59,564 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand 8 states. [2018-02-04 14:14:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:14:59,755 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2018-02-04 14:14:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:14:59,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-04 14:14:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:14:59,756 INFO L225 Difference]: With dead ends: 187 [2018-02-04 14:14:59,756 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 14:14:59,756 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 14:14:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 14:14:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 164. [2018-02-04 14:14:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 14:14:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2018-02-04 14:14:59,760 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 29 [2018-02-04 14:14:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:14:59,760 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2018-02-04 14:14:59,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:14:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2018-02-04 14:14:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:14:59,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:14:59,761 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 14:14:59,761 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 14:14:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1385679684, now seen corresponding path program 1 times [2018-02-04 14:14:59,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:14:59,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:14:59,763 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:59,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:59,763 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:14:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:59,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:14:59,909 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 14:14:59,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:14:59,909 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 14:14:59,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:14:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:14:59,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:14:59,978 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 14:14:59,980 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 14:14:59,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:59,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:59,986 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 14:14:59,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-04 14:15:00,035 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 14:15:00,037 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 14:15:00,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:15:00,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:15:00,039 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 14:15:00,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-04 14:15:00,078 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 14:15:00,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:15:00,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-02-04 14:15:00,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 14:15:00,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 14:15:00,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 14:15:00,107 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand 19 states. [2018-02-04 14:15:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:15:00,888 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2018-02-04 14:15:00,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 14:15:00,888 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-02-04 14:15:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:15:00,889 INFO L225 Difference]: With dead ends: 243 [2018-02-04 14:15:00,890 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 14:15:00,890 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 14:15:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 14:15:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 205. [2018-02-04 14:15:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 14:15:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2018-02-04 14:15:00,894 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 30 [2018-02-04 14:15:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:15:00,894 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2018-02-04 14:15:00,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 14:15:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2018-02-04 14:15:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:15:00,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:15:00,895 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 14:15:00,895 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 14:15:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902430, now seen corresponding path program 1 times [2018-02-04 14:15:00,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:15:00,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:15:00,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:00,897 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:00,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:00,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:15:00,944 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 14:15:00,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:15:00,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:15:00,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:15:00,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:15:00,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:15:00,946 INFO L87 Difference]: Start difference. First operand 205 states and 242 transitions. Second operand 6 states. [2018-02-04 14:15:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:15:01,144 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2018-02-04 14:15:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:15:01,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 14:15:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:15:01,146 INFO L225 Difference]: With dead ends: 240 [2018-02-04 14:15:01,146 INFO L226 Difference]: Without dead ends: 240 [2018-02-04 14:15:01,147 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 14:15:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-04 14:15:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2018-02-04 14:15:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 14:15:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 241 transitions. [2018-02-04 14:15:01,153 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 241 transitions. Word has length 31 [2018-02-04 14:15:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:15:01,153 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 241 transitions. [2018-02-04 14:15:01,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:15:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 241 transitions. [2018-02-04 14:15:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:15:01,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:15:01,154 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 14:15:01,154 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 14:15:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902431, now seen corresponding path program 1 times [2018-02-04 14:15:01,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:15:01,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:15:01,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:01,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:01,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:01,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:15:01,183 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 14:15:01,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:15:01,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:15:01,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:15:01,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:15:01,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:15:01,184 INFO L87 Difference]: Start difference. First operand 204 states and 241 transitions. Second operand 4 states. [2018-02-04 14:15:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:15:01,190 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2018-02-04 14:15:01,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:15:01,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-04 14:15:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:15:01,191 INFO L225 Difference]: With dead ends: 215 [2018-02-04 14:15:01,191 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 14:15:01,191 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 14:15:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 14:15:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204. [2018-02-04 14:15:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 14:15:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2018-02-04 14:15:01,197 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 31 [2018-02-04 14:15:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:15:01,197 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2018-02-04 14:15:01,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:15:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2018-02-04 14:15:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 14:15:01,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:15:01,198 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 14:15:01,198 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 14:15:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636396, now seen corresponding path program 1 times [2018-02-04 14:15:01,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:15:01,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:15:01,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:01,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:01,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:01,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:15:01,626 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 14:15:01,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:15:01,626 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 14:15:01,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:01,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:15:01,700 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 14:15:01,701 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 14:15:01,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:15:01,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:15:01,707 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 14:15:01,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 14:15:01,859 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 14:15:01,864 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 14:15:01,865 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 14:15:01,869 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 14:15:01,876 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 14:15:01,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2018-02-04 14:15:01,921 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 14:15:01,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:15:01,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-02-04 14:15:01,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 14:15:01,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 14:15:01,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-02-04 14:15:01,953 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand 26 states. [2018-02-04 14:15:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:15:04,082 INFO L93 Difference]: Finished difference Result 391 states and 473 transitions. [2018-02-04 14:15:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 14:15:04,082 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-04 14:15:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:15:04,084 INFO L225 Difference]: With dead ends: 391 [2018-02-04 14:15:04,084 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 14:15:04,085 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 14:15:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 14:15:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 286. [2018-02-04 14:15:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 14:15:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2018-02-04 14:15:04,093 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 33 [2018-02-04 14:15:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:15:04,093 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2018-02-04 14:15:04,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 14:15:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2018-02-04 14:15:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 14:15:04,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:15:04,094 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 14:15:04,094 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 14:15:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636395, now seen corresponding path program 1 times [2018-02-04 14:15:04,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:15:04,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:15:04,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:04,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:04,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:04,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:15:04,475 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 14:15:04,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:15:04,475 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 14:15:04,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:04,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:15:04,567 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 14:15:04,569 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 14:15:04,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,577 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 14:15:04,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 14:15:04,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,585 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 14:15:04,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:38 [2018-02-04 14:15:04,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-02-04 14:15:04,699 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 14:15:04,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,705 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 14:15:04,706 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 14:15:04,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:15:04,711 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 14:15:04,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:14 [2018-02-04 14:15:04,732 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 14:15:04,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:15:04,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-02-04 14:15:04,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 14:15:04,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 14:15:04,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=621, Unknown=3, NotChecked=0, Total=702 [2018-02-04 14:15:04,755 INFO L87 Difference]: Start difference. First operand 286 states and 349 transitions. Second operand 27 states. [2018-02-04 14:15:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:15:07,016 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2018-02-04 14:15:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 14:15:07,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-02-04 14:15:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:15:07,017 INFO L225 Difference]: With dead ends: 398 [2018-02-04 14:15:07,017 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 14:15:07,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=369, Invalid=2068, Unknown=13, NotChecked=0, Total=2450 [2018-02-04 14:15:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 14:15:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 322. [2018-02-04 14:15:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-04 14:15:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 395 transitions. [2018-02-04 14:15:07,025 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 395 transitions. Word has length 33 [2018-02-04 14:15:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:15:07,025 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 395 transitions. [2018-02-04 14:15:07,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 14:15:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 395 transitions. [2018-02-04 14:15:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 14:15:07,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:15:07,026 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 14:15:07,026 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 14:15:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217638, now seen corresponding path program 1 times [2018-02-04 14:15:07,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:15:07,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:15:07,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:07,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:07,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:07,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:15:07,094 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 14:15:07,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:15:07,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:15:07,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:15:07,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:15:07,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:15:07,095 INFO L87 Difference]: Start difference. First operand 322 states and 395 transitions. Second operand 7 states. [2018-02-04 14:15:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:15:07,294 INFO L93 Difference]: Finished difference Result 357 states and 433 transitions. [2018-02-04 14:15:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:15:07,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-04 14:15:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:15:07,295 INFO L225 Difference]: With dead ends: 357 [2018-02-04 14:15:07,295 INFO L226 Difference]: Without dead ends: 357 [2018-02-04 14:15:07,296 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 14:15:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-04 14:15:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2018-02-04 14:15:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 14:15:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 425 transitions. [2018-02-04 14:15:07,303 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 425 transitions. Word has length 36 [2018-02-04 14:15:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:15:07,304 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 425 transitions. [2018-02-04 14:15:07,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:15:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 425 transitions. [2018-02-04 14:15:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 14:15:07,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:15:07,304 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 14:15:07,305 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 14:15:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217639, now seen corresponding path program 1 times [2018-02-04 14:15:07,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:15:07,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:15:07,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:07,306 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:07,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:07,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:15:07,351 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 14:15:07,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:15:07,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:15:07,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:15:07,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:15:07,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:15:07,352 INFO L87 Difference]: Start difference. First operand 342 states and 425 transitions. Second operand 7 states. [2018-02-04 14:15:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:15:07,538 INFO L93 Difference]: Finished difference Result 347 states and 419 transitions. [2018-02-04 14:15:07,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:15:07,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-04 14:15:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:15:07,540 INFO L225 Difference]: With dead ends: 347 [2018-02-04 14:15:07,541 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 14:15:07,541 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 14:15:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 14:15:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 339. [2018-02-04 14:15:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 14:15:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 413 transitions. [2018-02-04 14:15:07,548 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 413 transitions. Word has length 36 [2018-02-04 14:15:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:15:07,548 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 413 transitions. [2018-02-04 14:15:07,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:15:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 413 transitions. [2018-02-04 14:15:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 14:15:07,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:15:07,549 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 14:15:07,549 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 14:15:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1964561354, now seen corresponding path program 1 times [2018-02-04 14:15:07,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:15:07,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:15:07,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:07,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:07,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:15:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:07,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:15:07,818 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 14:15:07,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:15:07,818 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 14:15:07,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:15:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:15:07,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:15:07,941 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 14:15:07,942 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 14:15:07,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:15:07,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:15:07,948 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 14:15:07,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-02-04 14:15:10,081 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 14:15:10,094 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 14:15:10,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:15:10,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:15:10,101 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 14:15:10,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:18 [2018-02-04 14:15:10,139 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 14:15:10,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:15:10,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-02-04 14:15:10,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 14:15:10,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 14:15:10,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=530, Unknown=1, NotChecked=0, Total=600 [2018-02-04 14:15:10,156 INFO L87 Difference]: Start difference. First operand 339 states and 413 transitions. Second operand 25 states. [2018-02-04 14:16:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:16:36,183 INFO L93 Difference]: Finished difference Result 410 states and 493 transitions. [2018-02-04 14:16:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 14:16:36,184 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2018-02-04 14:16:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:16:36,185 INFO L225 Difference]: With dead ends: 410 [2018-02-04 14:16:36,185 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 14:16:36,186 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 14:16:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 14:16:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 316. [2018-02-04 14:16:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 14:16:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2018-02-04 14:16:36,190 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 35 [2018-02-04 14:16:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:16:36,191 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2018-02-04 14:16:36,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 14:16:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2018-02-04 14:16:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 14:16:36,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:16:36,191 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 14:16:36,191 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 14:16:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash -137022243, now seen corresponding path program 1 times [2018-02-04 14:16:36,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:16:36,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:16:36,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:36,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:16:36,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:16:36,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:16:36,240 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 14:16:36,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:16:36,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:16:36,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:16:36,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:16:36,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:16:36,241 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand 7 states. [2018-02-04 14:16:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:16:36,411 INFO L93 Difference]: Finished difference Result 332 states and 399 transitions. [2018-02-04 14:16:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:16:36,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 14:16:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:16:36,412 INFO L225 Difference]: With dead ends: 332 [2018-02-04 14:16:36,412 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 14:16:36,413 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 14:16:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 14:16:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 310. [2018-02-04 14:16:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-04 14:16:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2018-02-04 14:16:36,419 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 38 [2018-02-04 14:16:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:16:36,419 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2018-02-04 14:16:36,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:16:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2018-02-04 14:16:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 14:16:36,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:16:36,420 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 14:16:36,420 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 14:16:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1296859951, now seen corresponding path program 1 times [2018-02-04 14:16:36,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:16:36,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:16:36,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:36,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:16:36,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:16:36,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:16:36,532 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 14:16:36,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:16:36,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:16:36,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:16:36,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:16:36,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:16:36,533 INFO L87 Difference]: Start difference. First operand 310 states and 374 transitions. Second operand 10 states. [2018-02-04 14:16:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:16:36,781 INFO L93 Difference]: Finished difference Result 377 states and 459 transitions. [2018-02-04 14:16:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:16:36,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-04 14:16:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:16:36,782 INFO L225 Difference]: With dead ends: 377 [2018-02-04 14:16:36,782 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 14:16:36,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:16:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 14:16:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 350. [2018-02-04 14:16:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 14:16:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 428 transitions. [2018-02-04 14:16:36,789 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 428 transitions. Word has length 39 [2018-02-04 14:16:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:16:36,789 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 428 transitions. [2018-02-04 14:16:36,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:16:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 428 transitions. [2018-02-04 14:16:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 14:16:36,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:16:36,790 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 14:16:36,790 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 14:16:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 190013480, now seen corresponding path program 1 times [2018-02-04 14:16:36,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:16:36,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:16:36,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:36,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:16:36,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:16:36,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:16:37,075 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 14:16:37,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:16:37,075 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 14:16:37,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:16:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:16:37,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:16:37,241 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 14:16:37,243 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 14:16:37,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,254 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 14:16:37,255 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 14:16:37,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,264 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 14:16:37,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2018-02-04 14:16:37,329 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 14:16:37,331 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 14:16:37,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,340 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 14:16:37,342 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 14:16:37,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:37,350 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 14:16:37,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2018-02-04 14:16:37,393 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 14:16:37,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:16:37,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2018-02-04 14:16:37,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 14:16:37,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 14:16:37,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-02-04 14:16:37,411 INFO L87 Difference]: Start difference. First operand 350 states and 428 transitions. Second operand 30 states. [2018-02-04 14:16:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:16:37,796 INFO L93 Difference]: Finished difference Result 357 states and 436 transitions. [2018-02-04 14:16:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:16:37,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2018-02-04 14:16:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:16:37,797 INFO L225 Difference]: With dead ends: 357 [2018-02-04 14:16:37,797 INFO L226 Difference]: Without dead ends: 357 [2018-02-04 14:16:37,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 14:16:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-04 14:16:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 350. [2018-02-04 14:16:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 14:16:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 427 transitions. [2018-02-04 14:16:37,801 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 427 transitions. Word has length 39 [2018-02-04 14:16:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:16:37,801 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 427 transitions. [2018-02-04 14:16:37,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 14:16:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 427 transitions. [2018-02-04 14:16:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 14:16:37,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:16:37,802 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 14:16:37,802 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 14:16:37,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1458117372, now seen corresponding path program 1 times [2018-02-04 14:16:37,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:16:37,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:16:37,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:37,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:16:37,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:16:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:16:37,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:16:38,145 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 14:16:38,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:16:38,145 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 14:16:38,153 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:16:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:16:38,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:16:38,187 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 14:16:38,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 14:16:38,203 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 14:16:38,204 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 14:16:38,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,210 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 14:16:38,212 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 14:16:38,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-02-04 14:16:38,222 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 14:16:38,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,230 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 14:16:38,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,242 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 14:16:38,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,249 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 14:16:38,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-02-04 14:16:38,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,297 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 14:16:38,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-02-04 14:16:38,352 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 14:16:38,354 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 14:16:38,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,371 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 14:16:38,372 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 14:16:38,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:68 [2018-02-04 14:16:38,417 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 14:16:38,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,421 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 14:16:38,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,447 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 14:16:38,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,450 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 14:16:38,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-04 14:16:38,502 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 14:16:38,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,512 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 14:16:38,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:16:38,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:16:38,569 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 14:16:38,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,572 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:16:38,573 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 14:16:38,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:38,589 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 14:16:38,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:38,612 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 14:16:38,613 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 14:16:38,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:16:38,665 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 14:16:38,665 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:207 [2018-02-04 14:16:39,195 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 14:16:39,200 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 14:16:39,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:39,424 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 14:16:39,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:39,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:39,564 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 14:16:39,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 14:16:39,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:39,675 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 14:16:39,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 14:16:39,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 14:16:39,885 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 14:16:39,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:39,892 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:16:39,892 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:16:39,893 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 14:16:39,893 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,136 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 14:16:40,136 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:40,216 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 14:16:40,217 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 14:16:40,266 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:16:40,272 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 14:16:40,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:40,277 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 14:16:40,277 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,291 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,293 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:16:40,295 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 14:16:40,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:40,297 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:16:40,298 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 14:16:40,298 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,314 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,444 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 14:16:40,462 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 14:16:40,463 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,743 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 14:16:40,743 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:40,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:40,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:40,925 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 14:16:40,926 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-02-04 14:16:41,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,082 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 14:16:41,083 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 14:16:41,202 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 14:16:41,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,410 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 14:16:41,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,414 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 14:16:41,414 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:41,431 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:41,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,437 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 14:16:41,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,444 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 14:16:41,444 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:41,466 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:16:41,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,487 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 14:16:41,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,505 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 14:16:41,506 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-02-04 14:16:41,730 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 14:16:41,730 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 14:16:41,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:41,847 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 14:16:41,848 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-02-04 14:16:41,995 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 14:16:41,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:42,001 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 14:16:42,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:16:42,010 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 14:16:42,011 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-02-04 14:16:42,065 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:16:42,286 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 14:16:42,286 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 12 variables, input treesize:263, output treesize:1071 [2018-02-04 14:17:08,599 WARN L146 SmtUtils]: Spent 26143ms on a formula simplification. DAG size of input: 230 DAG size of output 184 [2018-02-04 14:17:08,639 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 14:17:08,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:08,651 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 14:17:08,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:08,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:08,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:08,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:08,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:08,786 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 14:17:08,787 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 14:17:08,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:08,920 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 14:17:08,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:09,041 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 14:17:09,042 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 14:17:09,148 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 14:17:09,149 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:09,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:09,262 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 14:17:09,263 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 14:17:09,265 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 14:17:09,266 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 14:17:09,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:09,375 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:09,378 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 14:17:09,379 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 14:17:09,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:09,496 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 14:17:09,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:09,605 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 14:17:09,846 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 14:17:09,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:09,859 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 14:17:09,859 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 14:17:09,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:09,882 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 14:17:09,882 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:09,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:09,888 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 14:17:09,888 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:09,909 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 14:17:10,160 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 14:17:10,162 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 14:17:10,162 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,173 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 14:17:10,174 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,184 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 14:17:10,184 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,188 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,198 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 14:17:10,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,213 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 14:17:10,213 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,306 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 14:17:10,306 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,399 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 14:17:10,399 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,477 INFO L267 ElimStorePlain]: Start of recursive call 20: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,483 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 14:17:10,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,487 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 14:17:10,488 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,513 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 14:17:10,513 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,538 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 14:17:10,539 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,561 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 14:17:10,561 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,580 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 14:17:10,581 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,588 INFO L267 ElimStorePlain]: Start of recursive call 24: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,594 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 14:17:10,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,603 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 14:17:10,603 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,633 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 14:17:10,633 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,659 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 14:17:10,659 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,677 INFO L267 ElimStorePlain]: Start of recursive call 30: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,683 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 14:17:10,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,685 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 14:17:10,686 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,721 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 14:17:10,721 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:10,752 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 14:17:10,753 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,780 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 14:17:10,780 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,837 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 14:17:10,837 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:10,865 INFO L267 ElimStorePlain]: Start of recursive call 34: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:17:10,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,875 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 14:17:10,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,888 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 14:17:10,889 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,921 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:10,921 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 14:17:10,922 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,956 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:10,957 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 14:17:10,958 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:10,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:10,976 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 14:17:10,977 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:11,020 INFO L267 ElimStorePlain]: Start of recursive call 40: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:17:11,204 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 14:17:11,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:11,206 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:11,206 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 14:17:11,206 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:11,216 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 14:17:11,216 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,226 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,395 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 14:17:11,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:11,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:11,399 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 14:17:11,399 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 14:17:11,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:11,414 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 14:17:11,414 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,419 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,421 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 14:17:11,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:11,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, 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 14:17:11,423 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,429 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 14:17:11,429 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,432 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,577 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 14:17:11,578 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 14:17:11,578 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:11,583 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 14:17:11,583 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,585 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:11,616 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 14:17:11,617 INFO L202 ElimStorePlain]: Needed 56 recursive calls to eliminate 27 variables, input treesize:968, output treesize:7 [2018-02-04 14:17:11,638 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 14:17:11,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:17:11,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2018-02-04 14:17:11,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 14:17:11,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 14:17:11,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=606, Unknown=8, NotChecked=0, Total=702 [2018-02-04 14:17:11,655 INFO L87 Difference]: Start difference. First operand 350 states and 427 transitions. Second operand 27 states. [2018-02-04 14:17:16,590 WARN L146 SmtUtils]: Spent 2917ms on a formula simplification. DAG size of input: 208 DAG size of output 205 [2018-02-04 14:17:19,504 WARN L143 SmtUtils]: Spent 2825ms on a formula simplification that was a NOOP. DAG size: 193 [2018-02-04 14:17:21,566 WARN L143 SmtUtils]: Spent 1990ms on a formula simplification that was a NOOP. DAG size: 197 [2018-02-04 14:17:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:17:22,267 INFO L93 Difference]: Finished difference Result 463 states and 553 transitions. [2018-02-04 14:17:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 14:17:22,267 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2018-02-04 14:17:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:17:22,268 INFO L225 Difference]: With dead ends: 463 [2018-02-04 14:17:22,268 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 14:17:22,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=311, Invalid=1920, Unknown=25, NotChecked=0, Total=2256 [2018-02-04 14:17:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 14:17:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 330. [2018-02-04 14:17:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 14:17:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 398 transitions. [2018-02-04 14:17:22,273 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 398 transitions. Word has length 39 [2018-02-04 14:17:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:17:22,273 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 398 transitions. [2018-02-04 14:17:22,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 14:17:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 398 transitions. [2018-02-04 14:17:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 14:17:22,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:17:22,273 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 14:17:22,273 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 14:17:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash 750521981, now seen corresponding path program 1 times [2018-02-04 14:17:22,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:17:22,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:17:22,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:22,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:22,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:22,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:17:22,375 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 14:17:22,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:17:22,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:17:22,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:17:22,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:17:22,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:17:22,376 INFO L87 Difference]: Start difference. First operand 330 states and 398 transitions. Second operand 10 states. [2018-02-04 14:17:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:17:22,594 INFO L93 Difference]: Finished difference Result 353 states and 421 transitions. [2018-02-04 14:17:22,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:17:22,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-02-04 14:17:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:17:22,595 INFO L225 Difference]: With dead ends: 353 [2018-02-04 14:17:22,595 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 14:17:22,595 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 14:17:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 14:17:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 330. [2018-02-04 14:17:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 14:17:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 394 transitions. [2018-02-04 14:17:22,600 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 394 transitions. Word has length 41 [2018-02-04 14:17:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:17:22,601 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 394 transitions. [2018-02-04 14:17:22,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:17:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 394 transitions. [2018-02-04 14:17:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 14:17:22,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:17:22,602 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 14:17:22,602 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 14:17:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash -296541728, now seen corresponding path program 1 times [2018-02-04 14:17:22,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:17:22,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:17:22,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:22,603 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:22,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:22,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:17:22,917 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 14:17:22,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:17:22,917 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 14:17:22,922 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:22,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:17:23,006 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 14:17:23,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 14:17:23,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,015 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 14:17:23,016 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 14:17:23,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-02-04 14:17:23,050 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 14:17:23,058 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 14:17:23,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:23,075 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 14:17:23,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:17:23,136 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 14:17:23,139 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 14:17:23,139 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:23,179 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 14:17:23,180 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:54, output treesize:87 [2018-02-04 14:17:24,148 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 14:17:24,154 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 14:17:24,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:24,162 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 14:17:24,163 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 14:17:24,169 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 14:17:24,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2018-02-04 14:17:24,187 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 14:17:24,188 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 14:17:24,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:24,197 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 14:17:24,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:24,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:24,204 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 14:17:24,209 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 14:17:24,210 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:24,218 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 14:17:24,219 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:24,219 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 14:17:24,220 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:24,227 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:17:24,239 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 14:17:24,239 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:110, output treesize:25 [2018-02-04 14:17:24,294 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 14:17:24,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:17:24,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-02-04 14:17:24,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 14:17:24,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 14:17:24,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=711, Unknown=5, NotChecked=0, Total=812 [2018-02-04 14:17:24,326 INFO L87 Difference]: Start difference. First operand 330 states and 394 transitions. Second operand 29 states. [2018-02-04 14:17:25,636 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 94 DAG size of output 67 [2018-02-04 14:17:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:17:26,892 INFO L93 Difference]: Finished difference Result 428 states and 522 transitions. [2018-02-04 14:17:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 14:17:26,892 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2018-02-04 14:17:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:17:26,893 INFO L225 Difference]: With dead ends: 428 [2018-02-04 14:17:26,893 INFO L226 Difference]: Without dead ends: 428 [2018-02-04 14:17:26,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=411, Invalid=2235, Unknown=6, NotChecked=0, Total=2652 [2018-02-04 14:17:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-04 14:17:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 360. [2018-02-04 14:17:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-04 14:17:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 436 transitions. [2018-02-04 14:17:26,898 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 436 transitions. Word has length 42 [2018-02-04 14:17:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:17:26,899 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 436 transitions. [2018-02-04 14:17:26,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 14:17:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 436 transitions. [2018-02-04 14:17:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:17:26,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:17:26,899 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 14:17:26,899 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 14:17:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1152741502, now seen corresponding path program 1 times [2018-02-04 14:17:26,900 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:17:26,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:17:26,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:26,900 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:26,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:26,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:17:27,043 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 14:17:27,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:17:27,043 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 14:17:27,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:27,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:17:27,087 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 14:17:27,088 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 14:17:27,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 14:17:27,110 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 14:17:27,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:27,112 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 14:17:27,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-04 14:17:27,148 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 14:17:27,150 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 14:17:27,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:27,174 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 14:17:27,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 14:17:27,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:17:27,202 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 14:17:27,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:75 [2018-02-04 14:17:27,796 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 14:17:27,797 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 14:17:27,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:27,820 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 14:17:27,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:27,827 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 14:17:27,827 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:53, output treesize:5 [2018-02-04 14:17:27,836 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 14:17:27,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:17:27,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-02-04 14:17:27,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 14:17:27,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 14:17:27,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-02-04 14:17:27,854 INFO L87 Difference]: Start difference. First operand 360 states and 436 transitions. Second operand 28 states. [2018-02-04 14:17:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:17:29,866 INFO L93 Difference]: Finished difference Result 426 states and 521 transitions. [2018-02-04 14:17:29,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 14:17:29,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2018-02-04 14:17:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:17:29,867 INFO L225 Difference]: With dead ends: 426 [2018-02-04 14:17:29,867 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 14:17:29,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=352, Invalid=1810, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 14:17:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 14:17:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 372. [2018-02-04 14:17:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-04 14:17:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 451 transitions. [2018-02-04 14:17:29,872 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 451 transitions. Word has length 44 [2018-02-04 14:17:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:17:29,873 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 451 transitions. [2018-02-04 14:17:29,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 14:17:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 451 transitions. [2018-02-04 14:17:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:17:29,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:17:29,873 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 14:17:29,873 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 14:17:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1152741501, now seen corresponding path program 1 times [2018-02-04 14:17:29,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:17:29,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:17:29,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:29,874 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:29,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:29,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:17:30,112 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 14:17:30,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:17:30,112 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 14:17:30,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:30,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:17:30,181 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 14:17:30,183 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 14:17:30,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,192 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 14:17:30,193 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 14:17:30,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,200 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-02-04 14:17:30,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 14:17:30,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:30,223 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:30,223 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 14:17:30,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,238 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 14:17:30,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:30,241 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 14:17:30,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-02-04 14:17:30,294 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 14:17:30,296 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 14:17:30,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,331 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 14:17:30,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:30,333 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:30,335 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 14:17:30,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,356 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 14:17:30,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:30,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:17:30,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:17:30,382 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:75, output treesize:124 [2018-02-04 14:17:31,151 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 14:17:31,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:31,153 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 14:17:31,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:31,159 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 14:17:31,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:31,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:31,172 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 14:17:31,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:31,174 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 14:17:31,175 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:31,180 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 14:17:31,180 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:31,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:31,186 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 14:17:31,186 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:103, output treesize:11 [2018-02-04 14:17:31,222 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 14:17:31,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:17:31,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2018-02-04 14:17:31,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 14:17:31,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 14:17:31,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=783, Unknown=1, NotChecked=0, Total=870 [2018-02-04 14:17:31,239 INFO L87 Difference]: Start difference. First operand 372 states and 451 transitions. Second operand 30 states. [2018-02-04 14:17:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:17:35,014 INFO L93 Difference]: Finished difference Result 457 states and 570 transitions. [2018-02-04 14:17:35,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 14:17:35,014 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-02-04 14:17:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:17:35,015 INFO L225 Difference]: With dead ends: 457 [2018-02-04 14:17:35,015 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 14:17:35,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=622, Invalid=3159, Unknown=1, NotChecked=0, Total=3782 [2018-02-04 14:17:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 14:17:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 374. [2018-02-04 14:17:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 14:17:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 451 transitions. [2018-02-04 14:17:35,023 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 451 transitions. Word has length 44 [2018-02-04 14:17:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:17:35,023 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 451 transitions. [2018-02-04 14:17:35,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 14:17:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 451 transitions. [2018-02-04 14:17:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 14:17:35,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:17:35,024 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 14:17:35,024 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 14:17:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1242028496, now seen corresponding path program 1 times [2018-02-04 14:17:35,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:17:35,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:17:35,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:35,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:35,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:35,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:17:35,482 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 14:17:35,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:17:35,482 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 14:17:35,487 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:35,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:17:35,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:35,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:35,536 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 14:17:35,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 14:17:35,605 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 14:17:35,606 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 14:17:35,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,617 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 14:17:35,618 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 14:17:35,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-02-04 14:17:35,653 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 14:17:35,655 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 14:17:35,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,670 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 14:17:35,671 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 14:17:35,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,684 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 14:17:35,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:71 [2018-02-04 14:17:35,884 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 14:17:35,885 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 14:17:35,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,892 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 14:17:35,892 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 14:17:35,897 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 14:17:35,905 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 14:17:35,908 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 14:17:35,908 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 14:17:35,914 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 14:17:35,915 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:35,921 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 14:17:35,921 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:113, output treesize:7 [2018-02-04 14:17:35,945 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 14:17:35,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:17:35,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2018-02-04 14:17:35,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 14:17:35,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 14:17:35,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=867, Unknown=15, NotChecked=0, Total=992 [2018-02-04 14:17:35,963 INFO L87 Difference]: Start difference. First operand 374 states and 451 transitions. Second operand 32 states. [2018-02-04 14:17:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:17:37,575 INFO L93 Difference]: Finished difference Result 479 states and 606 transitions. [2018-02-04 14:17:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 14:17:37,576 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-02-04 14:17:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:17:37,577 INFO L225 Difference]: With dead ends: 479 [2018-02-04 14:17:37,577 INFO L226 Difference]: Without dead ends: 479 [2018-02-04 14:17:37,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=425, Invalid=2420, Unknown=17, NotChecked=0, Total=2862 [2018-02-04 14:17:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-02-04 14:17:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 305. [2018-02-04 14:17:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-04 14:17:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 361 transitions. [2018-02-04 14:17:37,581 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 361 transitions. Word has length 45 [2018-02-04 14:17:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:17:37,581 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 361 transitions. [2018-02-04 14:17:37,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 14:17:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 361 transitions. [2018-02-04 14:17:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 14:17:37,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:17:37,582 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 14:17:37,582 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 14:17:37,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1440013922, now seen corresponding path program 1 times [2018-02-04 14:17:37,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:17:37,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:17:37,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:37,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:37,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:37,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:17:38,172 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 14:17:38,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:17:38,173 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 14:17:38,177 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:38,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:17:38,196 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 14:17:38,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:38,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:38,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 14:17:38,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:38,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:38,235 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 14:17:38,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:38,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:38,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 14:17:38,276 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 14:17:38,278 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 14:17:38,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:38,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:38,291 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 14:17:38,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-02-04 14:17:40,356 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 14:17:40,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:40,544 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 14:17:40,545 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 14:17:40,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:40,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:40,555 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 14:17:40,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:31 [2018-02-04 14:17:40,776 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 14:17:40,777 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:40,777 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 14:17:40,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:40,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:40,784 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 14:17:40,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:5 [2018-02-04 14:17:40,802 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 14:17:40,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:17:40,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2018-02-04 14:17:40,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 14:17:40,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 14:17:40,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1301, Unknown=1, NotChecked=72, Total=1482 [2018-02-04 14:17:40,820 INFO L87 Difference]: Start difference. First operand 305 states and 361 transitions. Second operand 39 states. [2018-02-04 14:17:46,636 WARN L143 SmtUtils]: Spent 1411ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-04 14:17:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:17:57,942 INFO L93 Difference]: Finished difference Result 463 states and 538 transitions. [2018-02-04 14:17:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 14:17:57,942 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-02-04 14:17:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:17:57,943 INFO L225 Difference]: With dead ends: 463 [2018-02-04 14:17:57,944 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 14:17:57,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=552, Invalid=4995, Unknown=7, NotChecked=146, Total=5700 [2018-02-04 14:17:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 14:17:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 319. [2018-02-04 14:17:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 14:17:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 373 transitions. [2018-02-04 14:17:57,948 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 373 transitions. Word has length 52 [2018-02-04 14:17:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:17:57,948 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 373 transitions. [2018-02-04 14:17:57,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 14:17:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 373 transitions. [2018-02-04 14:17:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 14:17:57,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:17:57,949 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 14:17:57,949 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 14:17:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1440013923, now seen corresponding path program 1 times [2018-02-04 14:17:57,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:17:57,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:17:57,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:57,950 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:57,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:17:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:57,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:17:58,719 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 14:17:58,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:17:58,719 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 14:17:58,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:17:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:17:58,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:17:58,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 14:17:58,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 14:17:58,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:58,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:58,782 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 14:17:58,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-02-04 14:17:58,883 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 14:17:58,884 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 14:17:58,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,901 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 14:17:58,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 14:17:58,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:58,915 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 14:17:58,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:54 [2018-02-04 14:17:59,092 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 14:17:59,093 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 14:17:59,094 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 14:17:59,096 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 14:17:59,104 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 14:17:59,105 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 14:17:59,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,111 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 14:17:59,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:12 [2018-02-04 14:17:59,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:59,304 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 14:17:59,306 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 14:17:59,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:17:59,328 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 14:17:59,330 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 14:17:59,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,348 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 14:17:59,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:108, output treesize:62 [2018-02-04 14:17:59,644 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 39 treesize of output 33 [2018-02-04 14:17:59,645 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:59,646 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 33 treesize of output 25 [2018-02-04 14:17:59,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,659 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 41 treesize of output 33 [2018-02-04 14:17:59,661 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:17:59,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-02-04 14:17:59,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:17:59,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:14 [2018-02-04 14:17:59,708 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 14:17:59,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:17:59,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-02-04 14:17:59,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 14:17:59,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 14:17:59,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1514, Unknown=7, NotChecked=0, Total=1640 [2018-02-04 14:17:59,726 INFO L87 Difference]: Start difference. First operand 319 states and 373 transitions. Second operand 41 states. [2018-02-04 14:18:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:04,100 INFO L93 Difference]: Finished difference Result 458 states and 521 transitions. [2018-02-04 14:18:04,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 14:18:04,100 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 52 [2018-02-04 14:18:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:04,101 INFO L225 Difference]: With dead ends: 458 [2018-02-04 14:18:04,101 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 14:18:04,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=515, Invalid=5168, Unknown=17, NotChecked=0, Total=5700 [2018-02-04 14:18:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 14:18:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 329. [2018-02-04 14:18:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 14:18:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 382 transitions. [2018-02-04 14:18:04,106 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 382 transitions. Word has length 52 [2018-02-04 14:18:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:04,106 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 382 transitions. [2018-02-04 14:18:04,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 14:18:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 382 transitions. [2018-02-04 14:18:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 14:18:04,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:04,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:04,107 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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 14:18:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1813720883, now seen corresponding path program 1 times [2018-02-04 14:18:04,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:04,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:04,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:04,107 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:04,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:04,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:04,168 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 14:18:04,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:18:04,168 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:18:04,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:04,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:18:04,210 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 14:18:04,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:04,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:04,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:18:04,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:04,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:04,221 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 14:18:04,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:04,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:04,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 14:18:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 14:18:04,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:18:04,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2018-02-04 14:18:04,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:18:04,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:18:04,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:18:04,278 INFO L87 Difference]: Start difference. First operand 329 states and 382 transitions. Second operand 13 states. [2018-02-04 14:18:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:04,629 INFO L93 Difference]: Finished difference Result 342 states and 396 transitions. [2018-02-04 14:18:04,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 14:18:04,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-02-04 14:18:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:04,631 INFO L225 Difference]: With dead ends: 342 [2018-02-04 14:18:04,631 INFO L226 Difference]: Without dead ends: 342 [2018-02-04 14:18:04,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-02-04 14:18:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-04 14:18:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 329. [2018-02-04 14:18:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 14:18:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 380 transitions. [2018-02-04 14:18:04,634 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 380 transitions. Word has length 54 [2018-02-04 14:18:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:04,635 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 380 transitions. [2018-02-04 14:18:04,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:18:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 380 transitions. [2018-02-04 14:18:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 14:18:04,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:04,635 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:04,635 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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 14:18:04,635 INFO L82 PathProgramCache]: Analyzing trace with hash -824497909, now seen corresponding path program 1 times [2018-02-04 14:18:04,635 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:04,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:04,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:04,636 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:04,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:04,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 14:18:04,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:18:04,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:18:04,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:18:04,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:18:04,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:18:04,679 INFO L87 Difference]: Start difference. First operand 329 states and 380 transitions. Second operand 4 states. [2018-02-04 14:18:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:18:04,793 INFO L93 Difference]: Finished difference Result 334 states and 385 transitions. [2018-02-04 14:18:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:18:04,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-02-04 14:18:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:18:04,794 INFO L225 Difference]: With dead ends: 334 [2018-02-04 14:18:04,794 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 14:18:04,795 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 14:18:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 14:18:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 254. [2018-02-04 14:18:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 14:18:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 284 transitions. [2018-02-04 14:18:04,799 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 284 transitions. Word has length 55 [2018-02-04 14:18:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:18:04,799 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 284 transitions. [2018-02-04 14:18:04,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:18:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 284 transitions. [2018-02-04 14:18:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 14:18:04,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:18:04,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:18:04,800 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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 14:18:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1266934701, now seen corresponding path program 1 times [2018-02-04 14:18:04,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:18:04,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:18:04,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:04,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:04,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:18:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:04,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:18:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 14:18:05,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:18:05,035 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:18:05,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:18:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:18:05,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:18:05,092 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 14:18:05,093 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 14:18:05,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 14:18:05,126 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 14:18:05,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,129 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 14:18:05,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 14:18:05,177 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 14:18:05,179 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 14:18:05,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,200 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:18:05,205 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 46 [2018-02-04 14:18:05,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:47, output treesize:88 [2018-02-04 14:18:05,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,334 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 48 treesize of output 42 [2018-02-04 14:18:05,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,361 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 45 treesize of output 39 [2018-02-04 14:18:05,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:82 [2018-02-04 14:18:05,490 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 65 [2018-02-04 14:18:05,492 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 54 treesize of output 53 [2018-02-04 14:18:05,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,529 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 2 case distinctions, treesize of input 51 treesize of output 62 [2018-02-04 14:18:05,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,606 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 50 treesize of output 51 [2018-02-04 14:18:05,608 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 14:18:05,608 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 14:18:05,652 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:104, output treesize:144 [2018-02-04 14:18:05,730 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 72 [2018-02-04 14:18:05,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,734 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 61 treesize of output 68 [2018-02-04 14:18:05,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,801 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 58 treesize of output 89 [2018-02-04 14:18:05,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:18:05,927 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 58 treesize of output 53 [2018-02-04 14:18:05,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:05,930 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 18 treesize of output 27 [2018-02-04 14:18:05,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:05,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:06,006 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 59 treesize of output 54 [2018-02-04 14:18:06,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:06,009 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 14:18:06,010 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:06,021 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:06,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 14:18:06,075 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:180, output treesize:224 [2018-02-04 14:18:06,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:06,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 102 [2018-02-04 14:18:06,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-02-04 14:18:06,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:06,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:06,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 95 [2018-02-04 14:18:06,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-02-04 14:18:06,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:06,540 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:18:06,551 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 5 case distinctions, treesize of input 71 treesize of output 95 [2018-02-04 14:18:06,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-02-04 14:18:06,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 14:18:06,939 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:18:06,940 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 66 treesize of output 59 [2018-02-04 14:18:06,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:06,944 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 25 treesize of output 34 [2018-02-04 14:18:06,944 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:06,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:07,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:07,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-02-04 14:18:07,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:07,162 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 29 treesize of output 31 [2018-02-04 14:18:07,162 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:07,178 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:07,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:07,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 72 [2018-02-04 14:18:07,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:07,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-02-04 14:18:07,331 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:07,342 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:07,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2018-02-04 14:18:07,440 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:275, output treesize:450 [2018-02-04 14:18:07,691 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 115 DAG size of output 76 [2018-02-04 14:18:08,031 WARN L143 SmtUtils]: Spent 125ms on a formula simplification that was a NOOP. DAG size: 114 [2018-02-04 14:18:08,494 WARN L143 SmtUtils]: Spent 365ms on a formula simplification that was a NOOP. DAG size: 206 [2018-02-04 14:18:11,374 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 643 DAG size of output 46 [2018-02-04 14:18:11,530 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 94 treesize of output 69 [2018-02-04 14:18:11,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:11,533 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 62 treesize of output 54 [2018-02-04 14:18:11,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:11,562 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 2 case distinctions, treesize of input 54 treesize of output 66 [2018-02-04 14:18:11,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 14:18:11,597 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-02-04 14:18:11,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:11,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2018-02-04 14:18:11,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:11,669 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 76 treesize of output 54 [2018-02-04 14:18:11,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:11,672 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 42 treesize of output 40 [2018-02-04 14:18:11,672 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:18:11,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2018-02-04 14:18:11,689 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,694 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:18:11,703 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:171, output treesize:5 [2018-02-04 14:18:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 14:18:11,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:18:11,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-02-04 14:18:11,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 14:18:11,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 14:18:11,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 14:18:11,759 INFO L87 Difference]: Start difference. First operand 254 states and 284 transitions. Second operand 37 states. [2018-02-04 14:18:13,108 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 66 DAG size of output 63 [2018-02-04 14:18:13,336 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 89 DAG size of output 71 [2018-02-04 14:18:13,837 WARN L146 SmtUtils]: Spent 320ms on a formula simplification. DAG size of input: 126 DAG size of output 109 [2018-02-04 14:18:14,094 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 161 DAG size of output 135 [2018-02-04 14:18:14,572 WARN L146 SmtUtils]: Spent 344ms on a formula simplification. DAG size of input: 167 DAG size of output 138 [2018-02-04 14:18:14,926 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 150 DAG size of output 141 [2018-02-04 14:18:15,199 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 117 DAG size of output 97 [2018-02-04 14:18:15,833 WARN L146 SmtUtils]: Spent 538ms on a formula simplification. DAG size of input: 220 DAG size of output 120 [2018-02-04 14:18:16,693 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 68 DAG size of output 64 Received shutdown request... [2018-02-04 14:18:17,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 14:18:17,967 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 14:18:17,971 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 14:18:17,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:18:17 BoogieIcfgContainer [2018-02-04 14:18:17,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:18:17,972 INFO L168 Benchmark]: Toolchain (without parser) took 202326.02 ms. Allocated memory was 406.8 MB in the beginning and 649.1 MB in the end (delta: 242.2 MB). Free memory was 363.7 MB in the beginning and 490.3 MB in the end (delta: -126.6 MB). Peak memory consumption was 115.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:17,973 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:18:17,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.81 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 353.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:17,974 INFO L168 Benchmark]: Boogie Preprocessor took 32.26 ms. Allocated memory is still 406.8 MB. Free memory was 353.2 MB in the beginning and 350.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:17,974 INFO L168 Benchmark]: RCFGBuilder took 333.14 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 317.5 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:17,974 INFO L168 Benchmark]: TraceAbstraction took 201799.15 ms. Allocated memory was 406.8 MB in the beginning and 649.1 MB in the end (delta: 242.2 MB). Free memory was 317.5 MB in the beginning and 490.3 MB in the end (delta: -172.8 MB). Peak memory consumption was 69.4 MB. Max. memory is 5.3 GB. [2018-02-04 14:18:17,975 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.81 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 353.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.26 ms. Allocated memory is still 406.8 MB. Free memory was 353.2 MB in the beginning and 350.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 333.14 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 317.5 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 201799.15 ms. Allocated memory was 406.8 MB in the beginning and 649.1 MB in the end (delta: 242.2 MB). Free memory was 317.5 MB in the beginning and 490.3 MB in the end (delta: -172.8 MB). Peak memory consumption was 69.4 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 constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 587]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 587). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (254states) and interpolant automaton (currently 27 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 122 locations, 43 error locations. TIMEOUT Result, 201.7s OverallTime, 36 OverallIterations, 3 TraceHistogramMax, 143.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4312 SDtfs, 6527 SDslu, 25853 SDs, 0 SdLazy, 26920 SolverSat, 4640 SolverUnsat, 136 SolverUnknown, 0 SolverNotchecked, 84.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1424 GetRequests, 530 SyntacticMatches, 63 SemanticMatches, 830 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9280 ImplicationChecksByTransitivity, 99.7s 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, 35 MinimizatonAttempts, 1453 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 56.5s InterpolantComputationTime, 1834 NumberOfCodeBlocks, 1834 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1781 ConstructedInterpolants, 200 QuantifiedInterpolants, 1882159 SizeOfPredicates, 238 NumberOfNonLiveVariables, 3161 ConjunctsInSsa, 600 ConjunctsInUnsatCore, 53 InterpolantComputations, 19 PerfectInterpolantSequences, 101/228 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_14-18-17-983.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_14-18-17-983.csv Completed graceful shutdown