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-properties/alternating_list_true-unreach-call_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-30 00:24:47,306 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-30 00:24:47,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-30 00:24:47,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-30 00:24:47,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-30 00:24:47,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-30 00:24:47,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-30 00:24:47,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-30 00:24:47,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-30 00:24:47,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-30 00:24:47,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-30 00:24:47,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-30 00:24:47,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-30 00:24:47,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-30 00:24:47,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-30 00:24:47,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-30 00:24:47,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-30 00:24:47,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-30 00:24:47,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-30 00:24:47,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-30 00:24:47,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-30 00:24:47,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-30 00:24:47,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-30 00:24:47,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-30 00:24:47,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-30 00:24:47,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-30 00:24:47,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-30 00:24:47,345 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-30 00:24:47,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-30 00:24:47,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-30 00:24:47,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-30 00:24:47,346 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-30 00:24:47,356 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-30 00:24:47,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-30 00:24:47,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-30 00:24:47,357 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-30 00:24:47,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-30 00:24:47,358 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-30 00:24:47,358 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-30 00:24:47,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-30 00:24:47,359 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-30 00:24:47,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-30 00:24:47,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-30 00:24:47,359 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-30 00:24:47,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-30 00:24:47,360 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-30 00:24:47,360 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-30 00:24:47,360 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-30 00:24:47,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-30 00:24:47,361 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-30 00:24:47,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-30 00:24:47,361 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-30 00:24:47,361 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-30 00:24:47,361 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-30 00:24:47,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-30 00:24:47,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-30 00:24:47,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-30 00:24:47,362 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-30 00:24:47,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-30 00:24:47,363 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-30 00:24:47,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-30 00:24:47,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-30 00:24:47,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-30 00:24:47,363 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-30 00:24:47,364 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-30 00:24:47,364 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-30 00:24:47,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-30 00:24:47,412 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-30 00:24:47,416 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-30 00:24:47,418 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-30 00:24:47,418 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-30 00:24:47,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i
[2018-01-30 00:24:47,580 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-30 00:24:47,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-30 00:24:47,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-30 00:24:47,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-30 00:24:47,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-30 00:24:47,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17492289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47, skipping insertion in model container
[2018-01-30 00:24:47,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,609 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-30 00:24:47,646 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-30 00:24:47,768 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-30 00:24:47,791 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-30 00:24:47,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47 WrapperNode
[2018-01-30 00:24:47,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-30 00:24:47,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-30 00:24:47,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-30 00:24:47,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-30 00:24:47,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (1/1) ...
[2018-01-30 00:24:47,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-30 00:24:47,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-30 00:24:47,837 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-30 00:24:47,837 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-30 00:24:47,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (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-30 00:24:47,884 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-30 00:24:47,884 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-30 00:24:47,884 INFO L136 BoogieDeclarations]: Found implementation of procedure exit
[2018-01-30 00:24:47,884 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-30 00:24:47,884 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-30 00:24:47,884 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-30 00:24:47,884 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-30 00:24:47,884 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-30 00:24:47,884 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure exit
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-30 00:24:47,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-30 00:24:47,886 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-30 00:24:48,271 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-30 00:24:48,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:24:48 BoogieIcfgContainer
[2018-01-30 00:24:48,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-30 00:24:48,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-30 00:24:48,273 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-30 00:24:48,276 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-30 00:24:48,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:24:47" (1/3) ...
[2018-01-30 00:24:48,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ab8961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:24:48, skipping insertion in model container
[2018-01-30 00:24:48,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:47" (2/3) ...
[2018-01-30 00:24:48,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ab8961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:24:48, skipping insertion in model container
[2018-01-30 00:24:48,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:24:48" (3/3) ...
[2018-01-30 00:24:48,279 INFO L107 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i
[2018-01-30 00:24:48,286 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-30 00:24:48,293 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations.
[2018-01-30 00:24:48,332 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-30 00:24:48,332 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-30 00:24:48,333 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-30 00:24:48,333 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-30 00:24:48,333 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-30 00:24:48,333 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-30 00:24:48,333 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-30 00:24:48,333 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-30 00:24:48,334 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-30 00:24:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states.
[2018-01-30 00:24:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-01-30 00:24:48,357 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:48,358 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:24:48,358 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1330717564, now seen corresponding path program 1 times
[2018-01-30 00:24:48,364 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:48,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:48,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:48,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:48,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:48,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:48,488 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-30 00:24:48,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:48,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-30 00:24:48,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-01-30 00:24:48,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-01-30 00:24:48,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-01-30 00:24:48,506 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states.
[2018-01-30 00:24:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:48,623 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions.
[2018-01-30 00:24:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-01-30 00:24:48,625 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14
[2018-01-30 00:24:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:48,636 INFO L225 Difference]: With dead ends: 160
[2018-01-30 00:24:48,636 INFO L226 Difference]: Without dead ends: 90
[2018-01-30 00:24:48,641 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-30 00:24:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2018-01-30 00:24:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90.
[2018-01-30 00:24:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2018-01-30 00:24:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions.
[2018-01-30 00:24:48,678 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 14
[2018-01-30 00:24:48,679 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:48,679 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions.
[2018-01-30 00:24:48,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-01-30 00:24:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions.
[2018-01-30 00:24:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-01-30 00:24:48,679 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:48,680 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:24:48,680 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:48,680 INFO L82 PathProgramCache]: Analyzing trace with hash -898856008, now seen corresponding path program 1 times
[2018-01-30 00:24:48,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:48,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:48,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:48,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:48,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:48,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:48,775 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-30 00:24:48,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:48,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-30 00:24:48,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-30 00:24:48,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-30 00:24:48,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:24:48,778 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states.
[2018-01-30 00:24:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:49,032 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions.
[2018-01-30 00:24:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-30 00:24:49,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2018-01-30 00:24:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:49,034 INFO L225 Difference]: With dead ends: 126
[2018-01-30 00:24:49,034 INFO L226 Difference]: Without dead ends: 114
[2018-01-30 00:24:49,036 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-30 00:24:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2018-01-30 00:24:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96.
[2018-01-30 00:24:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-01-30 00:24:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions.
[2018-01-30 00:24:49,048 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 17
[2018-01-30 00:24:49,048 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:49,048 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions.
[2018-01-30 00:24:49,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-30 00:24:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions.
[2018-01-30 00:24:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-01-30 00:24:49,049 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:49,049 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:24:49,049 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash -898856007, now seen corresponding path program 1 times
[2018-01-30 00:24:49,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:49,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:49,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:49,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:49,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:49,188 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-30 00:24:49,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:49,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-30 00:24:49,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-30 00:24:49,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-30 00:24:49,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-30 00:24:49,189 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 5 states.
[2018-01-30 00:24:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:49,350 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions.
[2018-01-30 00:24:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-30 00:24:49,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2018-01-30 00:24:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:49,352 INFO L225 Difference]: With dead ends: 142
[2018-01-30 00:24:49,352 INFO L226 Difference]: Without dead ends: 130
[2018-01-30 00:24:49,353 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-30 00:24:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2018-01-30 00:24:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121.
[2018-01-30 00:24:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2018-01-30 00:24:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions.
[2018-01-30 00:24:49,366 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 17
[2018-01-30 00:24:49,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:49,366 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions.
[2018-01-30 00:24:49,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-30 00:24:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions.
[2018-01-30 00:24:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-01-30 00:24:49,368 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:49,368 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-30 00:24:49,368 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash 724036120, now seen corresponding path program 1 times
[2018-01-30 00:24:49,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:49,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:49,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:49,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:49,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:49,562 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-30 00:24:49,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:49,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-30 00:24:49,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-30 00:24:49,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-30 00:24:49,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-30 00:24:49,563 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 6 states.
[2018-01-30 00:24:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:49,810 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions.
[2018-01-30 00:24:49,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-30 00:24:49,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31
[2018-01-30 00:24:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:49,812 INFO L225 Difference]: With dead ends: 179
[2018-01-30 00:24:49,812 INFO L226 Difference]: Without dead ends: 174
[2018-01-30 00:24:49,812 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2018-01-30 00:24:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2018-01-30 00:24:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158.
[2018-01-30 00:24:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states.
[2018-01-30 00:24:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions.
[2018-01-30 00:24:49,826 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 31
[2018-01-30 00:24:49,827 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:49,827 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions.
[2018-01-30 00:24:49,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-30 00:24:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions.
[2018-01-30 00:24:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-01-30 00:24:49,828 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:49,829 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]
[2018-01-30 00:24:49,829 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:49,829 INFO L82 PathProgramCache]: Analyzing trace with hash -977598808, now seen corresponding path program 1 times
[2018-01-30 00:24:49,829 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:49,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:49,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:49,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:49,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:49,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:49,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-30 00:24:49,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-30 00:24:49,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-30 00:24:49,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-30 00:24:49,873 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 3 states.
[2018-01-30 00:24:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:49,923 INFO L93 Difference]: Finished difference Result 354 states and 396 transitions.
[2018-01-30 00:24:49,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-30 00:24:49,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31
[2018-01-30 00:24:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:49,930 INFO L225 Difference]: With dead ends: 354
[2018-01-30 00:24:49,930 INFO L226 Difference]: Without dead ends: 228
[2018-01-30 00:24:49,931 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-30 00:24:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states.
[2018-01-30 00:24:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 176.
[2018-01-30 00:24:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states.
[2018-01-30 00:24:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions.
[2018-01-30 00:24:49,950 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 31
[2018-01-30 00:24:49,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:49,950 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions.
[2018-01-30 00:24:49,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-30 00:24:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions.
[2018-01-30 00:24:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-01-30 00:24:49,952 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:49,952 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]
[2018-01-30 00:24:49,952 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash -934172574, now seen corresponding path program 1 times
[2018-01-30 00:24:49,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:49,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:49,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:49,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:49,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:50,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:50,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-30 00:24:50,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-30 00:24:50,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-30 00:24:50,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:24:50,048 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand 7 states.
[2018-01-30 00:24:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:50,338 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions.
[2018-01-30 00:24:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-30 00:24:50,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31
[2018-01-30 00:24:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:50,339 INFO L225 Difference]: With dead ends: 189
[2018-01-30 00:24:50,339 INFO L226 Difference]: Without dead ends: 186
[2018-01-30 00:24:50,340 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156
[2018-01-30 00:24:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2018-01-30 00:24:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173.
[2018-01-30 00:24:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states.
[2018-01-30 00:24:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions.
[2018-01-30 00:24:50,353 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 31
[2018-01-30 00:24:50,353 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:50,353 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions.
[2018-01-30 00:24:50,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-30 00:24:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions.
[2018-01-30 00:24:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-01-30 00:24:50,355 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:50,355 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]
[2018-01-30 00:24:50,355 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash -934172573, now seen corresponding path program 1 times
[2018-01-30 00:24:50,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:50,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:50,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:50,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:50,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:50,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:50,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:50,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-30 00:24:50,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-30 00:24:50,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-30 00:24:50,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:24:50,529 INFO L87 Difference]: Start difference. First operand 173 states and 199 transitions. Second operand 7 states.
[2018-01-30 00:24:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:50,838 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions.
[2018-01-30 00:24:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-30 00:24:50,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31
[2018-01-30 00:24:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:50,840 INFO L225 Difference]: With dead ends: 202
[2018-01-30 00:24:50,840 INFO L226 Difference]: Without dead ends: 197
[2018-01-30 00:24:50,840 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-30 00:24:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2018-01-30 00:24:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 159.
[2018-01-30 00:24:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states.
[2018-01-30 00:24:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions.
[2018-01-30 00:24:50,850 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 31
[2018-01-30 00:24:50,851 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:50,851 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions.
[2018-01-30 00:24:50,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-30 00:24:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions.
[2018-01-30 00:24:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-01-30 00:24:50,852 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:50,852 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, 1, 1]
[2018-01-30 00:24:50,852 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1544068819, now seen corresponding path program 1 times
[2018-01-30 00:24:50,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:50,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:50,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:50,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:50,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:50,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:50,954 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-30 00:24:50,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:50,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-30 00:24:50,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-30 00:24:50,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-30 00:24:50,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:24:50,955 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 7 states.
[2018-01-30 00:24:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:51,136 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions.
[2018-01-30 00:24:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-30 00:24:51,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33
[2018-01-30 00:24:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:51,137 INFO L225 Difference]: With dead ends: 217
[2018-01-30 00:24:51,137 INFO L226 Difference]: Without dead ends: 141
[2018-01-30 00:24:51,138 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2018-01-30 00:24:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2018-01-30 00:24:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121.
[2018-01-30 00:24:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2018-01-30 00:24:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions.
[2018-01-30 00:24:51,145 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 33
[2018-01-30 00:24:51,145 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:51,145 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions.
[2018-01-30 00:24:51,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-30 00:24:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions.
[2018-01-30 00:24:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-01-30 00:24:51,147 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:51,147 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]
[2018-01-30 00:24:51,147 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash 530617666, now seen corresponding path program 1 times
[2018-01-30 00:24:51,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:51,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:51,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:51,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:51,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:51,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:51,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:24:51,417 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-30 00:24:51,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:51,474 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:24:51,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:51,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:24:51,600 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-30 00:24:51,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:51,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22
[2018-01-30 00:24:51,676 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:51,677 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:51,680 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-30 00:24:51,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21
[2018-01-30 00:24:51,752 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-30 00:24:51,760 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-30 00:24:51,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,802 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 27 treesize of output 25
[2018-01-30 00:24:51,807 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:51,808 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 22 treesize of output 29
[2018-01-30 00:24:51,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,822 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-30 00:24:51,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27
[2018-01-30 00:24:51,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16
[2018-01-30 00:24:51,862 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 16 treesize of output 4
[2018-01-30 00:24:51,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15
[2018-01-30 00:24:51,932 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 19 treesize of output 20
[2018-01-30 00:24:51,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:51,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:51,946 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-30 00:24:51,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22
[2018-01-30 00:24:52,009 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 22 treesize of output 20
[2018-01-30 00:24:52,012 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-30 00:24:52,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:52,024 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-30 00:24:52,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:52,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:52,048 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-30 00:24:52,048 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3
[2018-01-30 00:24:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:52,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:24:52,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27
[2018-01-30 00:24:52,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-01-30 00:24:52,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-01-30 00:24:52,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702
[2018-01-30 00:24:52,110 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 27 states.
[2018-01-30 00:24:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:53,210 INFO L93 Difference]: Finished difference Result 267 states and 290 transitions.
[2018-01-30 00:24:53,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-01-30 00:24:53,210 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45
[2018-01-30 00:24:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:53,211 INFO L225 Difference]: With dead ends: 267
[2018-01-30 00:24:53,212 INFO L226 Difference]: Without dead ends: 257
[2018-01-30 00:24:53,213 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=402, Invalid=1668, Unknown=0, NotChecked=0, Total=2070
[2018-01-30 00:24:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states.
[2018-01-30 00:24:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 178.
[2018-01-30 00:24:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2018-01-30 00:24:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions.
[2018-01-30 00:24:53,227 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 45
[2018-01-30 00:24:53,228 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:53,228 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions.
[2018-01-30 00:24:53,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-01-30 00:24:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions.
[2018-01-30 00:24:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-30 00:24:53,229 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:53,230 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]
[2018-01-30 00:24:53,230 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash -884888159, now seen corresponding path program 1 times
[2018-01-30 00:24:53,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:53,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:53,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:53,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:53,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:53,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:53,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:24:53,616 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-30 00:24:53,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:53,645 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:24:53,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:53,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:24:53,747 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:53,748 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:53,749 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-30 00:24:53,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24
[2018-01-30 00:24:53,803 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-30 00:24:53,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, 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-30 00:24:53,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,816 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-30 00:24:53,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36
[2018-01-30 00:24:53,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41
[2018-01-30 00:24:53,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:24:53,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,891 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-30 00:24:53,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:26
[2018-01-30 00:24:53,955 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 27 treesize of output 21
[2018-01-30 00:24:53,961 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:24:53,962 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-30 00:24:53,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:53,979 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-30 00:24:53,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15
[2018-01-30 00:24:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:54,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:24:54,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27
[2018-01-30 00:24:54,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states
[2018-01-30 00:24:54,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2018-01-30 00:24:54,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756
[2018-01-30 00:24:54,055 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 28 states.
[2018-01-30 00:24:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:55,068 INFO L93 Difference]: Finished difference Result 263 states and 284 transitions.
[2018-01-30 00:24:55,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-01-30 00:24:55,071 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47
[2018-01-30 00:24:55,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:55,073 INFO L225 Difference]: With dead ends: 263
[2018-01-30 00:24:55,073 INFO L226 Difference]: Without dead ends: 262
[2018-01-30 00:24:55,074 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=2091, Unknown=0, NotChecked=0, Total=2652
[2018-01-30 00:24:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states.
[2018-01-30 00:24:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 182.
[2018-01-30 00:24:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states.
[2018-01-30 00:24:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions.
[2018-01-30 00:24:55,087 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 47
[2018-01-30 00:24:55,088 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:55,088 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions.
[2018-01-30 00:24:55,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2018-01-30 00:24:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions.
[2018-01-30 00:24:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-30 00:24:55,089 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:55,089 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]
[2018-01-30 00:24:55,089 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash -884888158, now seen corresponding path program 1 times
[2018-01-30 00:24:55,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:55,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:55,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:55,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:55,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:55,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:55,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:24:55,440 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-30 00:24:55,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:55,467 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:24:55,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:55,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:24:55,518 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:55,547 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:55,548 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-30 00:24:55,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,555 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-30 00:24:55,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22
[2018-01-30 00:24:55,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, 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-30 00:24:55,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, 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-30 00:24:55,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,587 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-30 00:24:55,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:55,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,598 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-30 00:24:55,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40
[2018-01-30 00:24:55,656 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-30 00:24:55,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, 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 1
[2018-01-30 00:24:55,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41
[2018-01-30 00:24:55,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:24:55,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,683 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-30 00:24:55,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:28
[2018-01-30 00:24:55,769 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 27 treesize of output 21
[2018-01-30 00:24:55,772 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:24:55,773 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-30 00:24:55,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,786 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 17 treesize of output 13
[2018-01-30 00:24:55,787 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:24:55,788 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-30 00:24:55,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:55,796 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-30 00:24:55,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:9
[2018-01-30 00:24:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:55,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:24:55,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22
[2018-01-30 00:24:55,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-01-30 00:24:55,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-01-30 00:24:55,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506
[2018-01-30 00:24:55,836 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand 23 states.
[2018-01-30 00:24:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:56,704 INFO L93 Difference]: Finished difference Result 278 states and 301 transitions.
[2018-01-30 00:24:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-01-30 00:24:56,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47
[2018-01-30 00:24:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:56,706 INFO L225 Difference]: With dead ends: 278
[2018-01-30 00:24:56,706 INFO L226 Difference]: Without dead ends: 274
[2018-01-30 00:24:56,706 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722
[2018-01-30 00:24:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states.
[2018-01-30 00:24:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 195.
[2018-01-30 00:24:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states.
[2018-01-30 00:24:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 220 transitions.
[2018-01-30 00:24:56,719 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 220 transitions. Word has length 47
[2018-01-30 00:24:56,719 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:56,720 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 220 transitions.
[2018-01-30 00:24:56,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-01-30 00:24:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 220 transitions.
[2018-01-30 00:24:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-01-30 00:24:56,721 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:56,721 INFO L350 BasicCegarLoop]: trace histogram [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-30 00:24:56,721 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1225918029, now seen corresponding path program 1 times
[2018-01-30 00:24:56,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:56,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:56,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:56,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:56,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:56,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-01-30 00:24:56,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:56,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-30 00:24:56,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-30 00:24:56,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-30 00:24:56,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-30 00:24:56,797 INFO L87 Difference]: Start difference. First operand 195 states and 220 transitions. Second operand 6 states.
[2018-01-30 00:24:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:56,895 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions.
[2018-01-30 00:24:56,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-30 00:24:56,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59
[2018-01-30 00:24:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:56,897 INFO L225 Difference]: With dead ends: 204
[2018-01-30 00:24:56,898 INFO L226 Difference]: Without dead ends: 203
[2018-01-30 00:24:56,898 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2018-01-30 00:24:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states.
[2018-01-30 00:24:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198.
[2018-01-30 00:24:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states.
[2018-01-30 00:24:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions.
[2018-01-30 00:24:56,907 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 224 transitions. Word has length 59
[2018-01-30 00:24:56,907 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:56,907 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 224 transitions.
[2018-01-30 00:24:56,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-30 00:24:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions.
[2018-01-30 00:24:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-01-30 00:24:56,908 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:56,908 INFO L350 BasicCegarLoop]: trace histogram [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-30 00:24:56,908 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1225918028, now seen corresponding path program 1 times
[2018-01-30 00:24:56,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:56,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:56,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:56,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:56,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:56,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-30 00:24:57,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:24:57,039 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-30 00:24:57,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:57,070 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:24:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-30 00:24:57,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:24:57,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6
[2018-01-30 00:24:57,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-30 00:24:57,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-30 00:24:57,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-01-30 00:24:57,127 INFO L87 Difference]: Start difference. First operand 198 states and 224 transitions. Second operand 7 states.
[2018-01-30 00:24:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:57,246 INFO L93 Difference]: Finished difference Result 202 states and 227 transitions.
[2018-01-30 00:24:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-01-30 00:24:57,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59
[2018-01-30 00:24:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:57,248 INFO L225 Difference]: With dead ends: 202
[2018-01-30 00:24:57,248 INFO L226 Difference]: Without dead ends: 201
[2018-01-30 00:24:57,248 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2018-01-30 00:24:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2018-01-30 00:24:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197.
[2018-01-30 00:24:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states.
[2018-01-30 00:24:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 222 transitions.
[2018-01-30 00:24:57,255 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 222 transitions. Word has length 59
[2018-01-30 00:24:57,255 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:57,255 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 222 transitions.
[2018-01-30 00:24:57,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-30 00:24:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 222 transitions.
[2018-01-30 00:24:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-01-30 00:24:57,256 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:57,256 INFO L350 BasicCegarLoop]: trace histogram [3, 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-30 00:24:57,256 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash 624803197, now seen corresponding path program 2 times
[2018-01-30 00:24:57,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:57,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:57,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:57,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:57,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:57,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-30 00:24:57,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:24:57,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-30 00:24:57,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-30 00:24:57,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-30 00:24:57,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-30 00:24:57,291 INFO L87 Difference]: Start difference. First operand 197 states and 222 transitions. Second operand 3 states.
[2018-01-30 00:24:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:57,327 INFO L93 Difference]: Finished difference Result 378 states and 423 transitions.
[2018-01-30 00:24:57,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-30 00:24:57,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59
[2018-01-30 00:24:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:57,329 INFO L225 Difference]: With dead ends: 378
[2018-01-30 00:24:57,329 INFO L226 Difference]: Without dead ends: 236
[2018-01-30 00:24:57,330 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-30 00:24:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states.
[2018-01-30 00:24:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 192.
[2018-01-30 00:24:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states.
[2018-01-30 00:24:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions.
[2018-01-30 00:24:57,342 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 59
[2018-01-30 00:24:57,343 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:57,343 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions.
[2018-01-30 00:24:57,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-30 00:24:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions.
[2018-01-30 00:24:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-01-30 00:24:57,344 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:57,344 INFO L350 BasicCegarLoop]: trace histogram [3, 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-30 00:24:57,344 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash 549546192, now seen corresponding path program 1 times
[2018-01-30 00:24:57,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:57,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:57,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:57,345 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-30 00:24:57,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:57,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:57,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:24:57,672 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-30 00:24:57,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:57,704 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:24:57,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:57,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:24:57,764 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:57,765 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:57,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-30 00:24:57,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-01-30 00:24:57,782 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-30 00:24:57,784 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-30 00:24:57,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,796 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-30 00:24:57,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 10 treesize of output 9
[2018-01-30 00:24:57,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,808 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-30 00:24:57,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:20
[2018-01-30 00:24:57,847 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 120 treesize of output 121
[2018-01-30 00:24:57,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 36 treesize of output 1
[2018-01-30 00:24:57,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,864 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 29 treesize of output 20
[2018-01-30 00:24:57,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:57,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,877 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 75 treesize of output 69
[2018-01-30 00:24:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1
[2018-01-30 00:24:57,879 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,883 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,887 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:133, output treesize:33
[2018-01-30 00:24:57,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33
[2018-01-30 00:24:57,951 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:24:57,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25
[2018-01-30 00:24:57,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,964 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 23 treesize of output 19
[2018-01-30 00:24:57,966 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:24:57,967 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-30 00:24:57,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:57,975 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-30 00:24:57,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:7
[2018-01-30 00:24:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:58,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:24:58,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 23
[2018-01-30 00:24:58,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-01-30 00:24:58,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-01-30 00:24:58,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506
[2018-01-30 00:24:58,028 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand 23 states.
[2018-01-30 00:24:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:24:58,858 INFO L93 Difference]: Finished difference Result 264 states and 279 transitions.
[2018-01-30 00:24:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-01-30 00:24:58,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59
[2018-01-30 00:24:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:24:58,860 INFO L225 Difference]: With dead ends: 264
[2018-01-30 00:24:58,860 INFO L226 Difference]: Without dead ends: 198
[2018-01-30 00:24:58,861 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892
[2018-01-30 00:24:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2018-01-30 00:24:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 161.
[2018-01-30 00:24:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states.
[2018-01-30 00:24:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions.
[2018-01-30 00:24:58,872 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 59
[2018-01-30 00:24:58,872 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:24:58,872 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions.
[2018-01-30 00:24:58,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-01-30 00:24:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions.
[2018-01-30 00:24:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-01-30 00:24:58,873 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:24:58,873 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:24:58,873 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:24:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash 616389298, now seen corresponding path program 1 times
[2018-01-30 00:24:58,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:24:58,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:24:58,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:58,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:58,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:24:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:58,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:24:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:24:59,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:24:59,258 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-30 00:24:59,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:24:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:24:59,300 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:24:59,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:59,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:24:59,359 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-30 00:24:59,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:59,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22
[2018-01-30 00:24:59,395 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:59,396 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:59,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-30 00:24:59,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21
[2018-01-30 00:24:59,456 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 27 treesize of output 25
[2018-01-30 00:24:59,459 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:59,460 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 22 treesize of output 29
[2018-01-30 00:24:59,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,476 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-30 00:24:59,478 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-30 00:24:59,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,489 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-30 00:24:59,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32
[2018-01-30 00:24:59,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16
[2018-01-30 00:24:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4
[2018-01-30 00:24:59,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20
[2018-01-30 00:24:59,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20
[2018-01-30 00:24:59,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:24:59,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27
[2018-01-30 00:24:59,617 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:59,617 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:59,618 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-30 00:24:59,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26
[2018-01-30 00:24:59,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33
[2018-01-30 00:24:59,685 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:59,688 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 22 treesize of output 14
[2018-01-30 00:24:59,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,710 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-30 00:24:59,712 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-30 00:24:59,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,722 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-30 00:24:59,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32
[2018-01-30 00:24:59,751 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 20 treesize of output 16
[2018-01-30 00:24:59,757 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 16 treesize of output 4
[2018-01-30 00:24:59,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,766 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-30 00:24:59,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26
[2018-01-30 00:24:59,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46
[2018-01-30 00:24:59,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34
[2018-01-30 00:24:59,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:24:59,895 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:24:59,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29
[2018-01-30 00:24:59,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-30 00:24:59,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:24:59,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:24:59,928 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:56
[2018-01-30 00:24:59,996 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 22 treesize of output 20
[2018-01-30 00:24:59,998 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-30 00:24:59,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:00,003 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-30 00:25:00,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:00,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:00,007 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-30 00:25:00,007 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3
[2018-01-30 00:25:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:00,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:00,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38
[2018-01-30 00:25:00,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-01-30 00:25:00,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-01-30 00:25:00,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406
[2018-01-30 00:25:00,060 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 38 states.
[2018-01-30 00:25:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:01,170 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions.
[2018-01-30 00:25:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-01-30 00:25:01,170 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 59
[2018-01-30 00:25:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:01,171 INFO L225 Difference]: With dead ends: 167
[2018-01-30 00:25:01,171 INFO L226 Difference]: Without dead ends: 157
[2018-01-30 00:25:01,172 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=626, Invalid=3280, Unknown=0, NotChecked=0, Total=3906
[2018-01-30 00:25:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2018-01-30 00:25:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149.
[2018-01-30 00:25:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states.
[2018-01-30 00:25:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions.
[2018-01-30 00:25:01,182 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 59
[2018-01-30 00:25:01,182 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:01,182 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions.
[2018-01-30 00:25:01,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-01-30 00:25:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions.
[2018-01-30 00:25:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-01-30 00:25:01,183 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:01,184 INFO L350 BasicCegarLoop]: trace histogram [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-30 00:25:01,184 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1286183915, now seen corresponding path program 1 times
[2018-01-30 00:25:01,184 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:01,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:01,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:01,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:01,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:01,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:01,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:01,643 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-30 00:25:01,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:01,683 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:01,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:01,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:01,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:01,811 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:01,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-01-30 00:25:01,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28
[2018-01-30 00:25:01,864 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-30 00:25:01,866 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-30 00:25:01,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,876 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-30 00:25:01,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40
[2018-01-30 00:25:01,950 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 45 treesize of output 41
[2018-01-30 00:25:01,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:25:01,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:01,959 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-30 00:25:01,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30
[2018-01-30 00:25:02,053 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 27 treesize of output 21
[2018-01-30 00:25:02,055 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:02,055 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-30 00:25:02,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:02,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:02,066 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-30 00:25:02,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:19
[2018-01-30 00:25:02,118 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:02,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15
[2018-01-30 00:25:02,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:02,123 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-30 00:25:02,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15
[2018-01-30 00:25:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-30 00:25:02,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:02,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32
[2018-01-30 00:25:02,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-01-30 00:25:02,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-01-30 00:25:02,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056
[2018-01-30 00:25:02,177 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 33 states.
[2018-01-30 00:25:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:03,396 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions.
[2018-01-30 00:25:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-01-30 00:25:03,396 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61
[2018-01-30 00:25:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:03,397 INFO L225 Difference]: With dead ends: 194
[2018-01-30 00:25:03,397 INFO L226 Difference]: Without dead ends: 193
[2018-01-30 00:25:03,398 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862
[2018-01-30 00:25:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2018-01-30 00:25:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 162.
[2018-01-30 00:25:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states.
[2018-01-30 00:25:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions.
[2018-01-30 00:25:03,406 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 61
[2018-01-30 00:25:03,406 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:03,406 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions.
[2018-01-30 00:25:03,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-01-30 00:25:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions.
[2018-01-30 00:25:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-01-30 00:25:03,407 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:03,407 INFO L350 BasicCegarLoop]: trace histogram [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-30 00:25:03,407 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1286183914, now seen corresponding path program 1 times
[2018-01-30 00:25:03,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:03,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:03,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:03,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:03,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:03,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:03,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:03,736 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-30 00:25:03,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:03,768 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:03,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:03,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:03,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:03,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,830 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:03,831 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:03,832 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-30 00:25:03,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22
[2018-01-30 00:25:03,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-30 00:25:03,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:03,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,863 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-30 00:25:03,865 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-30 00:25:03,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,874 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-30 00:25:03,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40
[2018-01-30 00:25:03,923 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-30 00:25:03,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 20 treesize of output 1
[2018-01-30 00:25:03,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41
[2018-01-30 00:25:03,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:25:03,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:03,951 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-30 00:25:03,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:28
[2018-01-30 00:25:04,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21
[2018-01-30 00:25:04,089 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:04,090 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-30 00:25:04,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:04,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:04,149 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 17 treesize of output 13
[2018-01-30 00:25:04,156 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:04,157 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-30 00:25:04,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:04,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:04,231 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-30 00:25:04,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:9
[2018-01-30 00:25:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-01-30 00:25:04,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:04,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24
[2018-01-30 00:25:04,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-01-30 00:25:04,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-01-30 00:25:04,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600
[2018-01-30 00:25:04,391 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 25 states.
[2018-01-30 00:25:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:05,453 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions.
[2018-01-30 00:25:05,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-01-30 00:25:05,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61
[2018-01-30 00:25:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:05,455 INFO L225 Difference]: With dead ends: 215
[2018-01-30 00:25:05,455 INFO L226 Difference]: Without dead ends: 212
[2018-01-30 00:25:05,455 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806
[2018-01-30 00:25:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2018-01-30 00:25:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 168.
[2018-01-30 00:25:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states.
[2018-01-30 00:25:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions.
[2018-01-30 00:25:05,467 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 61
[2018-01-30 00:25:05,468 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:05,468 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions.
[2018-01-30 00:25:05,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-01-30 00:25:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions.
[2018-01-30 00:25:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-01-30 00:25:05,469 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:05,469 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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]
[2018-01-30 00:25:05,469 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:05,469 INFO L82 PathProgramCache]: Analyzing trace with hash -62728431, now seen corresponding path program 1 times
[2018-01-30 00:25:05,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:05,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:05,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:05,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:05,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:05,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:05,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:05,850 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-30 00:25:05,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:05,879 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:05,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:05,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:05,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:05,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:05,934 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:05,935 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:05,935 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-30 00:25:05,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:05,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:05,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-01-30 00:25:05,946 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-30 00:25:05,948 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-30 00:25:05,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:05,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:05,957 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-30 00:25:05,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25
[2018-01-30 00:25:05,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-30 00:25:05,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:05,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22
[2018-01-30 00:25:06,015 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:06,016 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:06,016 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-30 00:25:06,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21
[2018-01-30 00:25:06,043 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 23 treesize of output 24
[2018-01-30 00:25:06,044 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-30 00:25:06,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,054 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-30 00:25:06,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32
[2018-01-30 00:25:06,159 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 79
[2018-01-30 00:25:06,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 67
[2018-01-30 00:25:06,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:06,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 38
[2018-01-30 00:25:06,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:06,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:25:06,224 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:67
[2018-01-30 00:25:06,296 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-30 00:25:06,298 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:06,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17
[2018-01-30 00:25:06,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:06,308 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-30 00:25:06,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:5
[2018-01-30 00:25:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:06,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:06,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 29
[2018-01-30 00:25:06,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states
[2018-01-30 00:25:06,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2018-01-30 00:25:06,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870
[2018-01-30 00:25:06,341 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand 30 states.
[2018-01-30 00:25:07,144 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 28
[2018-01-30 00:25:07,275 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 39 DAG size of output 27
[2018-01-30 00:25:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:07,726 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions.
[2018-01-30 00:25:07,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-01-30 00:25:07,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61
[2018-01-30 00:25:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:07,727 INFO L225 Difference]: With dead ends: 262
[2018-01-30 00:25:07,727 INFO L226 Difference]: Without dead ends: 261
[2018-01-30 00:25:07,728 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862
[2018-01-30 00:25:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2018-01-30 00:25:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 200.
[2018-01-30 00:25:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states.
[2018-01-30 00:25:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 211 transitions.
[2018-01-30 00:25:07,736 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 211 transitions. Word has length 61
[2018-01-30 00:25:07,736 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:07,736 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 211 transitions.
[2018-01-30 00:25:07,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states.
[2018-01-30 00:25:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 211 transitions.
[2018-01-30 00:25:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-01-30 00:25:07,737 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:07,737 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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]
[2018-01-30 00:25:07,737 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:07,737 INFO L82 PathProgramCache]: Analyzing trace with hash -62728430, now seen corresponding path program 1 times
[2018-01-30 00:25:07,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:07,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:07,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:07,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:07,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:07,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:08,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:08,259 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-30 00:25:08,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:08,293 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:08,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:08,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:08,369 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,370 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,370 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-30 00:25:08,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27
[2018-01-30 00:25:08,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-30 00:25:08,449 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-30 00:25:08,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,464 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-30 00:25:08,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:08,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,478 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-30 00:25:08,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45
[2018-01-30 00:25:08,574 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,578 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-30 00:25:08,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:08,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,595 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,598 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-30 00:25:08,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:08,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40
[2018-01-30 00:25:08,616 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,617 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,617 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,618 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-30 00:25:08,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38
[2018-01-30 00:25:08,715 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,719 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-30 00:25:08,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:08,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,742 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:08,746 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-30 00:25:08,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, 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-30 00:25:08,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,767 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-30 00:25:08,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:62
[2018-01-30 00:25:08,887 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 142 treesize of output 111
[2018-01-30 00:25:08,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1
[2018-01-30 00:25:08,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,914 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 53 treesize of output 54
[2018-01-30 00:25:08,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:25:08,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:08,930 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-30 00:25:08,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:67
[2018-01-30 00:25:09,061 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 61 treesize of output 46
[2018-01-30 00:25:09,063 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:09,064 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-30 00:25:09,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:09,072 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-30 00:25:09,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:09,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:09,086 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 17 treesize of output 13
[2018-01-30 00:25:09,088 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:09,089 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-30 00:25:09,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:09,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:09,099 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-30 00:25:09,099 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:88, output treesize:9
[2018-01-30 00:25:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:09,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:09,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38
[2018-01-30 00:25:09,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-01-30 00:25:09,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-01-30 00:25:09,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482
[2018-01-30 00:25:09,208 INFO L87 Difference]: Start difference. First operand 200 states and 211 transitions. Second operand 39 states.
[2018-01-30 00:25:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:12,277 INFO L93 Difference]: Finished difference Result 314 states and 329 transitions.
[2018-01-30 00:25:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-01-30 00:25:12,277 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61
[2018-01-30 00:25:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:12,279 INFO L225 Difference]: With dead ends: 314
[2018-01-30 00:25:12,279 INFO L226 Difference]: Without dead ends: 311
[2018-01-30 00:25:12,280 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=786, Invalid=4914, Unknown=0, NotChecked=0, Total=5700
[2018-01-30 00:25:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2018-01-30 00:25:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 208.
[2018-01-30 00:25:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states.
[2018-01-30 00:25:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions.
[2018-01-30 00:25:12,297 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 61
[2018-01-30 00:25:12,297 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:12,297 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions.
[2018-01-30 00:25:12,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-01-30 00:25:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions.
[2018-01-30 00:25:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-01-30 00:25:12,297 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:12,297 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:25:12,298 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1068204002, now seen corresponding path program 1 times
[2018-01-30 00:25:12,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:12,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:12,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:12,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:12,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:12,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:13,141 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-30 00:25:13,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:13,141 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-30 00:25:13,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:13,175 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:13,397 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-30 00:25:13,399 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-30 00:25:13,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:13,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:13,413 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-30 00:25:13,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:61
[2018-01-30 00:25:13,534 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:13,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 77
[2018-01-30 00:25:13,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 24 treesize of output 1
[2018-01-30 00:25:13,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:13,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:13,569 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-30 00:25:13,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:58
[2018-01-30 00:25:13,913 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 49 treesize of output 41
[2018-01-30 00:25:13,915 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:13,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29
[2018-01-30 00:25:13,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:13,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:13,930 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-30 00:25:13,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:31
[2018-01-30 00:25:14,065 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_10 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_10 1))) (and (not (= v_prenex_10 0)) (= (select |c_old(#valid)| v_prenex_10) 0) (= |c_#valid| (store (store (store .cse0 main_~p~7.base 1) v_prenex_10 0) main_~p~7.base 0)) (not (= 0 main_~p~7.base)) (= (select .cse0 main_~p~7.base) 0)))) is different from true
[2018-01-30 00:25:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-01-30 00:25:14,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:14,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43
[2018-01-30 00:25:14,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-01-30 00:25:14,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-01-30 00:25:14,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1629, Unknown=37, NotChecked=82, Total=1892
[2018-01-30 00:25:14,113 INFO L87 Difference]: Start difference. First operand 208 states and 219 transitions. Second operand 44 states.
[2018-01-30 00:25:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:16,609 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions.
[2018-01-30 00:25:16,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-01-30 00:25:16,609 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 66
[2018-01-30 00:25:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:16,610 INFO L225 Difference]: With dead ends: 216
[2018-01-30 00:25:16,610 INFO L226 Difference]: Without dead ends: 211
[2018-01-30 00:25:16,611 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=407, Invalid=3563, Unknown=66, NotChecked=124, Total=4160
[2018-01-30 00:25:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2018-01-30 00:25:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206.
[2018-01-30 00:25:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states.
[2018-01-30 00:25:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 216 transitions.
[2018-01-30 00:25:16,621 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 216 transitions. Word has length 66
[2018-01-30 00:25:16,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:16,621 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 216 transitions.
[2018-01-30 00:25:16,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-01-30 00:25:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 216 transitions.
[2018-01-30 00:25:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-01-30 00:25:16,622 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:16,622 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:25:16,622 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1604940365, now seen corresponding path program 1 times
[2018-01-30 00:25:16,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:16,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:16,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:16,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:16,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:16,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:16,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:16,964 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-30 00:25:16,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:16,995 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:16,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:16,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:16,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:16,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:17,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:17,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,050 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:17,051 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:17,051 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-30 00:25:17,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19
[2018-01-30 00:25:17,091 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-30 00:25:17,092 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-30 00:25:17,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,100 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-30 00:25:17,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31
[2018-01-30 00:25:17,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41
[2018-01-30 00:25:17,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:25:17,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,166 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-30 00:25:17,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:21
[2018-01-30 00:25:17,227 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 27 treesize of output 21
[2018-01-30 00:25:17,229 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:17,229 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-30 00:25:17,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,236 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-30 00:25:17,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5
[2018-01-30 00:25:17,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3
[2018-01-30 00:25:17,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:17,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7
[2018-01-30 00:25:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-30 00:25:17,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:17,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31
[2018-01-30 00:25:17,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-01-30 00:25:17,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-01-30 00:25:17,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992
[2018-01-30 00:25:17,345 INFO L87 Difference]: Start difference. First operand 206 states and 216 transitions. Second operand 32 states.
[2018-01-30 00:25:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:18,708 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions.
[2018-01-30 00:25:18,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-01-30 00:25:18,709 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68
[2018-01-30 00:25:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:18,710 INFO L225 Difference]: With dead ends: 234
[2018-01-30 00:25:18,710 INFO L226 Difference]: Without dead ends: 233
[2018-01-30 00:25:18,711 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=534, Invalid=2888, Unknown=0, NotChecked=0, Total=3422
[2018-01-30 00:25:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2018-01-30 00:25:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 200.
[2018-01-30 00:25:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states.
[2018-01-30 00:25:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 210 transitions.
[2018-01-30 00:25:18,721 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 210 transitions. Word has length 68
[2018-01-30 00:25:18,722 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:18,722 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 210 transitions.
[2018-01-30 00:25:18,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-01-30 00:25:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 210 transitions.
[2018-01-30 00:25:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-01-30 00:25:18,722 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:18,722 INFO L350 BasicCegarLoop]: trace histogram [3, 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]
[2018-01-30 00:25:18,723 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash -454428651, now seen corresponding path program 2 times
[2018-01-30 00:25:18,723 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:18,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:18,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:18,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:18,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:18,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:19,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:19,169 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-30 00:25:19,174 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-30 00:25:19,185 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:25:19,195 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:25:19,197 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-30 00:25:19,199 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:19,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 23 treesize of output 19
[2018-01-30 00:25:19,360 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 11
[2018-01-30 00:25:19,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:19,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:19,365 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-30 00:25:19,366 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 7
[2018-01-30 00:25:19,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:19,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:19,368 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-30 00:25:19,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7
[2018-01-30 00:25:19,412 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-30 00:25:19,413 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-30 00:25:19,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:19,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:19,414 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-30 00:25:19,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3
[2018-01-30 00:25:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-30 00:25:19,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:19,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34
[2018-01-30 00:25:19,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states
[2018-01-30 00:25:19,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2018-01-30 00:25:19,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122
[2018-01-30 00:25:19,459 INFO L87 Difference]: Start difference. First operand 200 states and 210 transitions. Second operand 34 states.
[2018-01-30 00:25:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:21,292 INFO L93 Difference]: Finished difference Result 271 states and 281 transitions.
[2018-01-30 00:25:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2018-01-30 00:25:21,314 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70
[2018-01-30 00:25:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:21,316 INFO L225 Difference]: With dead ends: 271
[2018-01-30 00:25:21,316 INFO L226 Difference]: Without dead ends: 213
[2018-01-30 00:25:21,317 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=758, Invalid=5562, Unknown=0, NotChecked=0, Total=6320
[2018-01-30 00:25:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2018-01-30 00:25:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189.
[2018-01-30 00:25:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states.
[2018-01-30 00:25:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions.
[2018-01-30 00:25:21,327 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 70
[2018-01-30 00:25:21,327 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:21,327 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions.
[2018-01-30 00:25:21,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2018-01-30 00:25:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions.
[2018-01-30 00:25:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-01-30 00:25:21,327 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:21,328 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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]
[2018-01-30 00:25:21,328 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash 765454912, now seen corresponding path program 1 times
[2018-01-30 00:25:21,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:21,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:21,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:21,329 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-30 00:25:21,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:21,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:22,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:22,116 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-30 00:25:22,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:22,151 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:22,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:22,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:22,223 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,224 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,224 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-30 00:25:22,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,235 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-30 00:25:22,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32
[2018-01-30 00:25:22,305 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-30 00:25:22,307 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-30 00:25:22,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,322 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-30 00:25:22,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:22,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,336 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-30 00:25:22,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:56
[2018-01-30 00:25:22,372 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-30 00:25:22,374 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 7
[2018-01-30 00:25:22,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45
[2018-01-30 00:25:22,461 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50
[2018-01-30 00:25:22,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 12 treesize of output 1
[2018-01-30 00:25:22,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:48
[2018-01-30 00:25:22,515 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,516 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,516 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,517 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-30 00:25:22,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,533 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 16 treesize of output 23
[2018-01-30 00:25:22,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:70
[2018-01-30 00:25:22,634 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,636 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,637 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 55 treesize of output 67
[2018-01-30 00:25:22,639 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-30 00:25:22,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,667 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-30 00:25:22,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:86
[2018-01-30 00:25:22,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,811 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:22,816 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 126 treesize of output 115
[2018-01-30 00:25:22,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:25:22,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:22,840 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-30 00:25:22,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:140, output treesize:95
[2018-01-30 00:25:23,224 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:23,230 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:23,231 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 38 treesize of output 37
[2018-01-30 00:25:23,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:23,296 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:23,297 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:23,298 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:23,299 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 74 treesize of output 70
[2018-01-30 00:25:23,301 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:23,308 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 41 treesize of output 39
[2018-01-30 00:25:23,310 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-30 00:25:23,328 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:23,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44
[2018-01-30 00:25:23,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:23,335 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:23,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30
[2018-01-30 00:25:23,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:23,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:25:23,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:25:23,374 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:129, output treesize:57
[2018-01-30 00:25:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:23,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:23,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45
[2018-01-30 00:25:23,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-01-30 00:25:23,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-01-30 00:25:23,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1877, Unknown=0, NotChecked=0, Total=2070
[2018-01-30 00:25:23,564 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand 46 states.
[2018-01-30 00:25:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:27,375 INFO L93 Difference]: Finished difference Result 285 states and 305 transitions.
[2018-01-30 00:25:27,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-01-30 00:25:27,375 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 73
[2018-01-30 00:25:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:27,376 INFO L225 Difference]: With dead ends: 285
[2018-01-30 00:25:27,376 INFO L226 Difference]: Without dead ends: 284
[2018-01-30 00:25:27,377 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=745, Invalid=4955, Unknown=0, NotChecked=0, Total=5700
[2018-01-30 00:25:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states.
[2018-01-30 00:25:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 193.
[2018-01-30 00:25:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states.
[2018-01-30 00:25:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions.
[2018-01-30 00:25:27,389 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 73
[2018-01-30 00:25:27,389 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:27,389 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions.
[2018-01-30 00:25:27,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-01-30 00:25:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions.
[2018-01-30 00:25:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-01-30 00:25:27,390 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:27,390 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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]
[2018-01-30 00:25:27,390 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash 765454913, now seen corresponding path program 1 times
[2018-01-30 00:25:27,390 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:27,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:27,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:27,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:27,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:27,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:28,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:28,343 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-30 00:25:28,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:28,377 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:28,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-30 00:25:28,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:28,455 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,456 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,456 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-30 00:25:28,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27
[2018-01-30 00:25:28,524 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-30 00:25:28,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:28,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-30 00:25:28,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, 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-30 00:25:28,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,554 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-30 00:25:28,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:45
[2018-01-30 00:25:28,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,672 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-30 00:25:28,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:28,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,694 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,697 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-30 00:25:28,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:28,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50
[2018-01-30 00:25:28,724 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,725 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,731 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,732 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-30 00:25:28,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 00:25:28,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45
[2018-01-30 00:25:28,815 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,816 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 27 treesize of output 35
[2018-01-30 00:25:28,818 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-30 00:25:28,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,836 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 30
[2018-01-30 00:25:28,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:28,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,854 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-30 00:25:28,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:71
[2018-01-30 00:25:28,951 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,956 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,959 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 157 treesize of output 126
[2018-01-30 00:25:28,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1
[2018-01-30 00:25:28,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:28,992 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:28,998 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 70 treesize of output 101
[2018-01-30 00:25:29,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 32 treesize of output 1
[2018-01-30 00:25:29,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:29,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:29,015 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-30 00:25:29,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:169, output treesize:79
[2018-01-30 00:25:29,330 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:29,331 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:29,332 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:29,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89
[2018-01-30 00:25:29,336 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:29,337 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:29,352 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 51
[2018-01-30 00:25:29,353 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-30 00:25:29,372 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:29,373 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 52 treesize of output 43
[2018-01-30 00:25:29,373 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-30 00:25:29,381 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-30 00:25:29,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33
[2018-01-30 00:25:29,398 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:29,398 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-30 00:25:29,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:29,404 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-30 00:25:29,404 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:29,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:29,415 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-30 00:25:29,415 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:124, output treesize:9
[2018-01-30 00:25:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:29,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:29,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 39
[2018-01-30 00:25:29,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states
[2018-01-30 00:25:29,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2018-01-30 00:25:29,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560
[2018-01-30 00:25:29,479 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand 40 states.
[2018-01-30 00:25:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:31,920 INFO L93 Difference]: Finished difference Result 301 states and 322 transitions.
[2018-01-30 00:25:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-01-30 00:25:31,921 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 73
[2018-01-30 00:25:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:31,922 INFO L225 Difference]: With dead ends: 301
[2018-01-30 00:25:31,922 INFO L226 Difference]: Without dead ends: 298
[2018-01-30 00:25:31,923 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=564, Invalid=4128, Unknown=0, NotChecked=0, Total=4692
[2018-01-30 00:25:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2018-01-30 00:25:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 201.
[2018-01-30 00:25:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states.
[2018-01-30 00:25:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 216 transitions.
[2018-01-30 00:25:31,943 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 216 transitions. Word has length 73
[2018-01-30 00:25:31,943 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:31,943 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 216 transitions.
[2018-01-30 00:25:31,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states.
[2018-01-30 00:25:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 216 transitions.
[2018-01-30 00:25:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-01-30 00:25:31,944 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:31,945 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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, 1]
[2018-01-30 00:25:31,945 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 43665797, now seen corresponding path program 1 times
[2018-01-30 00:25:31,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:31,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:31,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:31,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:31,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:31,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:25:32,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:32,468 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-30 00:25:32,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:32,501 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:32,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:32,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:32,581 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:32,582 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:32,582 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-30 00:25:32,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30
[2018-01-30 00:25:32,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-30 00:25:32,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:32,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-30 00:25:32,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 00:25:32,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,683 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-30 00:25:32,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:48
[2018-01-30 00:25:32,791 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:32,794 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-30 00:25:32,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17
[2018-01-30 00:25:32,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,823 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 14
[2018-01-30 00:25:32,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 19
[2018-01-30 00:25:32,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,845 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:32,848 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 53 treesize of output 60
[2018-01-30 00:25:32,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 18 treesize of output 23
[2018-01-30 00:25:32,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-30 00:25:32,870 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:107, output treesize:85
[2018-01-30 00:25:32,916 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:32,916 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:32,917 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:32,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 22 treesize of output 25
[2018-01-30 00:25:32,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:32,933 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-30 00:25:32,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:83
[2018-01-30 00:25:33,026 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,028 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,030 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 62 treesize of output 74
[2018-01-30 00:25:33,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 22 treesize of output 18
[2018-01-30 00:25:33,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,070 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 43
[2018-01-30 00:25:33,072 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,073 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 34 treesize of output 53
[2018-01-30 00:25:33,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,098 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,101 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 51 treesize of output 58
[2018-01-30 00:25:33,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:33,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-30 00:25:33,126 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:128, output treesize:85
[2018-01-30 00:25:33,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 74
[2018-01-30 00:25:33,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:33,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,326 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 251 treesize of output 233
[2018-01-30 00:25:33,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1
[2018-01-30 00:25:33,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,359 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,363 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,366 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 164 treesize of output 143
[2018-01-30 00:25:33,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1
[2018-01-30 00:25:33,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-30 00:25:33,392 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:282, output treesize:122
[2018-01-30 00:25:33,555 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,561 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:33,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 93
[2018-01-30 00:25:33,570 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 42
[2018-01-30 00:25:33,571 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-30 00:25:33,588 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:33,588 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 52 treesize of output 40
[2018-01-30 00:25:33,588 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,592 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:33,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54
[2018-01-30 00:25:33,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:33,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:25:33,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 52
[2018-01-30 00:25:33,641 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:33,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21
[2018-01-30 00:25:33,642 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 52
[2018-01-30 00:25:33,653 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:33,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21
[2018-01-30 00:25:33,654 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,662 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:25:33,686 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:143, output treesize:51
[2018-01-30 00:25:33,790 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 22 treesize of output 20
[2018-01-30 00:25:33,791 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-30 00:25:33,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,795 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-30 00:25:33,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:33,800 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3
[2018-01-30 00:25:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-30 00:25:33,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:33,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44
[2018-01-30 00:25:33,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-01-30 00:25:33,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-01-30 00:25:33,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892
[2018-01-30 00:25:33,876 INFO L87 Difference]: Start difference. First operand 201 states and 216 transitions. Second operand 44 states.
[2018-01-30 00:25:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:38,140 INFO L93 Difference]: Finished difference Result 312 states and 332 transitions.
[2018-01-30 00:25:38,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-01-30 00:25:38,140 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 75
[2018-01-30 00:25:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:38,141 INFO L225 Difference]: With dead ends: 312
[2018-01-30 00:25:38,141 INFO L226 Difference]: Without dead ends: 290
[2018-01-30 00:25:38,142 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=869, Invalid=6441, Unknown=0, NotChecked=0, Total=7310
[2018-01-30 00:25:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2018-01-30 00:25:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 238.
[2018-01-30 00:25:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states.
[2018-01-30 00:25:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 263 transitions.
[2018-01-30 00:25:38,166 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 263 transitions. Word has length 75
[2018-01-30 00:25:38,166 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:38,167 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 263 transitions.
[2018-01-30 00:25:38,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-01-30 00:25:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 263 transitions.
[2018-01-30 00:25:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-01-30 00:25:38,167 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:38,168 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:25:38,168 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash -769217989, now seen corresponding path program 2 times
[2018-01-30 00:25:38,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:38,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:38,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:38,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:25:38,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:38,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:38,910 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-30 00:25:38,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:38,910 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-30 00:25:38,915 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-30 00:25:38,925 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:25:38,937 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:25:38,942 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-30 00:25:38,946 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:38,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:38,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:38,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:38,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:38,961 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:38,962 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:38,962 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-30 00:25:38,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:38,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:38,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-01-30 00:25:38,973 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-30 00:25:38,975 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-30 00:25:38,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:38,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:38,982 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-30 00:25:38,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25
[2018-01-30 00:25:39,005 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-30 00:25:39,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-30 00:25:39,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22
[2018-01-30 00:25:39,022 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,023 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-01-30 00:25:39,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31
[2018-01-30 00:25:39,090 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 23 treesize of output 24
[2018-01-30 00:25:39,092 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-30 00:25:39,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,107 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-30 00:25:39,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48
[2018-01-30 00:25:39,222 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,235 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 85 treesize of output 88
[2018-01-30 00:25:39,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84
[2018-01-30 00:25:39,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,272 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 50 treesize of output 46
[2018-01-30 00:25:39,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:39,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:39,304 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-30 00:25:39,304 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:93, output treesize:118
[2018-01-30 00:25:39,359 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,360 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,361 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,362 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 50 treesize of output 70
[2018-01-30 00:25:39,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,394 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,394 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,395 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,396 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 89 treesize of output 125
[2018-01-30 00:25:39,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,428 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 2 xjuncts.
[2018-01-30 00:25:39,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:140, output treesize:172
[2018-01-30 00:25:39,575 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,578 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 71 treesize of output 72
[2018-01-30 00:25:39,579 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-30 00:25:39,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,624 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:39,636 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 126 treesize of output 121
[2018-01-30 00:25:39,639 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 137 treesize of output 136
[2018-01-30 00:25:39,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:39,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 78
[2018-01-30 00:25:39,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:39,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:25:39,805 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 3 xjuncts.
[2018-01-30 00:25:39,806 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:198, output treesize:284
[2018-01-30 00:25:40,075 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 136 treesize of output 103
[2018-01-30 00:25:40,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1
[2018-01-30 00:25:40,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:40,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:40,131 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 239 treesize of output 149
[2018-01-30 00:25:40,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1
[2018-01-30 00:25:40,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:40,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:40,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:25:40,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:376, output treesize:256
[2018-01-30 00:25:40,306 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 84 treesize of output 59
[2018-01-30 00:25:40,309 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:25:40,310 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 35 treesize of output 23
[2018-01-30 00:25:40,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:40,321 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-30 00:25:40,322 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-30 00:25:40,328 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-30 00:25:40,335 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-30 00:25:40,335 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:89, output treesize:28
[2018-01-30 00:25:40,461 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-30 00:25:40,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:40,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 42
[2018-01-30 00:25:40,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states
[2018-01-30 00:25:40,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2018-01-30 00:25:40,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1612, Unknown=0, NotChecked=0, Total=1806
[2018-01-30 00:25:40,483 INFO L87 Difference]: Start difference. First operand 238 states and 263 transitions. Second operand 43 states.
[2018-01-30 00:25:41,801 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 122 DAG size of output 66
[2018-01-30 00:25:42,667 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 124 DAG size of output 72
[2018-01-30 00:25:42,870 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 139 DAG size of output 84
[2018-01-30 00:25:43,111 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 144 DAG size of output 104
[2018-01-30 00:25:43,331 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 119 DAG size of output 84
[2018-01-30 00:25:46,446 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 100 DAG size of output 88
[2018-01-30 00:25:47,109 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 96 DAG size of output 90
[2018-01-30 00:25:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:25:51,081 INFO L93 Difference]: Finished difference Result 491 states and 520 transitions.
[2018-01-30 00:25:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states.
[2018-01-30 00:25:51,082 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 75
[2018-01-30 00:25:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:25:51,083 INFO L225 Difference]: With dead ends: 491
[2018-01-30 00:25:51,083 INFO L226 Difference]: Without dead ends: 490
[2018-01-30 00:25:51,084 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2550, Invalid=13706, Unknown=0, NotChecked=0, Total=16256
[2018-01-30 00:25:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states.
[2018-01-30 00:25:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 284.
[2018-01-30 00:25:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states.
[2018-01-30 00:25:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 312 transitions.
[2018-01-30 00:25:51,104 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 312 transitions. Word has length 75
[2018-01-30 00:25:51,105 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:25:51,105 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 312 transitions.
[2018-01-30 00:25:51,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states.
[2018-01-30 00:25:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 312 transitions.
[2018-01-30 00:25:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-01-30 00:25:51,105 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:25:51,105 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:25:51,105 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:25:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash -769217988, now seen corresponding path program 2 times
[2018-01-30 00:25:51,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:25:51,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:25:51,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:51,106 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-30 00:25:51,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:25:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:25:51,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:25:52,213 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-30 00:25:52,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:25:52,251 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-30 00:25:52,258 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-30 00:25:52,269 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:25:52,283 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:25:52,289 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-30 00:25:52,293 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:25:52,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:52,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:25:52,342 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,343 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,343 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-30 00:25:52,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27
[2018-01-30 00:25:52,425 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-30 00:25:52,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 00:25:52,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,440 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-30 00:25:52,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-30 00:25:52,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,451 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-30 00:25:52,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:45
[2018-01-30 00:25:52,554 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,557 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-30 00:25:52,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:52,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,572 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,574 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-30 00:25:52,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 16 treesize of output 15
[2018-01-30 00:25:52,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40
[2018-01-30 00:25:52,587 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,588 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,589 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,589 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-30 00:25:52,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:57
[2018-01-30 00:25:52,674 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,677 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 46 treesize of output 47
[2018-01-30 00:25:52,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, 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-30 00:25:52,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,705 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,708 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-30 00:25:52,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:52,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,730 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-30 00:25:52,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:87
[2018-01-30 00:25:52,896 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,899 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-30 00:25:52,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 22 treesize of output 21
[2018-01-30 00:25:52,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,926 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,927 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:52,932 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 104 treesize of output 104
[2018-01-30 00:25:52,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:52,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:52,960 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-30 00:25:52,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:109
[2018-01-30 00:25:53,008 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 25
[2018-01-30 00:25:53,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,029 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,030 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,031 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,031 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,032 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-30 00:25:53,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,047 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-30 00:25:53,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:111
[2018-01-30 00:25:53,161 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,164 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 32
[2018-01-30 00:25:53,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:25:53,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,192 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,193 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:25:53,198 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 119 treesize of output 115
[2018-01-30 00:25:53,200 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-30 00:25:53,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,233 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-30 00:25:53,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:137, output treesize:135
[2018-01-30 00:25:53,430 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 71 treesize of output 72
[2018-01-30 00:25:53,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 1
[2018-01-30 00:25:53,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,464 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 210 treesize of output 138
[2018-01-30 00:25:53,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 1
[2018-01-30 00:25:53,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,492 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-30 00:25:53,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:288, output treesize:162
[2018-01-30 00:25:53,629 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 154 treesize of output 85
[2018-01-30 00:25:53,631 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 40 treesize of output 24
[2018-01-30 00:25:53,631 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-30 00:25:53,644 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 27 treesize of output 15
[2018-01-30 00:25:53,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,653 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-30 00:25:53,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,659 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-30 00:25:53,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11
[2018-01-30 00:25:53,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-01-30 00:25:53,671 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:25:53,680 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-30 00:25:53,680 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:173, output treesize:18
[2018-01-30 00:25:53,814 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-30 00:25:53,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:25:53,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 47
[2018-01-30 00:25:53,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states
[2018-01-30 00:25:53,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2018-01-30 00:25:53,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2108, Unknown=0, NotChecked=0, Total=2256
[2018-01-30 00:25:53,836 INFO L87 Difference]: Start difference. First operand 284 states and 312 transitions. Second operand 48 states.
[2018-01-30 00:25:55,534 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 116 DAG size of output 77
[2018-01-30 00:25:55,738 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 138 DAG size of output 95
[2018-01-30 00:25:56,660 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 128 DAG size of output 81
[2018-01-30 00:25:56,925 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 149 DAG size of output 106
[2018-01-30 00:25:57,189 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 164 DAG size of output 122
[2018-01-30 00:25:59,786 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 141 DAG size of output 100
[2018-01-30 00:25:59,955 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 131 DAG size of output 95
[2018-01-30 00:26:00,539 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 139 DAG size of output 104
[2018-01-30 00:26:02,896 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 100 DAG size of output 76
[2018-01-30 00:26:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:26:03,789 INFO L93 Difference]: Finished difference Result 539 states and 574 transitions.
[2018-01-30 00:26:03,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2018-01-30 00:26:03,790 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 75
[2018-01-30 00:26:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:26:03,791 INFO L225 Difference]: With dead ends: 539
[2018-01-30 00:26:03,791 INFO L226 Difference]: Without dead ends: 536
[2018-01-30 00:26:03,792 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3905 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2044, Invalid=12718, Unknown=0, NotChecked=0, Total=14762
[2018-01-30 00:26:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states.
[2018-01-30 00:26:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 292.
[2018-01-30 00:26:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states.
[2018-01-30 00:26:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 320 transitions.
[2018-01-30 00:26:03,818 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 320 transitions. Word has length 75
[2018-01-30 00:26:03,819 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:26:03,819 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 320 transitions.
[2018-01-30 00:26:03,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states.
[2018-01-30 00:26:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 320 transitions.
[2018-01-30 00:26:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2018-01-30 00:26:03,820 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:26:03,820 INFO L350 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:26:03,820 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:26:03,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1014824036, now seen corresponding path program 2 times
[2018-01-30 00:26:03,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:26:03,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:26:03,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:03,821 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-30 00:26:03,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:26:03,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:26:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:04,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:26:04,910 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-30 00:26:04,915 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-30 00:26:04,926 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:26:04,940 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:26:04,947 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-30 00:26:04,951 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:26:04,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:04,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:04,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:04,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:26:04,967 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:04,968 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:04,968 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-30 00:26:04,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:04,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:04,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27
[2018-01-30 00:26:05,047 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-30 00:26:05,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:05,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,063 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-30 00:26:05,064 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-30 00:26:05,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,075 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-30 00:26:05,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45
[2018-01-30 00:26:05,197 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,200 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-30 00:26:05,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-30 00:26:05,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,220 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,223 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-30 00:26:05,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:05,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50
[2018-01-30 00:26:05,251 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,252 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,252 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,253 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-30 00:26:05,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,265 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 6 treesize of output 5
[2018-01-30 00:26:05,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45
[2018-01-30 00:26:05,358 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,359 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 23 treesize of output 35
[2018-01-30 00:26:05,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, 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-30 00:26:05,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,381 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,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, 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 30
[2018-01-30 00:26:05,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 16 treesize of output 15
[2018-01-30 00:26:05,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,401 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-30 00:26:05,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:71
[2018-01-30 00:26:05,539 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 31 treesize of output 18
[2018-01-30 00:26:05,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, 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-30 00:26:05,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,565 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,567 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,572 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 183 treesize of output 146
[2018-01-30 00:26:05,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:26:05,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,605 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,612 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 81 treesize of output 112
[2018-01-30 00:26:05,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 32 treesize of output 1
[2018-01-30 00:26:05,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-30 00:26:05,635 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:212, output treesize:108
[2018-01-30 00:26:05,767 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,769 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 43 treesize of output 33
[2018-01-30 00:26:05,771 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 7
[2018-01-30 00:26:05,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,781 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:05,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-30 00:26:05,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:05,802 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-30 00:26:05,802 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:119, output treesize:83
[2018-01-30 00:26:05,976 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,976 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,977 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:05,977 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:05,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74
[2018-01-30 00:26:05,981 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:05,994 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 38 treesize of output 32
[2018-01-30 00:26:05,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:06,001 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:06,001 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 30 treesize of output 22
[2018-01-30 00:26:06,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:06,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:06,013 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-30 00:26:06,013 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:19
[2018-01-30 00:26:06,157 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-30 00:26:06,162 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 11 treesize of output 8
[2018-01-30 00:26:06,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:06,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:06,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:06,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31
[2018-01-30 00:26:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:06,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:26:06,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 50
[2018-01-30 00:26:06,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states
[2018-01-30 00:26:06,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2018-01-30 00:26:06,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2322, Unknown=0, NotChecked=0, Total=2450
[2018-01-30 00:26:06,331 INFO L87 Difference]: Start difference. First operand 292 states and 320 transitions. Second operand 50 states.
[2018-01-30 00:26:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:26:10,531 INFO L93 Difference]: Finished difference Result 348 states and 372 transitions.
[2018-01-30 00:26:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-01-30 00:26:10,531 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 85
[2018-01-30 00:26:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:26:10,532 INFO L225 Difference]: With dead ends: 348
[2018-01-30 00:26:10,533 INFO L226 Difference]: Without dead ends: 280
[2018-01-30 00:26:10,534 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=661, Invalid=6821, Unknown=0, NotChecked=0, Total=7482
[2018-01-30 00:26:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states.
[2018-01-30 00:26:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 261.
[2018-01-30 00:26:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states.
[2018-01-30 00:26:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 278 transitions.
[2018-01-30 00:26:10,564 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 278 transitions. Word has length 85
[2018-01-30 00:26:10,565 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:26:10,565 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 278 transitions.
[2018-01-30 00:26:10,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states.
[2018-01-30 00:26:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 278 transitions.
[2018-01-30 00:26:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2018-01-30 00:26:10,565 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:26:10,565 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1]
[2018-01-30 00:26:10,566 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:26:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash -714957195, now seen corresponding path program 1 times
[2018-01-30 00:26:10,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:26:10,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:26:10,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:10,567 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-30 00:26:10,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:26:10,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:26:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-01-30 00:26:11,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:26:11,014 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-30 00:26:11,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:26:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:26:11,051 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:26:11,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:11,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:26:11,122 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,123 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,123 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-30 00:26:11,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17
[2018-01-30 00:26:11,142 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-30 00:26:11,144 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-30 00:26:11,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,156 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-30 00:26:11,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-30 00:26:11,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,168 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-30 00:26:11,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34
[2018-01-30 00:26:11,224 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,227 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-30 00:26:11,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:11,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,241 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,244 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-30 00:26:11,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:11,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31
[2018-01-30 00:26:11,256 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,257 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,257 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-30 00:26:11,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30
[2018-01-30 00:26:11,309 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,312 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 29 treesize of output 30
[2018-01-30 00:26:11,314 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-30 00:26:11,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,333 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:11,336 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-30 00:26:11,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:11,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,353 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-30 00:26:11,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:48
[2018-01-30 00:26:11,470 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 102
[2018-01-30 00:26:11,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 97
[2018-01-30 00:26:11,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,507 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 86
[2018-01-30 00:26:11,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:11,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:11,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52
[2018-01-30 00:26:11,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21
[2018-01-30 00:26:11,555 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,561 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,566 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 86 treesize of output 73
[2018-01-30 00:26:11,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1
[2018-01-30 00:26:11,568 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,573 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,590 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 2 xjuncts.
[2018-01-30 00:26:11,590 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:139, output treesize:78
[2018-01-30 00:26:11,695 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 27 treesize of output 21
[2018-01-30 00:26:11,696 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:11,697 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-30 00:26:11,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,707 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 17 treesize of output 13
[2018-01-30 00:26:11,709 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:11,709 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-30 00:26:11,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:11,717 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-30 00:26:11,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:9
[2018-01-30 00:26:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-01-30 00:26:11,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:26:11,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35
[2018-01-30 00:26:11,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states
[2018-01-30 00:26:11,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2018-01-30 00:26:11,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260
[2018-01-30 00:26:11,807 INFO L87 Difference]: Start difference. First operand 261 states and 278 transitions. Second operand 36 states.
[2018-01-30 00:26:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:26:14,026 INFO L93 Difference]: Finished difference Result 296 states and 311 transitions.
[2018-01-30 00:26:14,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-30 00:26:14,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 87
[2018-01-30 00:26:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:26:14,027 INFO L225 Difference]: With dead ends: 296
[2018-01-30 00:26:14,027 INFO L226 Difference]: Without dead ends: 293
[2018-01-30 00:26:14,028 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=636, Invalid=3920, Unknown=0, NotChecked=0, Total=4556
[2018-01-30 00:26:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states.
[2018-01-30 00:26:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 267.
[2018-01-30 00:26:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states.
[2018-01-30 00:26:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 284 transitions.
[2018-01-30 00:26:14,050 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 284 transitions. Word has length 87
[2018-01-30 00:26:14,050 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:26:14,050 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 284 transitions.
[2018-01-30 00:26:14,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states.
[2018-01-30 00:26:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 284 transitions.
[2018-01-30 00:26:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2018-01-30 00:26:14,050 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:26:14,051 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:26:14,051 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:26:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1725845098, now seen corresponding path program 3 times
[2018-01-30 00:26:14,051 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:26:14,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:26:14,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:14,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:26:14,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:26:14,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:26:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:15,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:26:15,446 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-30 00:26:15,451 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-01-30 00:26:15,463 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-30 00:26:15,470 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-30 00:26:15,483 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-30 00:26:15,497 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-30 00:26:15,501 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-30 00:26:15,506 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:26:15,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:15,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:26:15,543 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:15,543 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:15,544 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-30 00:26:15,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,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, 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-30 00:26:15,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32
[2018-01-30 00:26:15,666 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-30 00:26:15,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-30 00:26:15,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,693 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-30 00:26:15,696 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-30 00:26:15,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,722 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-30 00:26:15,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56
[2018-01-30 00:26:15,774 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-30 00:26:15,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-01-30 00:26:15,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45
[2018-01-30 00:26:15,880 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:15,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50
[2018-01-30 00:26:15,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:15,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:41
[2018-01-30 00:26:15,947 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:15,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-30 00:26:15,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,964 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:15,965 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:15,966 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:15,966 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-30 00:26:15,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:15,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51
[2018-01-30 00:26:16,078 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 14
[2018-01-30 00:26:16,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:16,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,099 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,101 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,102 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-30 00:26:16,104 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-30 00:26:16,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,129 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-30 00:26:16,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:71
[2018-01-30 00:26:16,184 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 23 treesize of output 11
[2018-01-30 00:26:16,185 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-30 00:26:16,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:68
[2018-01-30 00:26:16,317 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,318 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,319 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,320 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,325 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 77 treesize of output 93
[2018-01-30 00:26:16,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 12 treesize of output 1
[2018-01-30 00:26:16,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:86, output treesize:68
[2018-01-30 00:26:16,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 44
[2018-01-30 00:26:16,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:76
[2018-01-30 00:26:16,503 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 18
[2018-01-30 00:26:16,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:16,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,523 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,524 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,524 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,525 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,529 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 92 treesize of output 104
[2018-01-30 00:26:16,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-30 00:26:16,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,557 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-30 00:26:16,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:101
[2018-01-30 00:26:16,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 11
[2018-01-30 00:26:16,619 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-30 00:26:16,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:129, output treesize:102
[2018-01-30 00:26:16,753 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 35 treesize of output 20
[2018-01-30 00:26:16,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:16,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:16,773 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,781 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:16,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 151 treesize of output 142
[2018-01-30 00:26:16,807 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6
[2018-01-30 00:26:16,833 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 169
[2018-01-30 00:26:16,834 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-30 00:26:16,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 108
[2018-01-30 00:26:16,957 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:17,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:17,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:17,064 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:170, output treesize:249
[2018-01-30 00:26:17,931 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:17,932 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:17,934 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:17,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, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 168
[2018-01-30 00:26:17,942 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 150 treesize of output 143
[2018-01-30 00:26:17,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,007 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 136 treesize of output 128
[2018-01-30 00:26:18,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,050 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 128 treesize of output 123
[2018-01-30 00:26:18,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:18,152 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,153 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,154 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,155 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 166 treesize of output 186
[2018-01-30 00:26:18,160 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 12 treesize of output 4
[2018-01-30 00:26:18,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,176 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts.
[2018-01-30 00:26:18,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:307, output treesize:380
[2018-01-30 00:26:18,584 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,585 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 142 treesize of output 131
[2018-01-30 00:26:18,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,646 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,647 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 140 treesize of output 109
[2018-01-30 00:26:18,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,691 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,691 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,692 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,693 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,693 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,694 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85
[2018-01-30 00:26:18,707 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 53
[2018-01-30 00:26:18,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,718 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:18,718 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 29 treesize of output 21
[2018-01-30 00:26:18,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,725 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-30 00:26:18,725 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,741 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,743 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,743 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,744 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,745 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,747 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,747 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:18,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 98
[2018-01-30 00:26:18,766 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 85
[2018-01-30 00:26:18,768 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,810 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:18,810 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 71 treesize of output 61
[2018-01-30 00:26:18,810 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,834 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 33 treesize of output 31
[2018-01-30 00:26:18,835 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,854 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:18,855 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 27 treesize of output 21
[2018-01-30 00:26:18,855 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,876 INFO L267 ElimStorePlain]: Start of recursive call 8: 7 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:18,884 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 12 variables, input treesize:419, output treesize:5
[2018-01-30 00:26:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:18,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:26:18,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 56
[2018-01-30 00:26:18,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states
[2018-01-30 00:26:18,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants.
[2018-01-30 00:26:18,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=3028, Unknown=3, NotChecked=0, Total=3192
[2018-01-30 00:26:18,959 INFO L87 Difference]: Start difference. First operand 267 states and 284 transitions. Second operand 57 states.
[2018-01-30 00:26:20,676 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 126 DAG size of output 74
[2018-01-30 00:26:21,178 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 119 DAG size of output 86
[2018-01-30 00:26:21,632 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 140 DAG size of output 70
[2018-01-30 00:26:21,965 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 145 DAG size of output 78
[2018-01-30 00:26:22,185 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 160 DAG size of output 84
[2018-01-30 00:26:23,271 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 168 DAG size of output 65
[2018-01-30 00:26:24,005 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 116 DAG size of output 73
[2018-01-30 00:26:24,554 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 165 DAG size of output 61
[2018-01-30 00:26:24,768 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 169 DAG size of output 65
[2018-01-30 00:26:25,051 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 170 DAG size of output 66
[2018-01-30 00:26:25,307 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 168 DAG size of output 64
[2018-01-30 00:26:25,659 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 209 DAG size of output 124
[2018-01-30 00:26:26,044 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 229 DAG size of output 162
[2018-01-30 00:26:26,301 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 190 DAG size of output 127
[2018-01-30 00:26:26,880 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 197 DAG size of output 136
[2018-01-30 00:26:27,411 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 208 DAG size of output 146
[2018-01-30 00:26:27,796 WARN L146 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 202 DAG size of output 138
[2018-01-30 00:26:28,080 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 201 DAG size of output 141
[2018-01-30 00:26:28,396 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 197 DAG size of output 136
[2018-01-30 00:26:28,782 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 140 DAG size of output 134
[2018-01-30 00:26:29,159 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 181 DAG size of output 138
[2018-01-30 00:26:29,712 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 143 DAG size of output 137
[2018-01-30 00:26:30,124 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 129 DAG size of output 61
[2018-01-30 00:26:31,639 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 139 DAG size of output 79
[2018-01-30 00:26:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:26:31,796 INFO L93 Difference]: Finished difference Result 401 states and 418 transitions.
[2018-01-30 00:26:31,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states.
[2018-01-30 00:26:31,796 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 87
[2018-01-30 00:26:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:26:31,797 INFO L225 Difference]: With dead ends: 401
[2018-01-30 00:26:31,798 INFO L226 Difference]: Without dead ends: 400
[2018-01-30 00:26:31,798 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4311 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1858, Invalid=15427, Unknown=7, NotChecked=0, Total=17292
[2018-01-30 00:26:31,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states.
[2018-01-30 00:26:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 297.
[2018-01-30 00:26:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states.
[2018-01-30 00:26:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 316 transitions.
[2018-01-30 00:26:31,840 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 316 transitions. Word has length 87
[2018-01-30 00:26:31,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:26:31,840 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 316 transitions.
[2018-01-30 00:26:31,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states.
[2018-01-30 00:26:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 316 transitions.
[2018-01-30 00:26:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2018-01-30 00:26:31,842 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:26:31,842 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:26:31,842 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:26:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1725845099, now seen corresponding path program 2 times
[2018-01-30 00:26:31,842 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:26:31,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:26:31,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:31,843 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-30 00:26:31,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:26:31,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:26:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:33,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:26:33,240 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-30 00:26:33,245 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-30 00:26:33,259 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:26:33,282 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:26:33,297 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-30 00:26:33,303 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:26:33,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-30 00:26:33,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:26:33,320 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:33,321 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:33,321 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-30 00:26:33,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27
[2018-01-30 00:26:33,494 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-30 00:26:33,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:33,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,520 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-30 00:26:33,522 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-30 00:26:33,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,546 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-30 00:26:33,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:45
[2018-01-30 00:26:33,792 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:33,795 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-30 00:26:33,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-30 00:26:33,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,857 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:33,861 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-30 00:26:33,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:33,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50
[2018-01-30 00:26:33,894 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:33,895 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:33,896 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:33,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 40
[2018-01-30 00:26:33,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:33,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:61
[2018-01-30 00:26:34,039 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,041 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 34 treesize of output 46
[2018-01-30 00:26:34,043 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-30 00:26:34,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,064 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,067 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 30
[2018-01-30 00:26:34,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:34,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,087 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-30 00:26:34,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:81
[2018-01-30 00:26:34,268 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,269 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,270 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,271 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,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, 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 116
[2018-01-30 00:26:34,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 00:26:34,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,306 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,311 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 38 treesize of output 69
[2018-01-30 00:26:34,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:34,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:134, output treesize:84
[2018-01-30 00:26:34,379 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,380 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,380 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,381 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,382 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,382 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 37 treesize of output 73
[2018-01-30 00:26:34,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:101
[2018-01-30 00:26:34,500 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,501 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,501 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,507 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 67
[2018-01-30 00:26:34,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:34,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,539 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,540 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,541 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,541 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,546 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 117 treesize of output 125
[2018-01-30 00:26:34,548 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-30 00:26:34,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,581 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-30 00:26:34,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:111
[2018-01-30 00:26:34,792 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,793 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,803 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 267 treesize of output 181
[2018-01-30 00:26:34,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 1
[2018-01-30 00:26:34,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,839 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:34,845 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 123
[2018-01-30 00:26:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 1
[2018-01-30 00:26:34,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:34,866 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-30 00:26:34,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:284, output treesize:158
[2018-01-30 00:26:35,274 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,275 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:35,277 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:35,279 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 167 treesize of output 124
[2018-01-30 00:26:35,282 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,287 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 56
[2018-01-30 00:26:35,288 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-30 00:26:35,311 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,312 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 67 treesize of output 57
[2018-01-30 00:26:35,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,315 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,320 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 2 case distinctions, treesize of input 73 treesize of output 71
[2018-01-30 00:26:35,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:35,355 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 60 treesize of output 48
[2018-01-30 00:26:35,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,357 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 60 treesize of output 48
[2018-01-30 00:26:35,357 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,373 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-30 00:26:35,398 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 52 treesize of output 44
[2018-01-30 00:26:35,400 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,400 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-30 00:26:35,400 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,409 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,409 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-30 00:26:35,410 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,418 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 52 treesize of output 44
[2018-01-30 00:26:35,420 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,421 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-30 00:26:35,421 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,430 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:35,430 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-30 00:26:35,430 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,437 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:35,455 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-30 00:26:35,455 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:191, output treesize:9
[2018-01-30 00:26:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:35,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:26:35,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 54
[2018-01-30 00:26:35,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states
[2018-01-30 00:26:35,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants.
[2018-01-30 00:26:35,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2809, Unknown=0, NotChecked=0, Total=2970
[2018-01-30 00:26:35,623 INFO L87 Difference]: Start difference. First operand 297 states and 316 transitions. Second operand 55 states.
[2018-01-30 00:26:38,167 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 103 DAG size of output 77
[2018-01-30 00:26:38,438 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 129 DAG size of output 91
[2018-01-30 00:26:38,681 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 139 DAG size of output 104
[2018-01-30 00:26:40,451 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 161 DAG size of output 144
[2018-01-30 00:26:40,621 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 123 DAG size of output 108
[2018-01-30 00:26:40,824 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 126 DAG size of output 110
[2018-01-30 00:26:41,046 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 137 DAG size of output 121
[2018-01-30 00:26:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:26:44,199 INFO L93 Difference]: Finished difference Result 416 states and 434 transitions.
[2018-01-30 00:26:44,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2018-01-30 00:26:44,199 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 87
[2018-01-30 00:26:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:26:44,200 INFO L225 Difference]: With dead ends: 416
[2018-01-30 00:26:44,200 INFO L226 Difference]: Without dead ends: 413
[2018-01-30 00:26:44,201 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1324, Invalid=12956, Unknown=0, NotChecked=0, Total=14280
[2018-01-30 00:26:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2018-01-30 00:26:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 305.
[2018-01-30 00:26:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states.
[2018-01-30 00:26:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 324 transitions.
[2018-01-30 00:26:44,229 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 324 transitions. Word has length 87
[2018-01-30 00:26:44,229 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:26:44,229 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 324 transitions.
[2018-01-30 00:26:44,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states.
[2018-01-30 00:26:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 324 transitions.
[2018-01-30 00:26:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2018-01-30 00:26:44,230 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-30 00:26:44,230 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:26:44,230 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]===
[2018-01-30 00:26:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash -439334097, now seen corresponding path program 2 times
[2018-01-30 00:26:44,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:26:44,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:26:44,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:44,231 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-30 00:26:44,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:26:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:26:44,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:26:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:45,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-30 00:26:45,201 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-30 00:26:45,206 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-30 00:26:45,217 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:26:45,232 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-30 00:26:45,238 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-30 00:26:45,241 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-30 00:26:45,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-30 00:26:45,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-30 00:26:45,297 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,298 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,298 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-30 00:26:45,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18
[2018-01-30 00:26:45,308 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-30 00:26:45,309 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-30 00:26:45,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,318 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-30 00:26:45,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29
[2018-01-30 00:26:45,364 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,366 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 35 treesize of output 36
[2018-01-30 00:26:45,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-30 00:26:45,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32
[2018-01-30 00:26:45,379 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,380 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-01-30 00:26:45,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41
[2018-01-30 00:26:45,460 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,463 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 33 treesize of output 34
[2018-01-30 00:26:45,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 00:26:45,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,477 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-30 00:26:45,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:53
[2018-01-30 00:26:45,604 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,616 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 74 treesize of output 77
[2018-01-30 00:26:45,625 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 60 treesize of output 44
[2018-01-30 00:26:45,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59
[2018-01-30 00:26:45,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:45,690 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-30 00:26:45,691 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:86, output treesize:109
[2018-01-30 00:26:45,763 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,764 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,765 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69
[2018-01-30 00:26:45,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,785 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,786 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,787 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,787 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39
[2018-01-30 00:26:45,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,806 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 2 xjuncts.
[2018-01-30 00:26:45,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:105
[2018-01-30 00:26:45,930 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,933 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 48 treesize of output 49
[2018-01-30 00:26:45,934 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-30 00:26:45,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:45,967 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:45,979 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 82 treesize of output 85
[2018-01-30 00:26:45,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 92
[2018-01-30 00:26:45,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:46,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 61
[2018-01-30 00:26:46,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:46,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-30 00:26:46,101 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 3 xjuncts.
[2018-01-30 00:26:46,101 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:131, output treesize:176
[2018-01-30 00:26:46,338 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 110
[2018-01-30 00:26:46,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 118
[2018-01-30 00:26:46,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:46,388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 86
[2018-01-30 00:26:46,390 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-30 00:26:46,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:26:46,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-30 00:26:46,510 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 107 treesize of output 80
[2018-01-30 00:26:46,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1
[2018-01-30 00:26:46,512 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:46,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:46,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts.
[2018-01-30 00:26:46,547 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:267, output treesize:194
[2018-01-30 00:26:47,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52
[2018-01-30 00:26:47,161 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 21 treesize of output 13
[2018-01-30 00:26:47,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:47,175 INFO L682 Elim1Store]: detected equality via solver
[2018-01-30 00:26:47,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15
[2018-01-30 00:26:47,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:47,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:47,190 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-30 00:26:47,190 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:130, output treesize:14
[2018-01-30 00:26:47,215 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-30 00:26:47,216 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-30 00:26:47,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-30 00:26:47,221 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-30 00:26:47,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15
[2018-01-30 00:26:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-30 00:26:47,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-30 00:26:47,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 55
[2018-01-30 00:26:47,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states
[2018-01-30 00:26:47,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants.
[2018-01-30 00:26:47,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2811, Unknown=0, NotChecked=0, Total=3080
[2018-01-30 00:26:47,339 INFO L87 Difference]: Start difference. First operand 305 states and 324 transitions. Second operand 56 states.
Received shutdown request...
[2018-01-30 00:26:49,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-30 00:26:49,641 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-01-30 00:26:49,679 WARN L185 ceAbstractionStarter]: Timeout
[2018-01-30 00:26:49,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:26:49 BoogieIcfgContainer
[2018-01-30 00:26:49,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-30 00:26:49,680 INFO L168 Benchmark]: Toolchain (without parser) took 122099.83 ms. Allocated memory was 303.6 MB in the beginning and 653.3 MB in the end (delta: 349.7 MB). Free memory was 261.4 MB in the beginning and 463.4 MB in the end (delta: -202.0 MB). Peak memory consumption was 147.7 MB. Max. memory is 5.3 GB.
[2018-01-30 00:26:49,681 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-30 00:26:49,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.48 ms. Allocated memory is still 303.6 MB. Free memory was 260.4 MB in the beginning and 249.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB.
[2018-01-30 00:26:49,681 INFO L168 Benchmark]: Boogie Preprocessor took 35.61 ms. Allocated memory is still 303.6 MB. Free memory was 249.3 MB in the beginning and 248.3 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB.
[2018-01-30 00:26:49,682 INFO L168 Benchmark]: RCFGBuilder took 435.23 ms. Allocated memory is still 303.6 MB. Free memory was 247.3 MB in the beginning and 221.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB.
[2018-01-30 00:26:49,682 INFO L168 Benchmark]: TraceAbstraction took 121406.52 ms. Allocated memory was 303.6 MB in the beginning and 653.3 MB in the end (delta: 349.7 MB). Free memory was 221.3 MB in the beginning and 463.4 MB in the end (delta: -242.1 MB). Peak memory consumption was 107.6 MB. Max. memory is 5.3 GB.
[2018-01-30 00:26:49,684 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.18 ms. Allocated memory is still 303.6 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 214.48 ms. Allocated memory is still 303.6 MB. Free memory was 260.4 MB in the beginning and 249.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 35.61 ms. Allocated memory is still 303.6 MB. Free memory was 249.3 MB in the beginning and 248.3 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB.
* RCFGBuilder took 435.23 ms. Allocated memory is still 303.6 MB. Free memory was 247.3 MB in the beginning and 221.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 121406.52 ms. Allocated memory was 303.6 MB in the beginning and 653.3 MB in the end (delta: 349.7 MB). Free memory was 221.3 MB in the beginning and 463.4 MB in the end (delta: -242.1 MB). Peak memory consumption was 107.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 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and interpolant automaton (currently 8 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 103 locations, 27 error locations. TIMEOUT Result, 121.3s OverallTime, 33 OverallIterations, 4 TraceHistogramMax, 80.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2440 SDtfs, 19805 SDslu, 35548 SDs, 0 SdLazy, 30805 SolverSat, 3803 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 24.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2925 GetRequests, 1199 SyntacticMatches, 73 SemanticMatches, 1652 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32788 ImplicationChecksByTransitivity, 78.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=32, 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.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 1749 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 37.8s InterpolantComputationTime, 3463 NumberOfCodeBlocks, 3463 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3407 ConstructedInterpolants, 375 QuantifiedInterpolants, 7643581 SizeOfPredicates, 552 NumberOfNonLiveVariables, 5098 ConjunctsInSsa, 1180 ConjunctsInUnsatCore, 56 InterpolantComputations, 10 PerfectInterpolantSequences, 127/1210 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/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-26-49-691.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-26-49-691.csv
Completed graceful shutdown