java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:45:54,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:45:54,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:45:54,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:45:54,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:45:54,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:45:54,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:45:54,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:45:54,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:45:54,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:45:54,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:45:54,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:45:54,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:45:54,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:45:54,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:45:54,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:45:54,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:45:54,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:45:54,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:45:54,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:45:54,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:45:54,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:45:54,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:45:54,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:45:54,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:45:54,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:45:54,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:45:54,495 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:45:54,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:45:54,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:45:54,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:45:54,496 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:45:54,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:45:54,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:45:54,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:45:54,508 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:45:54,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:45:54,508 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:45:54,508 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:45:54,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:45:54,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:45:54,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:45:54,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:45:54,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:45:54,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:45:54,510 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:45:54,510 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:45:54,511 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:45:54,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:45:54,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:45:54,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:45:54,511 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:45:54,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:45:54,512 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:45:54,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:45:54,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:45:54,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:45:54,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:45:54,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:45:54,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:45:54,513 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:45:54,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:45:54,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:45:54,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:45:54,515 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:45:54,515 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:45:54,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:45:54,564 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:45:54,568 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:45:54,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:45:54,570 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:45:54,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-01-29 23:45:54,725 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:45:54,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:45:54,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:45:54,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:45:54,739 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:45:54,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5971d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54, skipping insertion in model container [2018-01-29 23:45:54,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,762 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:45:54,802 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:45:54,919 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:45:54,937 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:45:54,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54 WrapperNode [2018-01-29 23:45:54,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:45:54,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:45:54,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:45:54,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:45:54,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... [2018-01-29 23:45:54,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:45:54,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:45:54,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:45:54,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:45:54,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:45:55,033 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:45:55,033 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:45:55,034 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-29 23:45:55,034 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:45:55,034 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:45:55,035 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-29 23:45:55,035 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:45:55,035 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:45:55,035 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-29 23:45:55,035 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:45:55,035 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:45:55,035 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:45:55,316 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:45:55,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:45:55 BoogieIcfgContainer [2018-01-29 23:45:55,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:45:55,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:45:55,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:45:55,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:45:55,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:45:54" (1/3) ... [2018-01-29 23:45:55,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be82292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:45:55, skipping insertion in model container [2018-01-29 23:45:55,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:45:54" (2/3) ... [2018-01-29 23:45:55,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be82292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:45:55, skipping insertion in model container [2018-01-29 23:45:55,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:45:55" (3/3) ... [2018-01-29 23:45:55,323 INFO L107 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i [2018-01-29 23:45:55,329 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:45:55,336 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-29 23:45:55,386 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:45:55,387 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:45:55,387 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:45:55,387 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:45:55,387 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:45:55,387 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:45:55,387 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:45:55,387 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:45:55,388 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:45:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-29 23:45:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-29 23:45:55,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:55,408 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:55,408 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:55,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1613334752, now seen corresponding path program 1 times [2018-01-29 23:45:55,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:55,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:55,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:55,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:55,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:55,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:55,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:55,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:45:55,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:45:55,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:45:55,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:45:55,562 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-01-29 23:45:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:55,681 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-29 23:45:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:45:55,683 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-29 23:45:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:55,693 INFO L225 Difference]: With dead ends: 129 [2018-01-29 23:45:55,693 INFO L226 Difference]: Without dead ends: 77 [2018-01-29 23:45:55,698 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:45:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-29 23:45:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-29 23:45:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-29 23:45:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-29 23:45:55,736 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 14 [2018-01-29 23:45:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:55,737 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-29 23:45:55,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:45:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-29 23:45:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:45:55,737 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:55,738 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:55,738 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1170474532, now seen corresponding path program 1 times [2018-01-29 23:45:55,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:55,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:55,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:55,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:55,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:55,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:55,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:55,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:45:55,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:45:55,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:45:55,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:45:55,799 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 3 states. [2018-01-29 23:45:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:55,836 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-01-29 23:45:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:45:55,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-29 23:45:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:55,838 INFO L225 Difference]: With dead ends: 143 [2018-01-29 23:45:55,838 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 23:45:55,839 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:45:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 23:45:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-29 23:45:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 23:45:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-29 23:45:55,847 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 19 [2018-01-29 23:45:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:55,847 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-29 23:45:55,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:45:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-29 23:45:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:45:55,848 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:55,848 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:55,848 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1170597638, now seen corresponding path program 1 times [2018-01-29 23:45:55,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:55,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:55,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:55,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:55,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:55,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:55,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-01-29 23:45:55,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:55,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:45:55,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:45:55,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:45:55,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:45:55,921 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2018-01-29 23:45:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:56,011 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-01-29 23:45:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:45:56,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 23:45:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:56,013 INFO L225 Difference]: With dead ends: 182 [2018-01-29 23:45:56,013 INFO L226 Difference]: Without dead ends: 141 [2018-01-29 23:45:56,014 INFO L553 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-01-29 23:45:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-29 23:45:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 81. [2018-01-29 23:45:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-29 23:45:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-01-29 23:45:56,020 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 19 [2018-01-29 23:45:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:56,020 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-01-29 23:45:56,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:45:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-01-29 23:45:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:45:56,021 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:56,021 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:56,021 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:56,021 INFO L82 PathProgramCache]: Analyzing trace with hash 875218105, now seen corresponding path program 1 times [2018-01-29 23:45:56,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:56,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:56,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:56,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:56,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:56,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:56,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:45:56,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:45:56,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:45:56,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:45:56,088 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 5 states. [2018-01-29 23:45:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:56,248 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-01-29 23:45:56,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:45:56,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-29 23:45:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:56,250 INFO L225 Difference]: With dead ends: 112 [2018-01-29 23:45:56,250 INFO L226 Difference]: Without dead ends: 103 [2018-01-29 23:45:56,250 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:45:56,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-29 23:45:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2018-01-29 23:45:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-29 23:45:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-01-29 23:45:56,261 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 21 [2018-01-29 23:45:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:56,261 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-01-29 23:45:56,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:45:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-01-29 23:45:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:45:56,262 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:56,262 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:56,263 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash 875218106, now seen corresponding path program 1 times [2018-01-29 23:45:56,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:56,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:56,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:56,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:56,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:56,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:56,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:45:56,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:45:56,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:45:56,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:45:56,403 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 5 states. [2018-01-29 23:45:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:56,559 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-29 23:45:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:45:56,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-29 23:45:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:56,561 INFO L225 Difference]: With dead ends: 120 [2018-01-29 23:45:56,561 INFO L226 Difference]: Without dead ends: 111 [2018-01-29 23:45:56,562 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:45:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-29 23:45:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-01-29 23:45:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-29 23:45:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-01-29 23:45:56,573 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 21 [2018-01-29 23:45:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:56,573 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-01-29 23:45:56,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:45:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-01-29 23:45:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 23:45:56,575 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:56,575 INFO L350 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] [2018-01-29 23:45:56,575 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1144689438, now seen corresponding path program 1 times [2018-01-29 23:45:56,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:56,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:56,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:56,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:56,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:56,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:56,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:45:56,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:45:56,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:45:56,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:45:56,662 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 5 states. [2018-01-29 23:45:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:56,795 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-01-29 23:45:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:45:56,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-29 23:45:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:56,797 INFO L225 Difference]: With dead ends: 127 [2018-01-29 23:45:56,797 INFO L226 Difference]: Without dead ends: 107 [2018-01-29 23:45:56,797 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:45:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-29 23:45:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-01-29 23:45:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-29 23:45:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-01-29 23:45:56,808 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 31 [2018-01-29 23:45:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:56,809 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-01-29 23:45:56,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:45:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-01-29 23:45:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 23:45:56,810 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:56,810 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:45:56,811 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash -769148489, now seen corresponding path program 1 times [2018-01-29 23:45:56,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:56,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:56,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:56,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:56,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:56,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:56,891 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:56,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:56,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:57,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:57,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-29 23:45:57,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:45:57,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:45:57,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:45:57,014 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 8 states. [2018-01-29 23:45:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:57,169 INFO L93 Difference]: Finished difference Result 195 states and 202 transitions. [2018-01-29 23:45:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:45:57,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-29 23:45:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:57,171 INFO L225 Difference]: With dead ends: 195 [2018-01-29 23:45:57,171 INFO L226 Difference]: Without dead ends: 145 [2018-01-29 23:45:57,172 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:45:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-29 23:45:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 111. [2018-01-29 23:45:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-29 23:45:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-29 23:45:57,182 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 38 [2018-01-29 23:45:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:57,182 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-29 23:45:57,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:45:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-29 23:45:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 23:45:57,184 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:57,184 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:45:57,185 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:57,185 INFO L82 PathProgramCache]: Analyzing trace with hash -297607162, now seen corresponding path program 1 times [2018-01-29 23:45:57,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:57,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:57,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:57,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:57,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:57,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:57,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:57,468 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:57,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:57,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:57,574 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-01-29 23:45:57,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:45:57,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,592 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-01-29 23:45:57,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:45:57,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-29 23:45:57,671 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 19 treesize of output 15 [2018-01-29 23:45:57,674 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:57,674 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 15 treesize of output 11 [2018-01-29 23:45:57,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,684 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 19 treesize of output 15 [2018-01-29 23:45:57,686 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:57,687 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 15 treesize of output 11 [2018-01-29 23:45:57,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:57,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:7 [2018-01-29 23:45:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:57,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:57,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2018-01-29 23:45:57,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:45:57,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:45:57,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:45:57,748 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 15 states. [2018-01-29 23:45:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:58,048 INFO L93 Difference]: Finished difference Result 183 states and 189 transitions. [2018-01-29 23:45:58,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:45:58,074 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-01-29 23:45:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:58,074 INFO L225 Difference]: With dead ends: 183 [2018-01-29 23:45:58,075 INFO L226 Difference]: Without dead ends: 149 [2018-01-29 23:45:58,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:45:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-29 23:45:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 126. [2018-01-29 23:45:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-29 23:45:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-01-29 23:45:58,086 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 38 [2018-01-29 23:45:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:58,086 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-01-29 23:45:58,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:45:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-01-29 23:45:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 23:45:58,087 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:58,088 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:45:58,088 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash 120793654, now seen corresponding path program 1 times [2018-01-29 23:45:58,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:58,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:58,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:58,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:58,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:58,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:58,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:58,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:45:58,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:45:58,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:45:58,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:45:58,191 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 7 states. [2018-01-29 23:45:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:58,403 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-01-29 23:45:58,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:45:58,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-29 23:45:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:58,404 INFO L225 Difference]: With dead ends: 133 [2018-01-29 23:45:58,404 INFO L226 Difference]: Without dead ends: 131 [2018-01-29 23:45:58,404 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:45:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-29 23:45:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2018-01-29 23:45:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-29 23:45:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-01-29 23:45:58,412 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 40 [2018-01-29 23:45:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:58,412 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-01-29 23:45:58,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:45:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-01-29 23:45:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 23:45:58,414 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:58,414 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:45:58,414 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash 120793655, now seen corresponding path program 1 times [2018-01-29 23:45:58,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:58,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:58,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:58,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:58,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:58,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:58,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:45:58,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:45:58,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:45:58,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:45:58,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:45:58,649 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 7 states. [2018-01-29 23:45:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:58,953 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-01-29 23:45:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:45:58,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-29 23:45:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:58,955 INFO L225 Difference]: With dead ends: 144 [2018-01-29 23:45:58,955 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 23:45:58,955 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:45:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 23:45:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2018-01-29 23:45:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-29 23:45:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-01-29 23:45:58,962 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 40 [2018-01-29 23:45:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:58,962 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-01-29 23:45:58,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:45:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-01-29 23:45:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-29 23:45:58,963 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:58,963 INFO L350 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] [2018-01-29 23:45:58,963 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:58,964 INFO L82 PathProgramCache]: Analyzing trace with hash 993527772, now seen corresponding path program 1 times [2018-01-29 23:45:58,964 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:58,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:58,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:58,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:58,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:58,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:45:59,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:59,387 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:59,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:59,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:59,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:45:59,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:45:59,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:59,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:59,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:45:59,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:45:59,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:59,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:59,471 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 1 xjuncts. [2018-01-29 23:45:59,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:22 [2018-01-29 23:45:59,712 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 19 treesize of output 15 [2018-01-29 23:45:59,725 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 15 treesize of output 12 [2018-01-29 23:45:59,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:59,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:59,738 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 19 treesize of output 15 [2018-01-29 23:45:59,750 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 15 treesize of output 12 [2018-01-29 23:45:59,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:59,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:59,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:45:59,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:16 [2018-01-29 23:45:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:59,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:59,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 23 [2018-01-29 23:45:59,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:45:59,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:45:59,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:45:59,883 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 23 states. [2018-01-29 23:46:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:00,660 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-01-29 23:46:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:46:00,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-01-29 23:46:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:00,661 INFO L225 Difference]: With dead ends: 147 [2018-01-29 23:46:00,661 INFO L226 Difference]: Without dead ends: 134 [2018-01-29 23:46:00,661 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:46:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-29 23:46:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2018-01-29 23:46:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-29 23:46:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-01-29 23:46:00,669 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 48 [2018-01-29 23:46:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:00,670 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-01-29 23:46:00,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:46:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-01-29 23:46:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:46:00,671 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:00,671 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:46:00,671 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash 734588407, now seen corresponding path program 1 times [2018-01-29 23:46:00,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:00,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:00,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:00,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:00,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:00,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:46:00,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:00,800 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:00,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:00,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:00,881 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~7.base Int)) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~p~7.base 0)) (not (= 0 main_~p~7.base)))) is different from true [2018-01-29 23:46:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-29 23:46:00,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:00,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-29 23:46:00,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:46:00,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:46:00,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2018-01-29 23:46:00,913 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 11 states. [2018-01-29 23:46:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:01,132 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-01-29 23:46:01,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:46:01,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-01-29 23:46:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:01,133 INFO L225 Difference]: With dead ends: 132 [2018-01-29 23:46:01,133 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 23:46:01,134 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2018-01-29 23:46:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 23:46:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-29 23:46:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-29 23:46:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2018-01-29 23:46:01,140 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 49 [2018-01-29 23:46:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:01,140 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2018-01-29 23:46:01,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:46:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-01-29 23:46:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 23:46:01,141 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:01,141 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:01,141 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash 363627561, now seen corresponding path program 1 times [2018-01-29 23:46:01,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:01,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:01,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:01,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:01,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:01,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:01,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:01,419 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:01,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:01,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:01,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:01,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:01,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:01,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:01,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:46:01,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-29 23:46:01,557 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-01-29 23:46:01,559 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-01-29 23:46:01,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-01-29 23:46:01,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:01,632 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 40 treesize of output 41 [2018-01-29 23:46:01,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:01,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-01-29 23:46:01,691 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 39 treesize of output 35 [2018-01-29 23:46:01,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:01,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,756 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 1 xjuncts. [2018-01-29 23:46:01,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-29 23:46:01,863 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 40 treesize of output 33 [2018-01-29 23:46:01,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:01,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,874 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:01,875 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 15 [2018-01-29 23:46:01,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:01,904 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-01-29 23:46:01,905 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-01-29 23:46:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:02,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:02,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-01-29 23:46:02,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 23:46:02,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 23:46:02,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:46:02,017 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 28 states. [2018-01-29 23:46:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:02,934 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2018-01-29 23:46:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:46:02,934 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2018-01-29 23:46:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:02,935 INFO L225 Difference]: With dead ends: 187 [2018-01-29 23:46:02,935 INFO L226 Difference]: Without dead ends: 186 [2018-01-29 23:46:02,936 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 23:46:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-29 23:46:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 123. [2018-01-29 23:46:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-29 23:46:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-01-29 23:46:02,942 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 57 [2018-01-29 23:46:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:02,942 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-01-29 23:46:02,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 23:46:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-01-29 23:46:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 23:46:02,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:02,943 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:02,943 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash 363627562, now seen corresponding path program 1 times [2018-01-29 23:46:02,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:02,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:02,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:02,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:02,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:02,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:03,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:03,359 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:03,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:03,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:03,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:03,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:03,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:03,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:03,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:46:03,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,463 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 6 treesize of output 5 [2018-01-29 23:46:03,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 23:46:03,488 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-01-29 23:46:03,490 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-01-29 23:46:03,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,511 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-01-29 23:46:03,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:03,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-01-29 23:46:03,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:03,635 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 28 [2018-01-29 23:46:03,637 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 16 treesize of output 15 [2018-01-29 23:46:03,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:03,657 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 40 treesize of output 41 [2018-01-29 23:46:03,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:03,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2018-01-29 23:46:03,682 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 29 treesize of output 30 [2018-01-29 23:46:03,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:03,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,713 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 52 treesize of output 48 [2018-01-29 23:46:03,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:03,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,738 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 1 xjuncts. [2018-01-29 23:46:03,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-01-29 23:46:03,843 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 53 treesize of output 44 [2018-01-29 23:46:03,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:03,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,851 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:03,852 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 32 treesize of output 24 [2018-01-29 23:46:03,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,871 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 26 treesize of output 24 [2018-01-29 23:46:03,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:03,873 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,877 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:03,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:46:03,878 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:03,885 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-01-29 23:46:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:03,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:03,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-01-29 23:46:03,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:46:03,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:46:03,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:46:03,928 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 23 states. [2018-01-29 23:46:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:04,925 INFO L93 Difference]: Finished difference Result 192 states and 200 transitions. [2018-01-29 23:46:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:46:04,926 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-01-29 23:46:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:04,926 INFO L225 Difference]: With dead ends: 192 [2018-01-29 23:46:04,926 INFO L226 Difference]: Without dead ends: 190 [2018-01-29 23:46:04,927 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=310, Invalid=1412, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 23:46:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-29 23:46:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 122. [2018-01-29 23:46:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-29 23:46:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-01-29 23:46:04,936 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 57 [2018-01-29 23:46:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:04,936 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-01-29 23:46:04,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:46:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-01-29 23:46:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-29 23:46:04,937 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:04,938 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:04,938 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:04,938 INFO L82 PathProgramCache]: Analyzing trace with hash -785834945, now seen corresponding path program 1 times [2018-01-29 23:46:04,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:04,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:04,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:04,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:04,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:04,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:46:05,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:05,258 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:05,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:05,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:05,458 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 19 treesize of output 15 [2018-01-29 23:46:05,491 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 15 treesize of output 12 [2018-01-29 23:46:05,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:05,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:05,505 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 19 treesize of output 15 [2018-01-29 23:46:05,510 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 15 treesize of output 12 [2018-01-29 23:46:05,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:05,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:05,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:46:05,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:16 [2018-01-29 23:46:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:46:05,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:05,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-01-29 23:46:05,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 23:46:05,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 23:46:05,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:46:05,634 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 27 states. [2018-01-29 23:46:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:07,079 INFO L93 Difference]: Finished difference Result 237 states and 246 transitions. [2018-01-29 23:46:07,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-29 23:46:07,080 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2018-01-29 23:46:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:07,081 INFO L225 Difference]: With dead ends: 237 [2018-01-29 23:46:07,081 INFO L226 Difference]: Without dead ends: 217 [2018-01-29 23:46:07,082 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=578, Invalid=3328, Unknown=0, NotChecked=0, Total=3906 [2018-01-29 23:46:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-29 23:46:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2018-01-29 23:46:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-29 23:46:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-01-29 23:46:07,090 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 67 [2018-01-29 23:46:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:07,091 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-01-29 23:46:07,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 23:46:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-01-29 23:46:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-29 23:46:07,091 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:07,091 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:07,092 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1345999684, now seen corresponding path program 2 times [2018-01-29 23:46:07,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:07,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:07,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:07,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:07,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:07,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:07,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:07,658 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:07,665 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:46:07,678 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:07,688 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:07,691 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:07,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:07,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:07,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:07,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:07,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:07,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:46:07,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:46:07,751 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-01-29 23:46:07,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:07,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,764 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-01-29 23:46:07,766 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-01-29 23:46:07,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-01-29 23:46:07,818 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 25 treesize of output 26 [2018-01-29 23:46:07,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:07,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,837 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 25 treesize of output 32 [2018-01-29 23:46:07,839 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 18 treesize of output 17 [2018-01-29 23:46:07,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:29 [2018-01-29 23:46:07,865 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 57 treesize of output 51 [2018-01-29 23:46:07,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:07,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,880 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 33 treesize of output 34 [2018-01-29 23:46:07,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:07,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:07,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2018-01-29 23:46:08,022 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:08,025 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 0 case distinctions, treesize of input 71 treesize of output 65 [2018-01-29 23:46:08,027 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:08,028 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 44 treesize of output 30 [2018-01-29 23:46:08,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:08,036 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:08,036 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 17 treesize of output 13 [2018-01-29 23:46:08,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:08,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:08,048 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 30 treesize of output 26 [2018-01-29 23:46:08,050 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:08,050 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 17 treesize of output 11 [2018-01-29 23:46:08,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:08,054 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 3 [2018-01-29 23:46:08,055 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:08,056 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:08,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:08,059 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:7 [2018-01-29 23:46:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:08,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:08,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2018-01-29 23:46:08,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:46:08,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:46:08,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=408, Unknown=5, NotChecked=0, Total=462 [2018-01-29 23:46:08,119 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 22 states. [2018-01-29 23:46:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:08,973 INFO L93 Difference]: Finished difference Result 214 states and 221 transitions. [2018-01-29 23:46:08,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:46:08,973 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-01-29 23:46:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:08,975 INFO L225 Difference]: With dead ends: 214 [2018-01-29 23:46:08,975 INFO L226 Difference]: Without dead ends: 180 [2018-01-29 23:46:08,976 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=1468, Unknown=6, NotChecked=0, Total=1722 [2018-01-29 23:46:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-29 23:46:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 150. [2018-01-29 23:46:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:46:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2018-01-29 23:46:08,987 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 68 [2018-01-29 23:46:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:08,987 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2018-01-29 23:46:08,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:46:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-01-29 23:46:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-29 23:46:08,988 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:08,989 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:08,989 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:08,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2035502179, now seen corresponding path program 1 times [2018-01-29 23:46:08,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:08,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:08,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:08,990 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:08,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:09,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:46:09,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:09,071 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:09,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:09,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:46:09,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:09,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-29 23:46:09,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:46:09,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:46:09,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:46:09,158 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand 10 states. [2018-01-29 23:46:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:09,252 INFO L93 Difference]: Finished difference Result 251 states and 260 transitions. [2018-01-29 23:46:09,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:46:09,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2018-01-29 23:46:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:09,253 INFO L225 Difference]: With dead ends: 251 [2018-01-29 23:46:09,253 INFO L226 Difference]: Without dead ends: 187 [2018-01-29 23:46:09,254 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:46:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-29 23:46:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2018-01-29 23:46:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-29 23:46:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2018-01-29 23:46:09,265 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 74 [2018-01-29 23:46:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:09,265 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2018-01-29 23:46:09,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:46:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2018-01-29 23:46:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 23:46:09,266 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:09,266 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:09,266 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -736579802, now seen corresponding path program 3 times [2018-01-29 23:46:09,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:09,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:09,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:09,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:09,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:09,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:09,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:09,627 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:09,631 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:46:09,642 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:09,649 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:09,659 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:09,661 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:09,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:09,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 6 treesize of output 5 [2018-01-29 23:46:09,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:09,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:09,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:09,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:46:09,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-29 23:46:09,747 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-01-29 23:46:09,748 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-01-29 23:46:09,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-01-29 23:46:09,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:09,840 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 40 treesize of output 41 [2018-01-29 23:46:09,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:09,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:29 [2018-01-29 23:46:09,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:09,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:09,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:09,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-29 23:46:09,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:09,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-01-29 23:46:10,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:10,017 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 37 treesize of output 38 [2018-01-29 23:46:10,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:10,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-01-29 23:46:10,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:10,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:10,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 82 [2018-01-29 23:46:10,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:10,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,236 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 1 xjuncts. [2018-01-29 23:46:10,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:66 [2018-01-29 23:46:10,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 68 [2018-01-29 23:46:10,279 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-01-29 23:46:10,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:10,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:72 [2018-01-29 23:46:10,392 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 76 treesize of output 51 [2018-01-29 23:46:10,394 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 29 treesize of output 18 [2018-01-29 23:46:10,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:10,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,409 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 17 treesize of output 9 [2018-01-29 23:46:10,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:10,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:5 [2018-01-29 23:46:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:10,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:10,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2018-01-29 23:46:10,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 23:46:10,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 23:46:10,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:46:10,455 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand 32 states. [2018-01-29 23:46:11,893 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 58 DAG size of output 54 [2018-01-29 23:46:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:12,219 INFO L93 Difference]: Finished difference Result 268 states and 278 transitions. [2018-01-29 23:46:12,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-29 23:46:12,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 76 [2018-01-29 23:46:12,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:12,222 INFO L225 Difference]: With dead ends: 268 [2018-01-29 23:46:12,222 INFO L226 Difference]: Without dead ends: 267 [2018-01-29 23:46:12,223 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=635, Invalid=3787, Unknown=0, NotChecked=0, Total=4422 [2018-01-29 23:46:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-01-29 23:46:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 189. [2018-01-29 23:46:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-29 23:46:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 197 transitions. [2018-01-29 23:46:12,234 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 197 transitions. Word has length 76 [2018-01-29 23:46:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:12,234 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 197 transitions. [2018-01-29 23:46:12,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 23:46:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2018-01-29 23:46:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 23:46:12,235 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:12,235 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:12,235 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash -736579801, now seen corresponding path program 2 times [2018-01-29 23:46:12,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:12,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:12,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:12,236 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:12,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:12,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:12,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:12,816 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:12,821 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:46:12,831 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:12,842 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:12,845 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:12,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:12,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:12,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:12,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:12,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:12,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:46:12,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-29 23:46:12,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:46:12,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:12,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,938 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-01-29 23:46:12,940 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-01-29 23:46:12,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:12,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-29 23:46:13,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,037 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 28 [2018-01-29 23:46:13,039 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 16 treesize of output 15 [2018-01-29 23:46:13,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,055 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 40 treesize of output 41 [2018-01-29 23:46:13,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:13,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40 [2018-01-29 23:46:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-29 23:46:13,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2018-01-29 23:46:13,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,131 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 21 treesize of output 26 [2018-01-29 23:46:13,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:13,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,155 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 50 treesize of output 51 [2018-01-29 23:46:13,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:13,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:62 [2018-01-29 23:46:13,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,397 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 34 [2018-01-29 23:46:13,400 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 22 treesize of output 21 [2018-01-29 23:46:13,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:13,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 84 [2018-01-29 23:46:13,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:13,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,479 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 1 xjuncts. [2018-01-29 23:46:13,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:70 [2018-01-29 23:46:13,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 95 [2018-01-29 23:46:13,536 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-01-29 23:46:13,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,567 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 41 treesize of output 42 [2018-01-29 23:46:13,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-29 23:46:13,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:13,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:105 [2018-01-29 23:46:13,702 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 97 treesize of output 66 [2018-01-29 23:46:13,705 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 32 treesize of output 20 [2018-01-29 23:46:13,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:13,715 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 27 treesize of output 16 [2018-01-29 23:46:13,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:13,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:13,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-29 23:46:13,742 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 3 [2018-01-29 23:46:13,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:13,747 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,748 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:13,755 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:116, output treesize:9 [2018-01-29 23:46:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:13,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:13,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2018-01-29 23:46:13,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:46:13,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:46:13,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:46:13,853 INFO L87 Difference]: Start difference. First operand 189 states and 197 transitions. Second operand 34 states. [2018-01-29 23:46:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:16,889 INFO L93 Difference]: Finished difference Result 288 states and 298 transitions. [2018-01-29 23:46:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 23:46:16,889 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-01-29 23:46:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:16,891 INFO L225 Difference]: With dead ends: 288 [2018-01-29 23:46:16,891 INFO L226 Difference]: Without dead ends: 286 [2018-01-29 23:46:16,893 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=617, Invalid=4353, Unknown=0, NotChecked=0, Total=4970 [2018-01-29 23:46:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-29 23:46:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 192. [2018-01-29 23:46:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-29 23:46:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 199 transitions. [2018-01-29 23:46:16,910 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 199 transitions. Word has length 76 [2018-01-29 23:46:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:16,910 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 199 transitions. [2018-01-29 23:46:16,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:46:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 199 transitions. [2018-01-29 23:46:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-29 23:46:16,911 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:16,912 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:16,912 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1690113774, now seen corresponding path program 2 times [2018-01-29 23:46:16,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:16,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:16,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:16,913 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:16,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:16,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-29 23:46:17,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:17,407 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:17,413 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:46:17,426 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:17,448 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:17,451 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:17,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:17,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:17,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:17,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:17,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:17,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:46:17,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:46:17,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:46:17,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:17,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-01-29 23:46:17,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:17,632 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 35 treesize of output 36 [2018-01-29 23:46:17,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:17,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-01-29 23:46:17,646 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 36 treesize of output 30 [2018-01-29 23:46:17,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:46:17,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,655 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 1 xjuncts. [2018-01-29 23:46:17,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-01-29 23:46:17,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-01-29 23:46:17,854 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 25 treesize of output 10 [2018-01-29 23:46:17,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:17,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,871 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:17 [2018-01-29 23:46:17,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:17,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-29 23:46:17,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:17,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:17,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-01-29 23:46:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:17,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:17,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2018-01-29 23:46:17,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:46:17,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:46:17,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:46:17,982 INFO L87 Difference]: Start difference. First operand 192 states and 199 transitions. Second operand 35 states. [2018-01-29 23:46:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:19,583 INFO L93 Difference]: Finished difference Result 228 states and 235 transitions. [2018-01-29 23:46:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 23:46:19,583 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 78 [2018-01-29 23:46:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:19,584 INFO L225 Difference]: With dead ends: 228 [2018-01-29 23:46:19,584 INFO L226 Difference]: Without dead ends: 227 [2018-01-29 23:46:19,585 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=533, Invalid=2889, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:46:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-29 23:46:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2018-01-29 23:46:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-29 23:46:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 212 transitions. [2018-01-29 23:46:19,597 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 212 transitions. Word has length 78 [2018-01-29 23:46:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:19,597 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 212 transitions. [2018-01-29 23:46:19,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:46:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 212 transitions. [2018-01-29 23:46:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-29 23:46:19,598 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:19,598 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:19,599 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1690113773, now seen corresponding path program 1 times [2018-01-29 23:46:19,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:19,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:19,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:19,600 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:19,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:19,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-29 23:46:20,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:20,066 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:20,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:20,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:20,318 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-01-29 23:46:20,325 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 25 treesize of output 26 [2018-01-29 23:46:20,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:46:20,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:46:20,346 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 42 treesize of output 36 [2018-01-29 23:46:20,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:20,349 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 28 treesize of output 21 [2018-01-29 23:46:20,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:20,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:20,355 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 34 treesize of output 28 [2018-01-29 23:46:20,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-01-29 23:46:20,362 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:20,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:20,384 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 3 xjuncts. [2018-01-29 23:46:20,385 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:44 [2018-01-29 23:46:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:46:20,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:20,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2018-01-29 23:46:20,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 23:46:20,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 23:46:20,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2018-01-29 23:46:20,654 INFO L87 Difference]: Start difference. First operand 203 states and 212 transitions. Second operand 30 states. [2018-01-29 23:46:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:22,980 INFO L93 Difference]: Finished difference Result 248 states and 255 transitions. [2018-01-29 23:46:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:46:22,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 78 [2018-01-29 23:46:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:22,982 INFO L225 Difference]: With dead ends: 248 [2018-01-29 23:46:22,982 INFO L226 Difference]: Without dead ends: 246 [2018-01-29 23:46:22,983 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1009, Invalid=4691, Unknown=0, NotChecked=0, Total=5700 [2018-01-29 23:46:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-29 23:46:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 210. [2018-01-29 23:46:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-29 23:46:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 220 transitions. [2018-01-29 23:46:23,003 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 220 transitions. Word has length 78 [2018-01-29 23:46:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:23,004 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 220 transitions. [2018-01-29 23:46:23,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 23:46:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 220 transitions. [2018-01-29 23:46:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 23:46:23,005 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:23,005 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:23,005 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:23,005 INFO L82 PathProgramCache]: Analyzing trace with hash -853920895, now seen corresponding path program 1 times [2018-01-29 23:46:23,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:23,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:23,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:23,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:23,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:23,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 23:46:23,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:23,338 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:23,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:23,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:23,550 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 35 treesize of output 33 [2018-01-29 23:46:23,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:23,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:23,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:23,570 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 26 treesize of output 22 [2018-01-29 23:46:23,576 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-01-29 23:46:23,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:23,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:23,599 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 35 treesize of output 33 [2018-01-29 23:46:23,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:23,601 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:23,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:23,619 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 26 treesize of output 22 [2018-01-29 23:46:23,624 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-01-29 23:46:23,624 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:23,629 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:23,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-29 23:46:23,644 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:71, output treesize:17 [2018-01-29 23:46:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:46:23,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:23,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-01-29 23:46:23,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:46:23,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:46:23,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:46:23,748 INFO L87 Difference]: Start difference. First operand 210 states and 220 transitions. Second operand 29 states. [2018-01-29 23:46:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:25,591 INFO L93 Difference]: Finished difference Result 242 states and 249 transitions. [2018-01-29 23:46:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:46:25,591 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-01-29 23:46:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:25,592 INFO L225 Difference]: With dead ends: 242 [2018-01-29 23:46:25,592 INFO L226 Difference]: Without dead ends: 239 [2018-01-29 23:46:25,594 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1012, Invalid=4538, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 23:46:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-29 23:46:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 210. [2018-01-29 23:46:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-29 23:46:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 218 transitions. [2018-01-29 23:46:25,615 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 218 transitions. Word has length 79 [2018-01-29 23:46:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:25,615 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 218 transitions. [2018-01-29 23:46:25,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:46:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 218 transitions. [2018-01-29 23:46:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-29 23:46:25,616 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:25,616 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:25,616 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:25,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1805902296, now seen corresponding path program 3 times [2018-01-29 23:46:25,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:25,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:25,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:25,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:46:25,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:25,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:26,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:26,600 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:26,605 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:46:26,618 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:26,628 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:26,639 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:26,641 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:26,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:26,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2018-01-29 23:46:26,987 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:26,987 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 51 treesize of output 47 [2018-01-29 23:46:26,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,000 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 36 treesize of output 30 [2018-01-29 23:46:27,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:27,012 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:27,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2018-01-29 23:46:27,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:46:27,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-29 23:46:27,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-29 23:46:27,056 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 29 treesize of output 22 [2018-01-29 23:46:27,056 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,071 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 22 treesize of output 11 [2018-01-29 23:46:27,071 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,081 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:27,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 7 [2018-01-29 23:46:27,084 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,088 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,090 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 37 treesize of output 29 [2018-01-29 23:46:27,092 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:27,092 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 17 treesize of output 13 [2018-01-29 23:46:27,092 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-29 23:46:27,097 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,100 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-01-29 23:46:27,107 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:27,107 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 37 treesize of output 33 [2018-01-29 23:46:27,107 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,122 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 28 treesize of output 17 [2018-01-29 23:46:27,122 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,134 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:27,134 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 0 case distinctions, treesize of input 31 treesize of output 17 [2018-01-29 23:46:27,135 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,141 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:27,147 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 3 variables, input treesize:68, output treesize:7 [2018-01-29 23:46:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:46:27,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:27,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 37 [2018-01-29 23:46:27,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 23:46:27,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 23:46:27,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:46:27,232 INFO L87 Difference]: Start difference. First operand 210 states and 218 transitions. Second operand 37 states. [2018-01-29 23:46:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:30,337 INFO L93 Difference]: Finished difference Result 276 states and 284 transitions. [2018-01-29 23:46:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-29 23:46:30,337 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 85 [2018-01-29 23:46:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:30,338 INFO L225 Difference]: With dead ends: 276 [2018-01-29 23:46:30,338 INFO L226 Difference]: Without dead ends: 263 [2018-01-29 23:46:30,340 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2250 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1013, Invalid=7914, Unknown=3, NotChecked=0, Total=8930 [2018-01-29 23:46:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-29 23:46:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 229. [2018-01-29 23:46:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-29 23:46:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 243 transitions. [2018-01-29 23:46:30,355 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 243 transitions. Word has length 85 [2018-01-29 23:46:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:30,355 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 243 transitions. [2018-01-29 23:46:30,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 23:46:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 243 transitions. [2018-01-29 23:46:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-29 23:46:30,356 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:30,356 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:30,356 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash 148394875, now seen corresponding path program 2 times [2018-01-29 23:46:30,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:30,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:30,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:30,357 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:30,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:30,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-29 23:46:31,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:31,054 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:31,060 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:46:31,071 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:31,082 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:31,086 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:31,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:31,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:46:31,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:31,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-01-29 23:46:31,332 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:31,334 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 54 treesize of output 55 [2018-01-29 23:46:31,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:31,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:47 [2018-01-29 23:46:31,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:31,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2018-01-29 23:46:31,361 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 16 treesize of output 15 [2018-01-29 23:46:31,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,373 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 1 xjuncts. [2018-01-29 23:46:31,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:53 [2018-01-29 23:46:31,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:31,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-29 23:46:31,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:31,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,517 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 18 [2018-01-29 23:46:31,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:31,525 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:30 [2018-01-29 23:46:31,596 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~7.base 1))) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= 0 (select .cse0 c_main_~t~7.base)) (= |c_#valid| (store (store .cse0 c_main_~t~7.base 1) main_~p~7.base 0)) (not (= 0 main_~p~7.base))))) is different from true [2018-01-29 23:46:31,598 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_subst_9 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_9 1))) (and (= (select .cse0 c_main_~p~7.base) 0) (= (select |c_old(#valid)| v_subst_9) 0) (not (= 0 v_subst_9)) (= (store (store .cse0 c_main_~p~7.base 1) v_subst_9 0) |c_#valid|)))) is different from true [2018-01-29 23:46:31,654 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_subst_9 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_9 1))) (and (= (select .cse0 c_main_~p~7.base) 0) (= (select |c_old(#valid)| v_subst_9) 0) (not (= 0 v_subst_9)) (= (store (store .cse0 c_main_~p~7.base 1) v_subst_9 0) |c_#valid|)))) (not (= 0 c_main_~p~7.base))) (and (exists ((v_prenex_23 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_23 1))) (and (= (select .cse1 c_main_~p~7.base) 0) (not (= 0 v_prenex_23)) (= |c_#valid| (store (store .cse1 c_main_~p~7.base 1) v_prenex_23 0)) (= (select |c_old(#valid)| v_prenex_23) 0)))) (not (= c_main_~p~7.offset 0)))) is different from true [2018-01-29 23:46:31,664 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_subst_9 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_9 1))) (and (= (select .cse0 main_~p~7.base) 0) (= (select |c_old(#valid)| v_subst_9) 0) (not (= 0 v_subst_9)) (not (= 0 main_~p~7.base)) (= |c_#valid| (store (store (store .cse0 main_~p~7.base 1) v_subst_9 0) main_~p~7.base 0))))) is different from true [2018-01-29 23:46:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 10 not checked. [2018-01-29 23:46:31,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:31,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-29 23:46:31,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 23:46:31,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 23:46:31,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1020, Unknown=21, NotChecked=268, Total=1406 [2018-01-29 23:46:31,723 INFO L87 Difference]: Start difference. First operand 229 states and 243 transitions. Second operand 38 states. [2018-01-29 23:46:33,011 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| c_main_~a~7.base))) (and (not (= c_main_~p~7.base c_main_~a~7.base)) (not (= 0 c_main_~a~7.base)) (= |c_old(#valid)| (store |c_#valid| c_main_~t~7.base 0)) (= 0 c_main_~a~7.offset) (= (store (store |c_#valid| (select .cse0 4) 0) c_main_~a~7.base 0) |c_old(#valid)|) (let ((.cse1 (exists ((v_subst_9 Int)) (let ((.cse2 (store |c_old(#valid)| v_subst_9 1))) (and (= (select .cse2 c_main_~p~7.base) 0) (= (select |c_old(#valid)| v_subst_9) 0) (not (= 0 v_subst_9)) (= (store (store .cse2 c_main_~p~7.base 1) v_subst_9 0) |c_#valid|)))))) (or (and .cse1 (not (= 0 c_main_~p~7.base))) (and .cse1 (not (= c_main_~p~7.offset 0))))) (not (= c_main_~a~7.base (select .cse0 (+ 0 4)))))) is different from true [2018-01-29 23:46:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:33,242 INFO L93 Difference]: Finished difference Result 241 states and 254 transitions. [2018-01-29 23:46:33,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:46:33,242 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-01-29 23:46:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:33,243 INFO L225 Difference]: With dead ends: 241 [2018-01-29 23:46:33,243 INFO L226 Difference]: Without dead ends: 191 [2018-01-29 23:46:33,244 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=2468, Unknown=24, NotChecked=530, Total=3306 [2018-01-29 23:46:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-29 23:46:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-29 23:46:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-29 23:46:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-01-29 23:46:33,256 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 86 [2018-01-29 23:46:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:33,257 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-01-29 23:46:33,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 23:46:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-01-29 23:46:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 23:46:33,257 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:33,257 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:33,257 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1505782487, now seen corresponding path program 3 times [2018-01-29 23:46:33,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:33,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:33,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:33,258 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:33,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:33,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:46:33,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:33,678 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:46:33,685 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:46:33,698 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:33,707 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:33,719 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:33,723 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:33,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:33,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:33,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:33,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:33,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:33,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:46:33,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:46:33,827 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-01-29 23:46:33,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:33,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-01-29 23:46:33,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:33,898 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 39 treesize of output 40 [2018-01-29 23:46:33,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:33,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2018-01-29 23:46:33,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:33,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:33,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:46:33,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:33,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-01-29 23:46:33,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:33,992 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 37 treesize of output 38 [2018-01-29 23:46:33,994 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-01-29 23:46:33,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-01-29 23:46:34,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:34,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 72 [2018-01-29 23:46:34,111 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 55 treesize of output 43 [2018-01-29 23:46:34,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:34,142 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 56 treesize of output 44 [2018-01-29 23:46:34,142 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:34,168 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-01-29 23:46:34,168 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:75 [2018-01-29 23:46:34,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 69 [2018-01-29 23:46:34,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:34,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 55 [2018-01-29 23:46:34,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:34,254 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-01-29 23:46:34,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:34,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-01-29 23:46:34,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:34,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:46:34,325 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:109, output treesize:120 [2018-01-29 23:46:34,450 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 1 case distinctions, treesize of input 57 treesize of output 48 [2018-01-29 23:46:34,456 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 33 treesize of output 34 [2018-01-29 23:46:34,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:34,476 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 41 treesize of output 32 [2018-01-29 23:46:34,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,497 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 32 treesize of output 25 [2018-01-29 23:46:34,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,520 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 22 treesize of output 13 [2018-01-29 23:46:34,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,521 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 26 treesize of output 17 [2018-01-29 23:46:34,521 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,534 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 25 treesize of output 17 [2018-01-29 23:46:34,534 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-01-29 23:46:34,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:34,549 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,553 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 18 treesize of output 9 [2018-01-29 23:46:34,553 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,557 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:34,562 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:95, output treesize:4 [2018-01-29 23:46:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:46:34,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:34,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 34 [2018-01-29 23:46:34,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:46:34,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:46:34,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:46:34,654 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 34 states. [2018-01-29 23:46:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:37,253 INFO L93 Difference]: Finished difference Result 283 states and 295 transitions. [2018-01-29 23:46:37,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 23:46:37,253 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 87 [2018-01-29 23:46:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:37,254 INFO L225 Difference]: With dead ends: 283 [2018-01-29 23:46:37,254 INFO L226 Difference]: Without dead ends: 270 [2018-01-29 23:46:37,256 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=965, Invalid=6175, Unknown=0, NotChecked=0, Total=7140 [2018-01-29 23:46:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-29 23:46:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 184. [2018-01-29 23:46:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-29 23:46:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2018-01-29 23:46:37,268 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 87 [2018-01-29 23:46:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:37,269 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2018-01-29 23:46:37,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:46:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2018-01-29 23:46:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 23:46:37,269 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:37,269 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:37,269 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1249136225, now seen corresponding path program 4 times [2018-01-29 23:46:37,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:37,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:37,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:37,270 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:37,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:37,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:38,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:38,048 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:38,053 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:46:38,085 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:38,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:38,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:38,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:38,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:46:38,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-29 23:46:38,246 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-01-29 23:46:38,248 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-01-29 23:46:38,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,262 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-01-29 23:46:38,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:38,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:45 [2018-01-29 23:46:38,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,405 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 40 treesize of output 41 [2018-01-29 23:46:38,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:38,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-01-29 23:46:38,430 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 16 treesize of output 15 [2018-01-29 23:46:38,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2018-01-29 23:46:38,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,495 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 26 treesize of output 46 [2018-01-29 23:46:38,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:67 [2018-01-29 23:46:38,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,619 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 28 treesize of output 33 [2018-01-29 23:46:38,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:38,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 71 [2018-01-29 23:46:38,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 23:46:38,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:77 [2018-01-29 23:46:38,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 101 [2018-01-29 23:46:38,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:38,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,908 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 30 treesize of output 41 [2018-01-29 23:46:38,909 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 22 treesize of output 21 [2018-01-29 23:46:38,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:38,928 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 1 xjuncts. [2018-01-29 23:46:38,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:125, output treesize:85 [2018-01-29 23:46:38,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:38,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 112 [2018-01-29 23:46:38,992 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-01-29 23:46:38,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,026 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 48 treesize of output 49 [2018-01-29 23:46:39,029 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-01-29 23:46:39,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:39,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:148, output treesize:120 [2018-01-29 23:46:39,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-29 23:46:39,246 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:39,246 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 18 treesize of output 12 [2018-01-29 23:46:39,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:39,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:39,275 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:141, output treesize:105 [2018-01-29 23:46:39,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:39,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:39,475 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:39,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:39,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 92 [2018-01-29 23:46:39,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:39,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,491 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:39,492 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 33 treesize of output 21 [2018-01-29 23:46:39,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:39,499 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:39,499 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 22 treesize of output 19 [2018-01-29 23:46:39,500 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:39,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:39,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:39,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:28 [2018-01-29 23:46:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:39,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:39,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2018-01-29 23:46:39,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-29 23:46:39,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-29 23:46:39,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1714, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 23:46:39,705 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 44 states. [2018-01-29 23:46:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:43,782 INFO L93 Difference]: Finished difference Result 264 states and 281 transitions. [2018-01-29 23:46:43,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 23:46:43,782 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 87 [2018-01-29 23:46:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:43,783 INFO L225 Difference]: With dead ends: 264 [2018-01-29 23:46:43,783 INFO L226 Difference]: Without dead ends: 263 [2018-01-29 23:46:43,783 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=644, Invalid=4326, Unknown=0, NotChecked=0, Total=4970 [2018-01-29 23:46:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-29 23:46:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 192. [2018-01-29 23:46:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-29 23:46:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2018-01-29 23:46:43,798 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 87 [2018-01-29 23:46:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:43,798 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2018-01-29 23:46:43,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-29 23:46:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2018-01-29 23:46:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 23:46:43,799 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:43,799 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:46:43,799 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1249136224, now seen corresponding path program 3 times [2018-01-29 23:46:43,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:43,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:43,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:43,800 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:43,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:43,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:44,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:44,691 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:44,696 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:46:44,706 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:44,714 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:44,725 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:46:44,730 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:44,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:44,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:44,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:44,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:44,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:44,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:46:44,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,763 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 6 treesize of output 5 [2018-01-29 23:46:44,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-01-29 23:46:44,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:46:44,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:44,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,846 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-01-29 23:46:44,847 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-01-29 23:46:44,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-01-29 23:46:44,868 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 15 treesize of output 11 [2018-01-29 23:46:44,869 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 3 [2018-01-29 23:46:44,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 [2018-01-29 23:46:44,900 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 25 treesize of output 26 [2018-01-29 23:46:44,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:44,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:35 [2018-01-29 23:46:44,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:44,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:44,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:44,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 23:46:44,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-29 23:46:44,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:44,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:47 [2018-01-29 23:46:45,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-01-29 23:46:45,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:46:45,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 38 treesize of output 50 [2018-01-29 23:46:45,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 23:46:45,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:67 [2018-01-29 23:46:45,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,120 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 31 treesize of output 48 [2018-01-29 23:46:45,122 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 22 treesize of output 21 [2018-01-29 23:46:45,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 120 [2018-01-29 23:46:45,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:45,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:74 [2018-01-29 23:46:45,193 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 49 treesize of output 56 [2018-01-29 23:46:45,195 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-01-29 23:46:45,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 117 [2018-01-29 23:46:45,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-29 23:46:45,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,242 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 1 xjuncts. [2018-01-29 23:46:45,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:119 [2018-01-29 23:46:45,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,487 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:45,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 132 [2018-01-29 23:46:45,493 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,499 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 62 [2018-01-29 23:46:45,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-29 23:46:45,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:45,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,553 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,554 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,554 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 0 case distinctions, treesize of input 74 treesize of output 74 [2018-01-29 23:46:45,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,556 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,557 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 88 [2018-01-29 23:46:45,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:45,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:46:45,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-01-29 23:46:45,630 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,631 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 15 treesize of output 11 [2018-01-29 23:46:45,631 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:45,641 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,648 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-01-29 23:46:45,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:45,651 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,661 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:46:45,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 15 treesize of output 11 [2018-01-29 23:46:45,661 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,670 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:45,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:46:45,688 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:156, output treesize:37 [2018-01-29 23:46:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:45,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:45,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 33 [2018-01-29 23:46:45,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:46:45,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:46:45,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:46:45,826 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 34 states. [2018-01-29 23:46:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:47,764 INFO L93 Difference]: Finished difference Result 279 states and 297 transitions. [2018-01-29 23:46:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 23:46:47,786 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 87 [2018-01-29 23:46:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:47,787 INFO L225 Difference]: With dead ends: 279 [2018-01-29 23:46:47,787 INFO L226 Difference]: Without dead ends: 277 [2018-01-29 23:46:47,787 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=440, Invalid=3342, Unknown=0, NotChecked=0, Total=3782 [2018-01-29 23:46:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-01-29 23:46:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 195. [2018-01-29 23:46:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-29 23:46:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 207 transitions. [2018-01-29 23:46:47,803 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 207 transitions. Word has length 87 [2018-01-29 23:46:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:47,803 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 207 transitions. [2018-01-29 23:46:47,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:46:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 207 transitions. [2018-01-29 23:46:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-29 23:46:47,803 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:47,804 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-29 23:46:47,804 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash 330095366, now seen corresponding path program 2 times [2018-01-29 23:46:47,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:47,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:47,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:47,804 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:47,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:47,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:46:47,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:47,925 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:47,934 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:46:47,946 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:47,961 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:47,964 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:47,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:46:48,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:48,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-01-29 23:46:48,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:46:48,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:46:48,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:46:48,005 INFO L87 Difference]: Start difference. First operand 195 states and 207 transitions. Second operand 12 states. [2018-01-29 23:46:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:48,137 INFO L93 Difference]: Finished difference Result 318 states and 340 transitions. [2018-01-29 23:46:48,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:46:48,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-01-29 23:46:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:48,138 INFO L225 Difference]: With dead ends: 318 [2018-01-29 23:46:48,138 INFO L226 Difference]: Without dead ends: 232 [2018-01-29 23:46:48,139 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:46:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-29 23:46:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2018-01-29 23:46:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-29 23:46:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 223 transitions. [2018-01-29 23:46:48,155 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 223 transitions. Word has length 93 [2018-01-29 23:46:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:48,155 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 223 transitions. [2018-01-29 23:46:48,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:46:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 223 transitions. [2018-01-29 23:46:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-29 23:46:48,156 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:48,156 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-29 23:46:48,156 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1044979977, now seen corresponding path program 5 times [2018-01-29 23:46:48,156 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:48,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:48,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:48,157 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:48,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:48,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:48,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:48,686 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:48,691 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:46:48,702 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:48,707 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:48,718 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:48,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:46:48,757 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:48,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:48,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:48,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:48,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:46:48,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-29 23:46:48,842 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-01-29 23:46:48,844 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-01-29 23:46:48,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-01-29 23:46:48,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:48,925 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 46 treesize of output 47 [2018-01-29 23:46:48,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:48,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:30 [2018-01-29 23:46:48,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:48,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:48,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:48,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-01-29 23:46:48,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:48,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:55 [2018-01-29 23:46:49,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,032 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 54 treesize of output 55 [2018-01-29 23:46:49,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:49,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:73 [2018-01-29 23:46:49,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2018-01-29 23:46:49,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:49,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,180 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 1 xjuncts. [2018-01-29 23:46:49,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:97 [2018-01-29 23:46:49,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 129 [2018-01-29 23:46:49,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:49,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:108, output treesize:132 [2018-01-29 23:46:49,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 121 [2018-01-29 23:46:49,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:49,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,361 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-01-29 23:46:49,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:145, output treesize:156 [2018-01-29 23:46:49,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:49,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 175 [2018-01-29 23:46:49,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:49,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:49,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:230, output treesize:156 [2018-01-29 23:46:49,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 149 [2018-01-29 23:46:49,614 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 28 treesize of output 27 [2018-01-29 23:46:49,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:49,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:238, output treesize:216 [2018-01-29 23:46:49,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 116 [2018-01-29 23:46:49,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-01-29 23:46:49,762 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:49,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 22 [2018-01-29 23:46:49,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-01-29 23:46:49,796 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:49,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:46:49,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:49,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:49,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:46:49,827 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:225, output treesize:45 [2018-01-29 23:46:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:50,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:46:50,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2018-01-29 23:46:50,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-29 23:46:50,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-29 23:46:50,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1912, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:46:50,308 INFO L87 Difference]: Start difference. First operand 211 states and 223 transitions. Second operand 46 states. [2018-01-29 23:46:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:46:57,058 INFO L93 Difference]: Finished difference Result 300 states and 317 transitions. [2018-01-29 23:46:57,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-01-29 23:46:57,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 95 [2018-01-29 23:46:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:46:57,059 INFO L225 Difference]: With dead ends: 300 [2018-01-29 23:46:57,059 INFO L226 Difference]: Without dead ends: 299 [2018-01-29 23:46:57,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2459 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1156, Invalid=7774, Unknown=0, NotChecked=0, Total=8930 [2018-01-29 23:46:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-01-29 23:46:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 211. [2018-01-29 23:46:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-29 23:46:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 222 transitions. [2018-01-29 23:46:57,086 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 222 transitions. Word has length 95 [2018-01-29 23:46:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:46:57,086 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 222 transitions. [2018-01-29 23:46:57,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-29 23:46:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 222 transitions. [2018-01-29 23:46:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-29 23:46:57,087 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:46:57,087 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-29 23:46:57,087 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:46:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1044979978, now seen corresponding path program 4 times [2018-01-29 23:46:57,087 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:46:57,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:46:57,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:57,088 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:46:57,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:46:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:46:57,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:46:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:46:57,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:46:57,857 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:46:57,862 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:46:57,905 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:46:57,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:46:57,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:46:57,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:57,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:57,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:46:58,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:46:58,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:46:58,108 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-01-29 23:46:58,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:58,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,136 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-01-29 23:46:58,138 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-01-29 23:46:58,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-01-29 23:46:58,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,247 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 28 [2018-01-29 23:46:58,248 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 16 treesize of output 15 [2018-01-29 23:46:58,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,264 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 31 treesize of output 32 [2018-01-29 23:46:58,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:46:58,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-01-29 23:46:58,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:46:58,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:40 [2018-01-29 23:46:58,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,367 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 21 treesize of output 26 [2018-01-29 23:46:58,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:58,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,398 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 42 treesize of output 43 [2018-01-29 23:46:58,400 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-01-29 23:46:58,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:69 [2018-01-29 23:46:58,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,601 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 34 [2018-01-29 23:46:58,604 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 22 treesize of output 21 [2018-01-29 23:46:58,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,644 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 3 case distinctions, treesize of input 86 treesize of output 93 [2018-01-29 23:46:58,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-01-29 23:46:58,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,691 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 55 treesize of output 51 [2018-01-29 23:46:58,692 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:58,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:58,742 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-01-29 23:46:58,742 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:121, output treesize:146 [2018-01-29 23:46:58,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-01-29 23:46:58,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-01-29 23:46:58,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:58,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-01-29 23:46:58,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:58,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 93 [2018-01-29 23:46:58,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:46:59,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:168, output treesize:151 [2018-01-29 23:46:59,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:59,165 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 83 treesize of output 88 [2018-01-29 23:46:59,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:59,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:59,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 126 [2018-01-29 23:46:59,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 127 [2018-01-29 23:46:59,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:59,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 98 [2018-01-29 23:46:59,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:46:59,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:46:59,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:59,534 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 115 treesize of output 126 [2018-01-29 23:46:59,536 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-01-29 23:46:59,536 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,561 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 84 treesize of output 85 [2018-01-29 23:46:59,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:46:59,565 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,586 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:46:59,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 84 [2018-01-29 23:46:59,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:46:59,655 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,671 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:46:59,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:46:59,730 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 9 variables, input treesize:203, output treesize:266 [2018-01-29 23:47:00,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 123 [2018-01-29 23:47:00,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:00,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,190 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 125 treesize of output 136 [2018-01-29 23:47:00,192 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 22 treesize of output 21 [2018-01-29 23:47:00,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 110 [2018-01-29 23:47:00,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:00,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,384 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 193 treesize of output 210 [2018-01-29 23:47:00,386 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 28 treesize of output 27 [2018-01-29 23:47:00,386 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,405 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 155 [2018-01-29 23:47:00,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:00,481 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,499 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:00,551 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 98 treesize of output 109 [2018-01-29 23:47:00,553 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 22 treesize of output 21 [2018-01-29 23:47:00,553 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,566 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:47:00,610 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:442, output treesize:326 [2018-01-29 23:47:00,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 121 [2018-01-29 23:47:00,684 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-01-29 23:47:00,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 156 [2018-01-29 23:47:00,820 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 26 treesize of output 25 [2018-01-29 23:47:00,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 119 [2018-01-29 23:47:00,940 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-01-29 23:47:00,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:00,955 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,033 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 134 treesize of output 121 [2018-01-29 23:47:01,035 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-01-29 23:47:01,035 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,115 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 132 treesize of output 119 [2018-01-29 23:47:01,117 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-01-29 23:47:01,117 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,131 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 195 [2018-01-29 23:47:01,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 26 treesize of output 25 [2018-01-29 23:47:01,193 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,210 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-01-29 23:47:01,262 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:529, output treesize:433 [2018-01-29 23:47:01,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 137 [2018-01-29 23:47:01,757 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:01,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:47:01,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:01,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 144 [2018-01-29 23:47:01,865 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 127 treesize of output 120 [2018-01-29 23:47:01,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:01,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 97 [2018-01-29 23:47:01,913 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:01,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2018-01-29 23:47:01,960 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,002 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:02,002 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 89 treesize of output 81 [2018-01-29 23:47:02,002 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,041 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 75 treesize of output 68 [2018-01-29 23:47:02,042 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,077 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 90 treesize of output 74 [2018-01-29 23:47:02,078 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:02,116 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:02,116 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 74 treesize of output 66 [2018-01-29 23:47:02,116 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:47:02,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 125 [2018-01-29 23:47:02,237 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:02,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:47:02,238 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:02,256 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,271 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,347 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 83 [2018-01-29 23:47:02,349 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:02,350 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 33 treesize of output 25 [2018-01-29 23:47:02,350 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,363 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 26 treesize of output 14 [2018-01-29 23:47:02,364 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:02,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:02,377 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,386 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:02,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-29 23:47:02,454 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:02,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:47:02,455 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:02,466 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,474 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-01-29 23:47:02,479 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:02,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:47:02,480 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:02,494 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,504 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,557 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 80 [2018-01-29 23:47:02,559 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:02,559 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 33 treesize of output 25 [2018-01-29 23:47:02,559 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:02,571 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:02,582 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 26 treesize of output 14 [2018-01-29 23:47:02,582 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:02,590 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:02,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-29 23:47:02,635 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 19 variables, input treesize:496, output treesize:73 [2018-01-29 23:47:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:02,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:47:02,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 48 [2018-01-29 23:47:02,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-29 23:47:02,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-29 23:47:02,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:47:02,847 INFO L87 Difference]: Start difference. First operand 211 states and 222 transitions. Second operand 49 states. [2018-01-29 23:47:03,811 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 96 DAG size of output 77 [2018-01-29 23:47:04,025 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 111 DAG size of output 84 [2018-01-29 23:47:04,423 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 166 DAG size of output 97 [2018-01-29 23:47:04,618 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 146 DAG size of output 80 [2018-01-29 23:47:05,035 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 144 DAG size of output 91 [2018-01-29 23:47:05,297 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 175 DAG size of output 133 [2018-01-29 23:47:05,535 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 157 DAG size of output 100 [2018-01-29 23:47:05,880 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 186 DAG size of output 113 [2018-01-29 23:47:06,209 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 174 DAG size of output 113 [2018-01-29 23:47:06,590 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 190 DAG size of output 145 [2018-01-29 23:47:06,852 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 129 DAG size of output 110 [2018-01-29 23:47:07,085 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 195 DAG size of output 115 [2018-01-29 23:47:07,567 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 205 DAG size of output 120 [2018-01-29 23:47:07,771 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 133 DAG size of output 118 [2018-01-29 23:47:07,946 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 123 DAG size of output 113 [2018-01-29 23:47:08,245 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 161 DAG size of output 144 [2018-01-29 23:47:09,340 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 191 DAG size of output 178 [2018-01-29 23:47:09,914 WARN L146 SmtUtils]: Spent 495ms on a formula simplification. DAG size of input: 102 DAG size of output 100 [2018-01-29 23:47:10,214 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 114 DAG size of output 112 [2018-01-29 23:47:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:47:10,958 INFO L93 Difference]: Finished difference Result 310 states and 327 transitions. [2018-01-29 23:47:10,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-29 23:47:10,958 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2018-01-29 23:47:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:47:10,959 INFO L225 Difference]: With dead ends: 310 [2018-01-29 23:47:10,959 INFO L226 Difference]: Without dead ends: 308 [2018-01-29 23:47:10,960 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2339 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1109, Invalid=8011, Unknown=0, NotChecked=0, Total=9120 [2018-01-29 23:47:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-01-29 23:47:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 211. [2018-01-29 23:47:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-29 23:47:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 220 transitions. [2018-01-29 23:47:10,994 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 220 transitions. Word has length 95 [2018-01-29 23:47:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:47:10,994 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 220 transitions. [2018-01-29 23:47:10,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-29 23:47:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2018-01-29 23:47:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-29 23:47:10,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:47:10,995 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-29 23:47:10,996 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:47:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash 991850037, now seen corresponding path program 4 times [2018-01-29 23:47:10,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:47:10,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:47:10,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:10,997 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:47:10,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:11,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:47:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-29 23:47:11,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:47:11,643 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:47:11,647 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:47:11,674 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:47:11,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:47:11,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:47:11,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:47:11,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 23:47:11,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:11,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:11,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:47:11,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 23:47:11,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:11,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-01-29 23:47:11,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:11,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:11,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:47:11,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-01-29 23:47:11,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:11,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-01-29 23:47:11,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:47:11,902 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-01-29 23:47:11,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-29 23:47:11,937 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-01-29 23:47:11,938 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 25 treesize of output 10 [2018-01-29 23:47:11,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:11,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2018-01-29 23:47:12,329 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 1 case distinctions, treesize of input 24 treesize of output 30 [2018-01-29 23:47:12,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-01-29 23:47:12,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:47:12,348 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 26 treesize of output 19 [2018-01-29 23:47:12,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:12,393 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 19 treesize of output 14 [2018-01-29 23:47:12,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:12,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:47:12,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-29 23:47:12,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:125 [2018-01-29 23:47:12,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2018-01-29 23:47:12,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:47:12,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:12,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:12,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:12,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-01-29 23:47:12,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:12,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:12,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:18 [2018-01-29 23:47:12,717 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-01-29 23:47:12,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:12,720 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 21 treesize of output 16 [2018-01-29 23:47:12,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:12,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:12,726 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 31 treesize of output 25 [2018-01-29 23:47:12,732 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 21 treesize of output 20 [2018-01-29 23:47:12,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:47:12,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:47:12,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-29 23:47:12,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:63, output treesize:49 [2018-01-29 23:47:12,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:12,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-29 23:47:12,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:12,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:12,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-29 23:47:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:12,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:47:12,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 49 [2018-01-29 23:47:12,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-29 23:47:12,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-29 23:47:12,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 23:47:12,999 INFO L87 Difference]: Start difference. First operand 211 states and 220 transitions. Second operand 50 states. [2018-01-29 23:47:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:47:16,919 INFO L93 Difference]: Finished difference Result 216 states and 224 transitions. [2018-01-29 23:47:16,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-29 23:47:16,919 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-01-29 23:47:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:47:16,920 INFO L225 Difference]: With dead ends: 216 [2018-01-29 23:47:16,920 INFO L226 Difference]: Without dead ends: 215 [2018-01-29 23:47:16,921 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1122, Invalid=6888, Unknown=0, NotChecked=0, Total=8010 [2018-01-29 23:47:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-29 23:47:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-01-29 23:47:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-29 23:47:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 218 transitions. [2018-01-29 23:47:16,942 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 218 transitions. Word has length 97 [2018-01-29 23:47:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:47:16,942 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 218 transitions. [2018-01-29 23:47:16,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-29 23:47:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 218 transitions. [2018-01-29 23:47:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-29 23:47:16,943 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:47:16,943 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:47:16,943 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:47:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2072340090, now seen corresponding path program 6 times [2018-01-29 23:47:16,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:47:16,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:47:16,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:16,944 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:47:16,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:16,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:47:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:18,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:47:18,328 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:47:18,332 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:47:18,343 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:47:18,347 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:47:18,354 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:47:18,367 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:47:18,370 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:47:18,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:47:18,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:47:18,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:47:18,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:47:18,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-29 23:47:18,466 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-01-29 23:47:18,467 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-01-29 23:47:18,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,480 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-01-29 23:47:18,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:18,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-29 23:47:18,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-01-29 23:47:18,614 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 16 treesize of output 15 [2018-01-29 23:47:18,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,634 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 40 treesize of output 41 [2018-01-29 23:47:18,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:18,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:50 [2018-01-29 23:47:18,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:47:18,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-29 23:47:18,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-01-29 23:47:18,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2018-01-29 23:47:18,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 23:47:18,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:18,829 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 28 treesize of output 33 [2018-01-29 23:47:18,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:47:18,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:18,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:76 [2018-01-29 23:47:19,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 83 [2018-01-29 23:47:19,018 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 22 treesize of output 31 [2018-01-29 23:47:19,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 118 [2018-01-29 23:47:19,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-29 23:47:19,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,085 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 1 xjuncts. [2018-01-29 23:47:19,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:140, output treesize:107 [2018-01-29 23:47:19,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 168 [2018-01-29 23:47:19,141 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 30 treesize of output 29 [2018-01-29 23:47:19,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 126 [2018-01-29 23:47:19,176 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 30 treesize of output 29 [2018-01-29 23:47:19,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,201 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 1 xjuncts. [2018-01-29 23:47:19,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:194, output treesize:139 [2018-01-29 23:47:19,700 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:19,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-29 23:47:19,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,720 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:19,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:19,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 131 [2018-01-29 23:47:19,728 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:19,734 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 68 [2018-01-29 23:47:19,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-29 23:47:19,786 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 69 treesize of output 59 [2018-01-29 23:47:19,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:19,792 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 71 [2018-01-29 23:47:19,793 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:47:19,828 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:19,828 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 66 treesize of output 62 [2018-01-29 23:47:19,829 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,830 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:19,830 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 66 treesize of output 62 [2018-01-29 23:47:19,831 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,832 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:19,833 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 70 treesize of output 66 [2018-01-29 23:47:19,833 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-01-29 23:47:19,908 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-01-29 23:47:19,910 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 23 treesize of output 7 [2018-01-29 23:47:19,910 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,920 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-01-29 23:47:19,920 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:47:19,928 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,934 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,938 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-01-29 23:47:19,940 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 23 treesize of output 7 [2018-01-29 23:47:19,940 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,950 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-01-29 23:47:19,950 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,958 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 3 [2018-01-29 23:47:19,958 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,964 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,967 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2018-01-29 23:47:19,969 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 3 [2018-01-29 23:47:19,969 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,979 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:19,979 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 19 treesize of output 15 [2018-01-29 23:47:19,980 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:19,989 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:19,994 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:20,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:20,018 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:206, output treesize:7 [2018-01-29 23:47:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:20,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:47:20,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 45 [2018-01-29 23:47:20,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 23:47:20,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 23:47:20,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1851, Unknown=9, NotChecked=0, Total=1980 [2018-01-29 23:47:20,134 INFO L87 Difference]: Start difference. First operand 211 states and 218 transitions. Second operand 45 states. [2018-01-29 23:47:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:47:23,916 INFO L93 Difference]: Finished difference Result 297 states and 307 transitions. [2018-01-29 23:47:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:47:23,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 98 [2018-01-29 23:47:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:47:23,917 INFO L225 Difference]: With dead ends: 297 [2018-01-29 23:47:23,917 INFO L226 Difference]: Without dead ends: 259 [2018-01-29 23:47:23,918 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=481, Invalid=5060, Unknown=9, NotChecked=0, Total=5550 [2018-01-29 23:47:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-29 23:47:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 218. [2018-01-29 23:47:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-29 23:47:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 225 transitions. [2018-01-29 23:47:23,941 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 225 transitions. Word has length 98 [2018-01-29 23:47:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:47:23,942 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 225 transitions. [2018-01-29 23:47:23,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 23:47:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 225 transitions. [2018-01-29 23:47:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-29 23:47:23,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:47:23,942 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-29 23:47:23,942 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:47:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1170457789, now seen corresponding path program 1 times [2018-01-29 23:47:23,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:47:23,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:47:23,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:23,943 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:47:23,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:23,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:47:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-29 23:47:24,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:47:24,664 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:47:24,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:47:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:24,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:47:24,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:47:24,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:47:24,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:24,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:24,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:47:24,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-29 23:47:24,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:47:24,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:24,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:47:24,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:47:24,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-29 23:47:24,896 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-01-29 23:47:24,897 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 25 treesize of output 10 [2018-01-29 23:47:24,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,906 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 1 xjuncts. [2018-01-29 23:47:24,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:30 [2018-01-29 23:47:24,961 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 25 treesize of output 26 [2018-01-29 23:47:24,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:24,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:24,972 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 1 xjuncts. [2018-01-29 23:47:24,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-01-29 23:47:24,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:24,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:24,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:24,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 23:47:24,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:25,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-01-29 23:47:25,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 23:47:25,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:25,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:47:25,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:25,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,083 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-01-29 23:47:25,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:54, output treesize:40 [2018-01-29 23:47:25,114 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 30 treesize of output 24 [2018-01-29 23:47:25,115 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 24 treesize of output 9 [2018-01-29 23:47:25,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,124 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-01-29 23:47:25,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2018-01-29 23:47:25,192 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 25 treesize of output 26 [2018-01-29 23:47:25,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:25,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,206 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 1 xjuncts. [2018-01-29 23:47:25,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2018-01-29 23:47:25,211 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-01-29 23:47:25,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 10 treesize of output 9 [2018-01-29 23:47:25,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:25,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-01-29 23:47:25,337 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 28 treesize of output 26 [2018-01-29 23:47:25,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:25,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:25,347 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 15 treesize of output 12 [2018-01-29 23:47:25,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:47:25,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:47:25,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:47:25,358 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:12 [2018-01-29 23:47:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 23:47:25,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:47:25,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2018-01-29 23:47:25,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 23:47:25,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 23:47:25,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:47:25,478 INFO L87 Difference]: Start difference. First operand 218 states and 225 transitions. Second operand 40 states. [2018-01-29 23:47:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:47:27,258 INFO L93 Difference]: Finished difference Result 222 states and 229 transitions. [2018-01-29 23:47:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 23:47:27,259 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 100 [2018-01-29 23:47:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:47:27,260 INFO L225 Difference]: With dead ends: 222 [2018-01-29 23:47:27,260 INFO L226 Difference]: Without dead ends: 221 [2018-01-29 23:47:27,260 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=694, Invalid=4136, Unknown=0, NotChecked=0, Total=4830 [2018-01-29 23:47:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-29 23:47:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-01-29 23:47:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-29 23:47:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 227 transitions. [2018-01-29 23:47:27,285 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 227 transitions. Word has length 100 [2018-01-29 23:47:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:47:27,285 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 227 transitions. [2018-01-29 23:47:27,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 23:47:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 227 transitions. [2018-01-29 23:47:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-29 23:47:27,286 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:47:27,286 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-29 23:47:27,286 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:47:27,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1891239326, now seen corresponding path program 4 times [2018-01-29 23:47:27,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:47:27,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:47:27,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:27,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:47:27,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:27,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:47:28,042 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 27 DAG size of output 23 [2018-01-29 23:47:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:47:28,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:47:28,503 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:47:28,508 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:47:28,536 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:47:28,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:47:28,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:47:28,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:47:28,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:28,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:28,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:47:28,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-01-29 23:47:28,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:47:28,753 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-01-29 23:47:28,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:47:28,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:28,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2018-01-29 23:47:28,822 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 19 treesize of output 15 [2018-01-29 23:47:28,823 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 15 treesize of output 7 [2018-01-29 23:47:28,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:28,834 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 1 xjuncts. [2018-01-29 23:47:28,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2018-01-29 23:47:29,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,004 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 35 treesize of output 36 [2018-01-29 23:47:29,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:29,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,018 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 1 xjuncts. [2018-01-29 23:47:29,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:43 [2018-01-29 23:47:29,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:47:29,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:29,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:45 [2018-01-29 23:47:29,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,215 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 33 treesize of output 34 [2018-01-29 23:47:29,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:29,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,239 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 16 [2018-01-29 23:47:29,241 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 16 treesize of output 15 [2018-01-29 23:47:29,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,256 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-01-29 23:47:29,256 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:63 [2018-01-29 23:47:29,316 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 15 [2018-01-29 23:47:29,318 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-01-29 23:47:29,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:29,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:69 [2018-01-29 23:47:29,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,581 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 3 case distinctions, treesize of input 63 treesize of output 76 [2018-01-29 23:47:29,583 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 84 treesize of output 72 [2018-01-29 23:47:29,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,639 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 11 treesize of output 20 [2018-01-29 23:47:29,641 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-01-29 23:47:29,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:29,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:73 [2018-01-29 23:47:29,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:29,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 113 [2018-01-29 23:47:29,763 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 170 treesize of output 180 [2018-01-29 23:47:29,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,805 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:29,805 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 0 case distinctions, treesize of input 70 treesize of output 80 [2018-01-29 23:47:29,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:47:29,903 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 72 treesize of output 55 [2018-01-29 23:47:29,906 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 30 treesize of output 13 [2018-01-29 23:47:29,906 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 93 [2018-01-29 23:47:29,917 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 42 treesize of output 19 [2018-01-29 23:47:29,918 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,924 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:29,946 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-01-29 23:47:29,946 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:153, output treesize:141 [2018-01-29 23:47:30,759 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:30,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 87 [2018-01-29 23:47:30,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:47:30,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:47:30,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:47:30,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:30,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 120 [2018-01-29 23:47:30,844 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 11 treesize of output 3 [2018-01-29 23:47:30,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:30,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:30,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-01-29 23:47:30,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:209, output treesize:208 [2018-01-29 23:47:31,359 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 81 treesize of output 75 [2018-01-29 23:47:31,365 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 23 treesize of output 20 [2018-01-29 23:47:31,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:47:31,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:47:31,436 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 97 treesize of output 93 [2018-01-29 23:47:31,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-29 23:47:31,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 23:47:31,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:47:31,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-01-29 23:47:31,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:179, output treesize:269 [2018-01-29 23:47:32,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,328 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:32,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 109 [2018-01-29 23:47:32,360 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 95 [2018-01-29 23:47:32,360 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-29 23:47:32,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 94 dim-0 vars, End of recursive call: 94 dim-0 vars, and 54 xjuncts. [2018-01-29 23:47:32,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-29 23:47:32,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:32,564 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:32,564 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 23 treesize of output 22 [2018-01-29 23:47:32,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:32,566 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 17 treesize of output 13 [2018-01-29 23:47:32,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:32,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:47:32,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,607 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:32,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,608 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 74 [2018-01-29 23:47:32,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:32,620 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 35 [2018-01-29 23:47:32,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-29 23:47:32,638 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 17 treesize of output 9 [2018-01-29 23:47:32,638 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:32,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:32,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:47:32,669 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:139, output treesize:22 [2018-01-29 23:47:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:32,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:47:32,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 43] total 67 [2018-01-29 23:47:32,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-01-29 23:47:32,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-01-29 23:47:32,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4215, Unknown=0, NotChecked=0, Total=4422 [2018-01-29 23:47:32,948 INFO L87 Difference]: Start difference. First operand 221 states and 227 transitions. Second operand 67 states. [2018-01-29 23:47:37,102 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 130 DAG size of output 72 [2018-01-29 23:47:40,015 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 252 DAG size of output 91 [2018-01-29 23:47:40,470 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 285 DAG size of output 96 [2018-01-29 23:47:40,801 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 258 DAG size of output 87 [2018-01-29 23:47:41,107 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 250 DAG size of output 78 [2018-01-29 23:47:41,422 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 174 DAG size of output 103 [2018-01-29 23:47:41,805 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 181 DAG size of output 109 [2018-01-29 23:47:42,055 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 168 DAG size of output 106 [2018-01-29 23:47:42,277 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 163 DAG size of output 102 [2018-01-29 23:47:42,543 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 163 DAG size of output 98 [2018-01-29 23:47:43,363 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 132 DAG size of output 73 [2018-01-29 23:47:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:47:43,797 INFO L93 Difference]: Finished difference Result 288 states and 295 transitions. [2018-01-29 23:47:43,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-29 23:47:43,798 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 105 [2018-01-29 23:47:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:47:43,799 INFO L225 Difference]: With dead ends: 288 [2018-01-29 23:47:43,799 INFO L226 Difference]: Without dead ends: 268 [2018-01-29 23:47:43,799 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3714 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1243, Invalid=14257, Unknown=0, NotChecked=0, Total=15500 [2018-01-29 23:47:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-01-29 23:47:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 238. [2018-01-29 23:47:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-29 23:47:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 243 transitions. [2018-01-29 23:47:43,845 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 243 transitions. Word has length 105 [2018-01-29 23:47:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:47:43,846 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 243 transitions. [2018-01-29 23:47:43,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-01-29 23:47:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 243 transitions. [2018-01-29 23:47:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-29 23:47:43,847 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:47:43,847 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-29 23:47:43,847 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:47:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1239434204, now seen corresponding path program 7 times [2018-01-29 23:47:43,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:47:43,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:47:43,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:43,848 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:47:43,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:43,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:47:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:44,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:47:44,943 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:47:44,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:47:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:44,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:47:45,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:47:45,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:47:45,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 23:47:45,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-29 23:47:45,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:47:45,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:45,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,171 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-01-29 23:47:45,173 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-01-29 23:47:45,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:45 [2018-01-29 23:47:45,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,303 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 40 treesize of output 41 [2018-01-29 23:47:45,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:45,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-01-29 23:47:45,328 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 16 treesize of output 15 [2018-01-29 23:47:45,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2018-01-29 23:47:45,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,388 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 26 treesize of output 46 [2018-01-29 23:47:45,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:67 [2018-01-29 23:47:45,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,509 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 28 treesize of output 33 [2018-01-29 23:47:45,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:47:45,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 71 [2018-01-29 23:47:45,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 23:47:45,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:77 [2018-01-29 23:47:45,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-29 23:47:45,747 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 22 treesize of output 21 [2018-01-29 23:47:45,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 101 [2018-01-29 23:47:45,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:45,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,826 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 1 xjuncts. [2018-01-29 23:47:45,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:125, output treesize:95 [2018-01-29 23:47:45,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:45,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 67 [2018-01-29 23:47:45,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:45,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:45,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:100, output treesize:92 [2018-01-29 23:47:46,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,026 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 28 treesize of output 39 [2018-01-29 23:47:46,029 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-01-29 23:47:46,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 112 [2018-01-29 23:47:46,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:47:46,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,098 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-01-29 23:47:46,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:123, output treesize:95 [2018-01-29 23:47:46,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-01-29 23:47:46,287 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 28 treesize of output 27 [2018-01-29 23:47:46,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 151 [2018-01-29 23:47:46,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:47:46,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:46,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:191, output treesize:145 [2018-01-29 23:47:46,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 152 [2018-01-29 23:47:46,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 26 treesize of output 25 [2018-01-29 23:47:46,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-01-29 23:47:46,462 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 26 treesize of output 25 [2018-01-29 23:47:46,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:46,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:232, output treesize:192 [2018-01-29 23:47:46,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-01-29 23:47:46,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:46,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,702 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:46,703 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 18 treesize of output 12 [2018-01-29 23:47:46,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-29 23:47:46,726 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:213, output treesize:171 [2018-01-29 23:47:46,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,950 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:46,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:47:46,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 110 [2018-01-29 23:47:46,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:47:46,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-01-29 23:47:46,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,978 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:47:46,979 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 33 treesize of output 21 [2018-01-29 23:47:46,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,985 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 13 treesize of output 9 [2018-01-29 23:47:46,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:47:46,994 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:172, output treesize:5 [2018-01-29 23:47:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:47,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:47:47,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2018-01-29 23:47:47,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 23:47:47,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 23:47:47,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2461, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:47:47,088 INFO L87 Difference]: Start difference. First operand 238 states and 243 transitions. Second operand 52 states. [2018-01-29 23:47:49,431 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 139 DAG size of output 94 [2018-01-29 23:47:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:47:52,220 INFO L93 Difference]: Finished difference Result 342 states and 352 transitions. [2018-01-29 23:47:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:47:52,221 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 106 [2018-01-29 23:47:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:47:52,222 INFO L225 Difference]: With dead ends: 342 [2018-01-29 23:47:52,222 INFO L226 Difference]: Without dead ends: 341 [2018-01-29 23:47:52,222 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=980, Invalid=8332, Unknown=0, NotChecked=0, Total=9312 [2018-01-29 23:47:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-29 23:47:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 272. [2018-01-29 23:47:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-29 23:47:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 280 transitions. [2018-01-29 23:47:52,256 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 280 transitions. Word has length 106 [2018-01-29 23:47:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:47:52,256 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 280 transitions. [2018-01-29 23:47:52,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 23:47:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 280 transitions. [2018-01-29 23:47:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-29 23:47:52,257 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:47:52,257 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-29 23:47:52,257 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:47:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1239434205, now seen corresponding path program 5 times [2018-01-29 23:47:52,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:47:52,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:47:52,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:52,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:47:52,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:47:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:47:52,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:47:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:47:53,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:47:53,688 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:47:53,693 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:47:53,704 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:47:53,711 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:47:53,725 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:47:53,754 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:47:53,758 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:47:53,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-01-29 23:47:53,785 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:47:53,785 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:47:53,789 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:47:53,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:47:53 BoogieIcfgContainer [2018-01-29 23:47:53,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:47:53,790 INFO L168 Benchmark]: Toolchain (without parser) took 119063.81 ms. Allocated memory was 303.6 MB in the beginning and 637.0 MB in the end (delta: 333.4 MB). Free memory was 262.4 MB in the beginning and 518.4 MB in the end (delta: -256.0 MB). Peak memory consumption was 77.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:47:53,791 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:47:53,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.49 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 250.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:47:53,792 INFO L168 Benchmark]: Boogie Preprocessor took 38.24 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:47:53,792 INFO L168 Benchmark]: RCFGBuilder took 329.96 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 225.5 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-29 23:47:53,792 INFO L168 Benchmark]: TraceAbstraction took 118472.38 ms. Allocated memory was 303.6 MB in the beginning and 637.0 MB in the end (delta: 333.4 MB). Free memory was 225.5 MB in the beginning and 518.4 MB in the end (delta: -292.9 MB). Peak memory consumption was 40.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:47:53,794 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.22 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.49 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 250.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.24 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 329.96 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 225.5 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 118472.38 ms. Allocated memory was 303.6 MB in the beginning and 637.0 MB in the end (delta: 333.4 MB). Free memory was 225.5 MB in the beginning and 518.4 MB in the end (delta: -292.9 MB). Peak memory consumption was 40.6 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 638). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 88 locations, 19 error locations. TIMEOUT Result, 118.4s OverallTime, 36 OverallIterations, 4 TraceHistogramMax, 71.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2369 SDtfs, 17960 SDslu, 33294 SDs, 0 SdLazy, 26483 SolverSat, 3343 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3489 GetRequests, 1699 SyntacticMatches, 112 SemanticMatches, 1678 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 29206 ImplicationChecksByTransitivity, 74.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=35, 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.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 1313 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 42.0s InterpolantComputationTime, 4413 NumberOfCodeBlocks, 4387 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 4351 ConstructedInterpolants, 741 QuantifiedInterpolants, 11302734 SizeOfPredicates, 604 NumberOfNonLiveVariables, 6036 ConjunctsInSsa, 1276 ConjunctsInUnsatCore, 62 InterpolantComputations, 8 PerfectInterpolantSequences, 184/1988 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-47-53-801.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-47-53-801.csv Completed graceful shutdown