java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-acfac67
[2018-01-28 22:11:30,610 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-28 22:11:30,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-28 22:11:30,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-28 22:11:30,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-28 22:11:30,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-28 22:11:30,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-28 22:11:30,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-28 22:11:30,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-28 22:11:30,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-28 22:11:30,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-28 22:11:30,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-28 22:11:30,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-28 22:11:30,637 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-28 22:11:30,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-28 22:11:30,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-28 22:11:30,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-28 22:11:30,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-28 22:11:30,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-28 22:11:30,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-28 22:11:30,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-28 22:11:30,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-28 22:11:30,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-28 22:11:30,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-28 22:11:30,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-28 22:11:30,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-28 22:11:30,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-28 22:11:30,656 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-28 22:11:30,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-28 22:11:30,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-28 22:11:30,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-28 22:11:30,658 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-28 22:11:30,666 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-28 22:11:30,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-28 22:11:30,667 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-28 22:11:30,667 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-28 22:11:30,667 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-28 22:11:30,667 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-28 22:11:30,667 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-28 22:11:30,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-28 22:11:30,668 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-28 22:11:30,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-28 22:11:30,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-28 22:11:30,668 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-28 22:11:30,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-28 22:11:30,669 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-28 22:11:30,669 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-28 22:11:30,669 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-28 22:11:30,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-28 22:11:30,669 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-28 22:11:30,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-28 22:11:30,669 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-28 22:11:30,670 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-28 22:11:30,670 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-28 22:11:30,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-28 22:11:30,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 22:11:30,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-28 22:11:30,671 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-28 22:11:30,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-28 22:11:30,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-28 22:11:30,671 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-28 22:11:30,671 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-28 22:11:30,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-28 22:11:30,671 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-28 22:11:30,672 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-28 22:11:30,672 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-28 22:11:30,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-28 22:11:30,719 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-28 22:11:30,722 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-28 22:11:30,723 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-28 22:11:30,724 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-28 22:11:30,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i
[2018-01-28 22:11:30,898 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-28 22:11:30,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-28 22:11:30,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-28 22:11:30,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-28 22:11:30,908 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-28 22:11:30,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:11:30" (1/1) ...
[2018-01-28 22:11:30,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75200bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:30, skipping insertion in model container
[2018-01-28 22:11:30,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:11:30" (1/1) ...
[2018-01-28 22:11:30,924 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 22:11:30,961 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 22:11:31,080 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 22:11:31,104 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 22:11:31,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31 WrapperNode
[2018-01-28 22:11:31,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-28 22:11:31,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-28 22:11:31,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-28 22:11:31,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-28 22:11:31,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
[2018-01-28 22:11:31,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
[2018-01-28 22:11:31,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
[2018-01-28 22:11:31,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
[2018-01-28 22:11:31,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
[2018-01-28 22:11:31,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
[2018-01-28 22:11:31,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
[2018-01-28 22:11:31,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-28 22:11:31,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-28 22:11:31,153 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-28 22:11:31,153 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-28 22:11:31,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 22:11:31,202 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-28 22:11:31,203 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-28 22:11:31,203 INFO L136 BoogieDeclarations]: Found implementation of procedure append
[2018-01-28 22:11:31,203 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-28 22:11:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-28 22:11:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-28 22:11:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-28 22:11:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-28 22:11:31,204 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-28 22:11:31,204 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-01-28 22:11:31,204 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-28 22:11:31,204 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-28 22:11:31,204 INFO L128 BoogieDeclarations]: Found specification of procedure append
[2018-01-28 22:11:31,204 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-28 22:11:31,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-28 22:11:31,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-28 22:11:31,656 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-28 22:11:31,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:11:31 BoogieIcfgContainer
[2018-01-28 22:11:31,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-28 22:11:31,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-28 22:11:31,657 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-28 22:11:31,660 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-28 22:11:31,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:11:30" (1/3) ...
[2018-01-28 22:11:31,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a5a656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:11:31, skipping insertion in model container
[2018-01-28 22:11:31,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:31" (2/3) ...
[2018-01-28 22:11:31,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a5a656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:11:31, skipping insertion in model container
[2018-01-28 22:11:31,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:11:31" (3/3) ...
[2018-01-28 22:11:31,664 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i
[2018-01-28 22:11:31,672 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-28 22:11:31,679 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations.
[2018-01-28 22:11:31,719 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-28 22:11:31,720 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-28 22:11:31,720 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-28 22:11:31,720 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-28 22:11:31,720 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-28 22:11:31,720 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-28 22:11:31,720 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-28 22:11:31,720 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-28 22:11:31,721 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-28 22:11:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states.
[2018-01-28 22:11:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-28 22:11:31,745 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:31,746 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:31,746 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash 900553852, now seen corresponding path program 1 times
[2018-01-28 22:11:31,751 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:31,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:31,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:31,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:31,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:31,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:31,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:31,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-28 22:11:31,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-28 22:11:31,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-28 22:11:31,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 22:11:31,918 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states.
[2018-01-28 22:11:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:32,209 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions.
[2018-01-28 22:11:32,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-28 22:11:32,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2018-01-28 22:11:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:32,220 INFO L225 Difference]: With dead ends: 197
[2018-01-28 22:11:32,221 INFO L226 Difference]: Without dead ends: 127
[2018-01-28 22:11:32,224 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 22:11:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2018-01-28 22:11:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122.
[2018-01-28 22:11:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2018-01-28 22:11:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions.
[2018-01-28 22:11:32,267 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9
[2018-01-28 22:11:32,268 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:32,268 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions.
[2018-01-28 22:11:32,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-28 22:11:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions.
[2018-01-28 22:11:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-28 22:11:32,268 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:32,268 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:32,269 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:32,269 INFO L82 PathProgramCache]: Analyzing trace with hash 900553853, now seen corresponding path program 1 times
[2018-01-28 22:11:32,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:32,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:32,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:32,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:32,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:32,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:32,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:32,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-28 22:11:32,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-28 22:11:32,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-28 22:11:32,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 22:11:32,363 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 3 states.
[2018-01-28 22:11:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:32,490 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions.
[2018-01-28 22:11:32,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-28 22:11:32,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2018-01-28 22:11:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:32,492 INFO L225 Difference]: With dead ends: 124
[2018-01-28 22:11:32,492 INFO L226 Difference]: Without dead ends: 123
[2018-01-28 22:11:32,493 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 22:11:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2018-01-28 22:11:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121.
[2018-01-28 22:11:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2018-01-28 22:11:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions.
[2018-01-28 22:11:32,505 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9
[2018-01-28 22:11:32,505 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:32,505 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions.
[2018-01-28 22:11:32,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-28 22:11:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions.
[2018-01-28 22:11:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-28 22:11:32,506 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:32,506 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:32,506 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1990506389, now seen corresponding path program 1 times
[2018-01-28 22:11:32,507 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:32,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:32,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:32,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:32,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:32,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:32,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:32,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-28 22:11:32,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-28 22:11:32,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-28 22:11:32,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-28 22:11:32,636 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 5 states.
[2018-01-28 22:11:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:32,800 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions.
[2018-01-28 22:11:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-28 22:11:32,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2018-01-28 22:11:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:32,802 INFO L225 Difference]: With dead ends: 121
[2018-01-28 22:11:32,802 INFO L226 Difference]: Without dead ends: 117
[2018-01-28 22:11:32,802 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-28 22:11:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2018-01-28 22:11:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114.
[2018-01-28 22:11:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-28 22:11:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions.
[2018-01-28 22:11:32,809 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 19
[2018-01-28 22:11:32,809 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:32,809 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions.
[2018-01-28 22:11:32,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-28 22:11:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions.
[2018-01-28 22:11:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-28 22:11:32,810 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:32,810 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:32,810 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1990506390, now seen corresponding path program 1 times
[2018-01-28 22:11:32,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:32,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:32,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:32,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:32,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:32,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:33,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:33,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 22:11:33,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-28 22:11:33,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-28 22:11:33,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-01-28 22:11:33,035 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 7 states.
[2018-01-28 22:11:33,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:33,210 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions.
[2018-01-28 22:11:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 22:11:33,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19
[2018-01-28 22:11:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:33,211 INFO L225 Difference]: With dead ends: 114
[2018-01-28 22:11:33,211 INFO L226 Difference]: Without dead ends: 105
[2018-01-28 22:11:33,212 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2018-01-28 22:11:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2018-01-28 22:11:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105.
[2018-01-28 22:11:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states.
[2018-01-28 22:11:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions.
[2018-01-28 22:11:33,219 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 19
[2018-01-28 22:11:33,219 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:33,220 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions.
[2018-01-28 22:11:33,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-28 22:11:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions.
[2018-01-28 22:11:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-28 22:11:33,220 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:33,220 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:33,220 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:33,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1576156004, now seen corresponding path program 1 times
[2018-01-28 22:11:33,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:33,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:33,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:33,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:33,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:33,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:33,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 22:11:33,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 22:11:33,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 22:11:33,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 22:11:33,277 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 4 states.
[2018-01-28 22:11:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:33,365 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions.
[2018-01-28 22:11:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-28 22:11:33,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-28 22:11:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:33,371 INFO L225 Difference]: With dead ends: 105
[2018-01-28 22:11:33,371 INFO L226 Difference]: Without dead ends: 101
[2018-01-28 22:11:33,371 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-28 22:11:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2018-01-28 22:11:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101.
[2018-01-28 22:11:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states.
[2018-01-28 22:11:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions.
[2018-01-28 22:11:33,386 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 20
[2018-01-28 22:11:33,388 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:33,388 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions.
[2018-01-28 22:11:33,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 22:11:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions.
[2018-01-28 22:11:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-28 22:11:33,389 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:33,389 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:33,390 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:33,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1576156005, now seen corresponding path program 1 times
[2018-01-28 22:11:33,390 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:33,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:33,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:33,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:33,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:33,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:33,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 22:11:33,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 22:11:33,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 22:11:33,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 22:11:33,455 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 4 states.
[2018-01-28 22:11:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:33,508 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions.
[2018-01-28 22:11:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-28 22:11:33,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-28 22:11:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:33,509 INFO L225 Difference]: With dead ends: 101
[2018-01-28 22:11:33,509 INFO L226 Difference]: Without dead ends: 97
[2018-01-28 22:11:33,510 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-28 22:11:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2018-01-28 22:11:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2018-01-28 22:11:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-01-28 22:11:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions.
[2018-01-28 22:11:33,516 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 20
[2018-01-28 22:11:33,516 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:33,516 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions.
[2018-01-28 22:11:33,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 22:11:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions.
[2018-01-28 22:11:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-28 22:11:33,517 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:33,518 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:33,518 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash -417630144, now seen corresponding path program 1 times
[2018-01-28 22:11:33,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:33,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:33,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:33,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:33,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:33,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:33,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-28 22:11:33,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-28 22:11:33,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-28 22:11:33,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-01-28 22:11:33,636 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 8 states.
[2018-01-28 22:11:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:33,853 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions.
[2018-01-28 22:11:33,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-01-28 22:11:33,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25
[2018-01-28 22:11:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:33,855 INFO L225 Difference]: With dead ends: 205
[2018-01-28 22:11:33,855 INFO L226 Difference]: Without dead ends: 118
[2018-01-28 22:11:33,856 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2018-01-28 22:11:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2018-01-28 22:11:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110.
[2018-01-28 22:11:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states.
[2018-01-28 22:11:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions.
[2018-01-28 22:11:33,864 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 25
[2018-01-28 22:11:33,864 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:33,865 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions.
[2018-01-28 22:11:33,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-28 22:11:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions.
[2018-01-28 22:11:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-01-28 22:11:33,867 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:33,868 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:33,868 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1648327951, now seen corresponding path program 1 times
[2018-01-28 22:11:33,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:33,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:33,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:33,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:33,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:33,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:33,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 22:11:33,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-28 22:11:33,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-28 22:11:33,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-01-28 22:11:33,984 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 7 states.
[2018-01-28 22:11:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:34,188 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions.
[2018-01-28 22:11:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-28 22:11:34,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42
[2018-01-28 22:11:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:34,190 INFO L225 Difference]: With dead ends: 125
[2018-01-28 22:11:34,190 INFO L226 Difference]: Without dead ends: 124
[2018-01-28 22:11:34,191 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-01-28 22:11:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-01-28 22:11:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109.
[2018-01-28 22:11:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2018-01-28 22:11:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions.
[2018-01-28 22:11:34,196 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 42
[2018-01-28 22:11:34,196 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:34,196 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions.
[2018-01-28 22:11:34,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-28 22:11:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions.
[2018-01-28 22:11:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-01-28 22:11:34,197 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:34,198 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:34,198 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1648327950, now seen corresponding path program 1 times
[2018-01-28 22:11:34,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:34,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:34,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:34,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:34,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:34,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:34,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:34,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-28 22:11:34,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-28 22:11:34,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-28 22:11:34,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-01-28 22:11:34,459 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 9 states.
[2018-01-28 22:11:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:34,622 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions.
[2018-01-28 22:11:34,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-01-28 22:11:34,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42
[2018-01-28 22:11:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:34,624 INFO L225 Difference]: With dead ends: 128
[2018-01-28 22:11:34,624 INFO L226 Difference]: Without dead ends: 127
[2018-01-28 22:11:34,624 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2018-01-28 22:11:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2018-01-28 22:11:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108.
[2018-01-28 22:11:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2018-01-28 22:11:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions.
[2018-01-28 22:11:34,630 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 42
[2018-01-28 22:11:34,631 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:34,631 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions.
[2018-01-28 22:11:34,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-28 22:11:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions.
[2018-01-28 22:11:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-01-28 22:11:34,632 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:34,632 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:34,632 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 833267610, now seen corresponding path program 1 times
[2018-01-28 22:11:34,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:34,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:34,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:34,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:34,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:34,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:34,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:34,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-28 22:11:34,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-28 22:11:34,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-28 22:11:34,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-28 22:11:34,702 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 5 states.
[2018-01-28 22:11:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:34,764 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions.
[2018-01-28 22:11:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 22:11:34,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44
[2018-01-28 22:11:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:34,766 INFO L225 Difference]: With dead ends: 144
[2018-01-28 22:11:34,766 INFO L226 Difference]: Without dead ends: 120
[2018-01-28 22:11:34,767 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-28 22:11:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2018-01-28 22:11:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115.
[2018-01-28 22:11:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states.
[2018-01-28 22:11:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions.
[2018-01-28 22:11:34,774 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 44
[2018-01-28 22:11:34,774 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:34,774 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions.
[2018-01-28 22:11:34,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-28 22:11:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions.
[2018-01-28 22:11:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-28 22:11:34,776 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:34,776 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:34,776 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1814123838, now seen corresponding path program 1 times
[2018-01-28 22:11:34,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:34,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:34,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:34,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:34,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:34,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:34,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:34,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-28 22:11:34,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-28 22:11:34,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-28 22:11:34,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-28 22:11:34,858 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 5 states.
[2018-01-28 22:11:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:35,022 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions.
[2018-01-28 22:11:35,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 22:11:35,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47
[2018-01-28 22:11:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:35,024 INFO L225 Difference]: With dead ends: 115
[2018-01-28 22:11:35,024 INFO L226 Difference]: Without dead ends: 114
[2018-01-28 22:11:35,024 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-28 22:11:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2018-01-28 22:11:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114.
[2018-01-28 22:11:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-28 22:11:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions.
[2018-01-28 22:11:35,029 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 47
[2018-01-28 22:11:35,029 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:35,029 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions.
[2018-01-28 22:11:35,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-28 22:11:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions.
[2018-01-28 22:11:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-28 22:11:35,030 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:35,031 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:35,031 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1814123839, now seen corresponding path program 1 times
[2018-01-28 22:11:35,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:35,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:35,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:35,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:35,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:35,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:35,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:35,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-01-28 22:11:35,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-28 22:11:35,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-28 22:11:35,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2018-01-28 22:11:35,282 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 11 states.
[2018-01-28 22:11:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:35,680 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions.
[2018-01-28 22:11:35,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-28 22:11:35,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47
[2018-01-28 22:11:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:35,681 INFO L225 Difference]: With dead ends: 133
[2018-01-28 22:11:35,681 INFO L226 Difference]: Without dead ends: 132
[2018-01-28 22:11:35,682 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2018-01-28 22:11:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2018-01-28 22:11:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113.
[2018-01-28 22:11:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-01-28 22:11:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions.
[2018-01-28 22:11:35,687 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 47
[2018-01-28 22:11:35,688 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:35,688 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions.
[2018-01-28 22:11:35,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-28 22:11:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions.
[2018-01-28 22:11:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-28 22:11:35,689 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:35,689 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:35,689 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash 403264150, now seen corresponding path program 1 times
[2018-01-28 22:11:35,690 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:35,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:35,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:35,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:35,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:35,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:36,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:36,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-28 22:11:36,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-28 22:11:36,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-28 22:11:36,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2018-01-28 22:11:36,199 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 15 states.
[2018-01-28 22:11:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:36,924 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions.
[2018-01-28 22:11:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-01-28 22:11:36,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48
[2018-01-28 22:11:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:36,925 INFO L225 Difference]: With dead ends: 174
[2018-01-28 22:11:36,926 INFO L226 Difference]: Without dead ends: 173
[2018-01-28 22:11:36,926 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122
[2018-01-28 22:11:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2018-01-28 22:11:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129.
[2018-01-28 22:11:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-01-28 22:11:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions.
[2018-01-28 22:11:36,933 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 48
[2018-01-28 22:11:36,933 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:36,934 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions.
[2018-01-28 22:11:36,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-28 22:11:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions.
[2018-01-28 22:11:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-28 22:11:36,935 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:36,935 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:36,935 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash 403264151, now seen corresponding path program 1 times
[2018-01-28 22:11:36,936 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:36,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:36,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:36,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:36,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:36,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:37,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:37,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-28 22:11:37,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-28 22:11:37,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-28 22:11:37,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2018-01-28 22:11:37,283 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 15 states.
[2018-01-28 22:11:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:38,092 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions.
[2018-01-28 22:11:38,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-01-28 22:11:38,093 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48
[2018-01-28 22:11:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:38,094 INFO L225 Difference]: With dead ends: 163
[2018-01-28 22:11:38,094 INFO L226 Difference]: Without dead ends: 162
[2018-01-28 22:11:38,095 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992
[2018-01-28 22:11:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2018-01-28 22:11:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 129.
[2018-01-28 22:11:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-01-28 22:11:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions.
[2018-01-28 22:11:38,104 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 48
[2018-01-28 22:11:38,105 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:38,105 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions.
[2018-01-28 22:11:38,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-28 22:11:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions.
[2018-01-28 22:11:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-28 22:11:38,106 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:38,106 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:38,107 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 618788610, now seen corresponding path program 1 times
[2018-01-28 22:11:38,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:38,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:38,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:38,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:38,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:38,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:38,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:38,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-28 22:11:38,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-28 22:11:38,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-28 22:11:38,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2018-01-28 22:11:38,511 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand 15 states.
[2018-01-28 22:11:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:39,303 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions.
[2018-01-28 22:11:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-01-28 22:11:39,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51
[2018-01-28 22:11:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:39,305 INFO L225 Difference]: With dead ends: 196
[2018-01-28 22:11:39,305 INFO L226 Difference]: Without dead ends: 195
[2018-01-28 22:11:39,306 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992
[2018-01-28 22:11:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states.
[2018-01-28 22:11:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 147.
[2018-01-28 22:11:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-01-28 22:11:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions.
[2018-01-28 22:11:39,315 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 51
[2018-01-28 22:11:39,315 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:39,315 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions.
[2018-01-28 22:11:39,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-28 22:11:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions.
[2018-01-28 22:11:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-01-28 22:11:39,316 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:39,316 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:39,316 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:39,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2002577754, now seen corresponding path program 1 times
[2018-01-28 22:11:39,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:39,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:39,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:39,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:39,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:39,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:39,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:39,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-28 22:11:39,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-28 22:11:39,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-28 22:11:39,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-01-28 22:11:39,439 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 8 states.
[2018-01-28 22:11:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:39,572 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions.
[2018-01-28 22:11:39,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-28 22:11:39,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52
[2018-01-28 22:11:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:39,574 INFO L225 Difference]: With dead ends: 166
[2018-01-28 22:11:39,574 INFO L226 Difference]: Without dead ends: 165
[2018-01-28 22:11:39,574 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2018-01-28 22:11:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2018-01-28 22:11:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 146.
[2018-01-28 22:11:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2018-01-28 22:11:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions.
[2018-01-28 22:11:39,581 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 52
[2018-01-28 22:11:39,581 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:39,581 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions.
[2018-01-28 22:11:39,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-28 22:11:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions.
[2018-01-28 22:11:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-01-28 22:11:39,582 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:39,582 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:39,582 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2002577755, now seen corresponding path program 1 times
[2018-01-28 22:11:39,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:39,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:39,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:39,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:39,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:39,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:40,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:40,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-28 22:11:40,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-28 22:11:40,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-28 22:11:40,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2018-01-28 22:11:40,276 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 15 states.
[2018-01-28 22:11:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:40,914 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions.
[2018-01-28 22:11:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-01-28 22:11:40,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52
[2018-01-28 22:11:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:40,915 INFO L225 Difference]: With dead ends: 177
[2018-01-28 22:11:40,915 INFO L226 Difference]: Without dead ends: 176
[2018-01-28 22:11:40,915 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756
[2018-01-28 22:11:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2018-01-28 22:11:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147.
[2018-01-28 22:11:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-01-28 22:11:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions.
[2018-01-28 22:11:40,924 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 52
[2018-01-28 22:11:40,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:40,925 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions.
[2018-01-28 22:11:40,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-28 22:11:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions.
[2018-01-28 22:11:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-01-28 22:11:40,925 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:40,926 INFO L330 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]
[2018-01-28 22:11:40,926 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1385098437, now seen corresponding path program 1 times
[2018-01-28 22:11:40,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:40,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:40,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:40,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:40,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:40,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:41,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:11:41,113 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:11:41,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:41,173 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:11:41,299 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-28 22:11:41,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:11:41,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,311 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-28 22:11:41,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9
[2018-01-28 22:11:41,419 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 0 case distinctions, treesize of input 16 treesize of output 15
[2018-01-28 22:11:41,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18
[2018-01-28 22:11:41,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35
[2018-01-28 22:11:41,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2018-01-28 22:11:41,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:11:41,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-01-28 22:11:41,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28
[2018-01-28 22:11:41,692 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 20 treesize of output 5
[2018-01-28 22:11:41,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:41,704 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-28 22:11:41,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11
[2018-01-28 22:11:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:41,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:11:41,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19
[2018-01-28 22:11:41,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-01-28 22:11:41,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-01-28 22:11:41,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380
[2018-01-28 22:11:41,775 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 20 states.
[2018-01-28 22:11:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:42,601 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions.
[2018-01-28 22:11:42,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-01-28 22:11:42,602 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54
[2018-01-28 22:11:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:42,602 INFO L225 Difference]: With dead ends: 172
[2018-01-28 22:11:42,603 INFO L226 Difference]: Without dead ends: 171
[2018-01-28 22:11:42,603 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930
[2018-01-28 22:11:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2018-01-28 22:11:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 156.
[2018-01-28 22:11:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states.
[2018-01-28 22:11:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions.
[2018-01-28 22:11:42,612 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 54
[2018-01-28 22:11:42,612 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:42,612 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions.
[2018-01-28 22:11:42,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-01-28 22:11:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions.
[2018-01-28 22:11:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-01-28 22:11:42,613 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:42,613 INFO L330 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]
[2018-01-28 22:11:42,613 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:42,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1385098436, now seen corresponding path program 1 times
[2018-01-28 22:11:42,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:42,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:42,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:42,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:42,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:42,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:42,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:11:42,891 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:11:42,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:42,934 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:11:43,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, 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-28 22:11:43,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 8 treesize of output 7
[2018-01-28 22:11:43,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,059 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-28 22:11:43,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:11:43,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,080 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-28 22:11:43,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26
[2018-01-28 22:11:43,382 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:43,383 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:43,386 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 15 treesize of output 8
[2018-01-28 22:11:43,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-28 22:11:43,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33
[2018-01-28 22:11:43,730 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 3 case distinctions, treesize of input 23 treesize of output 33
[2018-01-28 22:11:43,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23
[2018-01-28 22:11:43,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,796 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 3 case distinctions, treesize of input 33 treesize of output 41
[2018-01-28 22:11:43,807 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 34 treesize of output 33
[2018-01-28 22:11:43,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,859 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-28 22:11:43,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52
[2018-01-28 22:11:43,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34
[2018-01-28 22:11:43,954 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 26 treesize of output 10
[2018-01-28 22:11:43,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26
[2018-01-28 22:11:43,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3
[2018-01-28 22:11:43,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:43,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:44,000 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-28 22:11:44,001 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18
[2018-01-28 22:11:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:44,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:11:44,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21
[2018-01-28 22:11:44,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-01-28 22:11:44,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-01-28 22:11:44,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462
[2018-01-28 22:11:44,072 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 22 states.
[2018-01-28 22:11:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:45,095 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions.
[2018-01-28 22:11:45,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-01-28 22:11:45,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54
[2018-01-28 22:11:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:45,097 INFO L225 Difference]: With dead ends: 171
[2018-01-28 22:11:45,097 INFO L226 Difference]: Without dead ends: 170
[2018-01-28 22:11:45,098 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056
[2018-01-28 22:11:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2018-01-28 22:11:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155.
[2018-01-28 22:11:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states.
[2018-01-28 22:11:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions.
[2018-01-28 22:11:45,107 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 54
[2018-01-28 22:11:45,107 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:45,107 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions.
[2018-01-28 22:11:45,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-01-28 22:11:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions.
[2018-01-28 22:11:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-01-28 22:11:45,108 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:45,108 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:45,108 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 331873979, now seen corresponding path program 1 times
[2018-01-28 22:11:45,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:45,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:45,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:45,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:45,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:45,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:45,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:45,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-28 22:11:45,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-28 22:11:45,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-28 22:11:45,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-01-28 22:11:45,258 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 10 states.
[2018-01-28 22:11:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:45,545 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions.
[2018-01-28 22:11:45,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-01-28 22:11:45,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54
[2018-01-28 22:11:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:45,546 INFO L225 Difference]: With dead ends: 170
[2018-01-28 22:11:45,546 INFO L226 Difference]: Without dead ends: 169
[2018-01-28 22:11:45,547 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2018-01-28 22:11:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2018-01-28 22:11:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161.
[2018-01-28 22:11:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states.
[2018-01-28 22:11:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions.
[2018-01-28 22:11:45,556 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 54
[2018-01-28 22:11:45,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:45,556 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions.
[2018-01-28 22:11:45,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-28 22:11:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions.
[2018-01-28 22:11:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-01-28 22:11:45,557 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:45,557 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:45,557 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash 895502578, now seen corresponding path program 1 times
[2018-01-28 22:11:45,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:45,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:45,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:45,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:45,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:45,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:45,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:45,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-28 22:11:45,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-28 22:11:45,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-28 22:11:45,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-01-28 22:11:45,642 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand 7 states.
[2018-01-28 22:11:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:45,742 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions.
[2018-01-28 22:11:45,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-28 22:11:45,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61
[2018-01-28 22:11:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:45,744 INFO L225 Difference]: With dead ends: 197
[2018-01-28 22:11:45,745 INFO L226 Difference]: Without dead ends: 173
[2018-01-28 22:11:45,745 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2018-01-28 22:11:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2018-01-28 22:11:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166.
[2018-01-28 22:11:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states.
[2018-01-28 22:11:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 174 transitions.
[2018-01-28 22:11:45,755 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 174 transitions. Word has length 61
[2018-01-28 22:11:45,755 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:45,755 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 174 transitions.
[2018-01-28 22:11:45,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-28 22:11:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 174 transitions.
[2018-01-28 22:11:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-01-28 22:11:45,756 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:45,756 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:45,756 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1583440559, now seen corresponding path program 1 times
[2018-01-28 22:11:45,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:45,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:45,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:45,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:45,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:45,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:46,394 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 37 DAG size of output 23
[2018-01-28 22:11:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:47,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:11:47,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2018-01-28 22:11:47,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-01-28 22:11:47,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-01-28 22:11:47,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380
[2018-01-28 22:11:47,325 INFO L87 Difference]: Start difference. First operand 166 states and 174 transitions. Second operand 20 states.
[2018-01-28 22:11:47,950 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 88 DAG size of output 73
[2018-01-28 22:11:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:48,646 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions.
[2018-01-28 22:11:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-01-28 22:11:48,646 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63
[2018-01-28 22:11:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:48,647 INFO L225 Difference]: With dead ends: 176
[2018-01-28 22:11:48,647 INFO L226 Difference]: Without dead ends: 150
[2018-01-28 22:11:48,648 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056
[2018-01-28 22:11:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-01-28 22:11:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147.
[2018-01-28 22:11:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-01-28 22:11:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions.
[2018-01-28 22:11:48,657 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 63
[2018-01-28 22:11:48,658 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:48,658 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions.
[2018-01-28 22:11:48,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-01-28 22:11:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions.
[2018-01-28 22:11:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-01-28 22:11:48,659 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:48,659 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:48,659 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1178904772, now seen corresponding path program 1 times
[2018-01-28 22:11:48,659 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:48,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:48,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:48,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:48,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:48,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:48,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:11:48,890 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:11:48,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:48,942 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:11:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2018-01-28 22:11:49,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-28 22:11:49,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18
[2018-01-28 22:11:49,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-28 22:11:49,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-28 22:11:49,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306
[2018-01-28 22:11:49,148 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 18 states.
[2018-01-28 22:11:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:49,895 INFO L93 Difference]: Finished difference Result 240 states and 252 transitions.
[2018-01-28 22:11:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-01-28 22:11:49,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75
[2018-01-28 22:11:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:49,896 INFO L225 Difference]: With dead ends: 240
[2018-01-28 22:11:49,896 INFO L226 Difference]: Without dead ends: 121
[2018-01-28 22:11:49,897 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=1612, Unknown=0, NotChecked=0, Total=1892
[2018-01-28 22:11:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2018-01-28 22:11:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116.
[2018-01-28 22:11:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states.
[2018-01-28 22:11:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions.
[2018-01-28 22:11:49,905 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 75
[2018-01-28 22:11:49,906 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:49,906 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions.
[2018-01-28 22:11:49,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-28 22:11:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions.
[2018-01-28 22:11:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-01-28 22:11:49,907 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:49,907 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:49,907 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1951140529, now seen corresponding path program 1 times
[2018-01-28 22:11:49,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:49,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:49,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:49,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:49,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:49,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:51,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:11:51,085 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:11:51,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:51,139 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:11:51,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:11:51,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-28 22:11:51,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-28 22:11:51,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-28 22:11:51,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29
[2018-01-28 22:11:51,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31
[2018-01-28 22:11:51,431 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 0 case distinctions, treesize of input 17 treesize of output 18
[2018-01-28 22:11:51,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-28 22:11:51,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,460 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-28 22:11:51,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:11:51,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,473 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-28 22:11:51,473 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42
[2018-01-28 22:11:51,513 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:51,519 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:51,520 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 15 treesize of output 8
[2018-01-28 22:11:51,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44
[2018-01-28 22:11:51,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:11:51,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26
[2018-01-28 22:11:51,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-28 22:11:51,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:11:51,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:51,991 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-28 22:11:51,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:154
[2018-01-28 22:11:52,141 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:52,142 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:52,142 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:52,143 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 24 treesize of output 29
[2018-01-28 22:11:52,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,168 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 69 treesize of output 93
[2018-01-28 22:11:52,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 38
[2018-01-28 22:11:52,174 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:52,174 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:11:52,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74
[2018-01-28 22:11:52,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,201 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:11:52,204 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 82 treesize of output 106
[2018-01-28 22:11:52,208 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 0 case distinctions, treesize of input 67 treesize of output 55
[2018-01-28 22:11:52,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,256 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 76 treesize of output 66
[2018-01-28 22:11:52,261 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 66 treesize of output 56
[2018-01-28 22:11:52,262 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:11:52,277 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:11:52,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:11:52,292 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:197, output treesize:89
[2018-01-28 22:11:52,525 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 69 treesize of output 57
[2018-01-28 22:11:52,530 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 57 treesize of output 42
[2018-01-28 22:11:52,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:11:52,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:73
[2018-01-28 22:11:52,656 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 13 treesize of output 3
[2018-01-28 22:11:52,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,679 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 59 treesize of output 55
[2018-01-28 22:11:52,683 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:11:52,683 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 26 treesize of output 22
[2018-01-28 22:11:52,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,702 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:11:52,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-01-28 22:11:52,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,712 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:52,718 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:11:52,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17
[2018-01-28 22:11:52,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:52,733 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:89, output treesize:3
[2018-01-28 22:11:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:52,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:11:52,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 45
[2018-01-28 22:11:52,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-01-28 22:11:52,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-01-28 22:11:52,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070
[2018-01-28 22:11:52,807 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 46 states.
[2018-01-28 22:11:54,938 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 124 DAG size of output 101
[2018-01-28 22:11:55,138 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 117 DAG size of output 96
[2018-01-28 22:11:55,323 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 104 DAG size of output 89
[2018-01-28 22:11:55,480 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 93 DAG size of output 77
[2018-01-28 22:11:56,605 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 115 DAG size of output 89
[2018-01-28 22:11:56,780 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 108 DAG size of output 84
[2018-01-28 22:11:56,950 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 95 DAG size of output 77
[2018-01-28 22:11:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:11:57,456 INFO L93 Difference]: Finished difference Result 185 states and 191 transitions.
[2018-01-28 22:11:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states.
[2018-01-28 22:11:57,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 78
[2018-01-28 22:11:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:11:57,459 INFO L225 Difference]: With dead ends: 185
[2018-01-28 22:11:57,459 INFO L226 Difference]: Without dead ends: 184
[2018-01-28 22:11:57,461 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=673, Invalid=7699, Unknown=0, NotChecked=0, Total=8372
[2018-01-28 22:11:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2018-01-28 22:11:57,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 115.
[2018-01-28 22:11:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states.
[2018-01-28 22:11:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions.
[2018-01-28 22:11:57,471 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 78
[2018-01-28 22:11:57,471 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:11:57,471 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions.
[2018-01-28 22:11:57,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-01-28 22:11:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions.
[2018-01-28 22:11:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-01-28 22:11:57,472 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:11:57,472 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:11:57,473 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:11:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1951140528, now seen corresponding path program 1 times
[2018-01-28 22:11:57,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:11:57,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:11:57,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:57,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:57,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:11:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:57,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:11:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:11:58,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:11:58,945 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:11:58,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:11:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:11:58,987 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:11:58,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:11:58,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:58,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:58,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-28 22:11:59,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 6 treesize of output 5
[2018-01-28 22:11:59,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-01-28 22:11:59,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-28 22:11:59,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-28 22:11:59,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,190 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-28 22:11:59,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-01-28 22:11:59,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-01-28 22:11:59,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2018-01-28 22:11:59,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,273 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-28 22:11:59,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:11:59,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,283 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-28 22:11:59,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44
[2018-01-28 22:11:59,327 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:59,328 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:11:59,329 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 15 treesize of output 8
[2018-01-28 22:11:59,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46
[2018-01-28 22:11:59,919 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-28 22:11:59,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:11:59,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:11:59,942 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-28 22:11:59,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:140
[2018-01-28 22:12:00,119 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,121 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,123 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,124 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 75
[2018-01-28 22:12:00,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,156 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 101 treesize of output 100
[2018-01-28 22:12:00,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42
[2018-01-28 22:12:00,161 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57
[2018-01-28 22:12:00,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,184 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,187 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 104 treesize of output 96
[2018-01-28 22:12:00,190 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 41 treesize of output 45
[2018-01-28 22:12:00,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,229 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 39 treesize of output 35
[2018-01-28 22:12:00,231 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 35 treesize of output 31
[2018-01-28 22:12:00,231 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,234 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,250 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:185, output treesize:166
[2018-01-28 22:12:00,511 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 153 treesize of output 133
[2018-01-28 22:12:00,515 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 133 treesize of output 110
[2018-01-28 22:12:00,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:00,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:174, output treesize:131
[2018-01-28 22:12:00,619 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,621 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,622 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 80
[2018-01-28 22:12:00,628 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36
[2018-01-28 22:12:00,629 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-28 22:12:00,655 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,668 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 64
[2018-01-28 22:12:00,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts.
[2018-01-28 22:12:00,672 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:00,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40
[2018-01-28 22:12:00,675 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:00,740 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 47 treesize of output 38
[2018-01-28 22:12:00,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42
[2018-01-28 22:12:00,743 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,745 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 45 treesize of output 36
[2018-01-28 22:12:00,745 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,747 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 41 treesize of output 32
[2018-01-28 22:12:00,747 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,748 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 34 treesize of output 23
[2018-01-28 22:12:00,749 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:00,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts.
[2018-01-28 22:12:00,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts.
[2018-01-28 22:12:00,848 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:137, output treesize:177
[2018-01-28 22:12:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:01,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:12:01,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48
[2018-01-28 22:12:01,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-01-28 22:12:01,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-01-28 22:12:01,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2207, Unknown=1, NotChecked=0, Total=2352
[2018-01-28 22:12:01,020 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 49 states.
[2018-01-28 22:12:05,127 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 75 DAG size of output 56
[2018-01-28 22:12:05,697 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 84 DAG size of output 58
[2018-01-28 22:12:07,087 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 106 DAG size of output 64
[2018-01-28 22:12:08,166 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 123 DAG size of output 69
[2018-01-28 22:12:09,990 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 132 DAG size of output 71
[2018-01-28 22:12:13,290 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 153 DAG size of output 99
[2018-01-28 22:12:13,636 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 145 DAG size of output 94
[2018-01-28 22:12:13,878 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 129 DAG size of output 87
[2018-01-28 22:12:14,089 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 121 DAG size of output 77
[2018-01-28 22:12:20,565 WARN L146 SmtUtils]: Spent 4339ms on a formula simplification. DAG size of input: 109 DAG size of output 65
[2018-01-28 22:12:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:12:21,368 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions.
[2018-01-28 22:12:21,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-28 22:12:21,369 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 78
[2018-01-28 22:12:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:12:21,370 INFO L225 Difference]: With dead ends: 118
[2018-01-28 22:12:21,370 INFO L226 Difference]: Without dead ends: 117
[2018-01-28 22:12:21,371 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=466, Invalid=5230, Unknown=4, NotChecked=0, Total=5700
[2018-01-28 22:12:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2018-01-28 22:12:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114.
[2018-01-28 22:12:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-28 22:12:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions.
[2018-01-28 22:12:21,379 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 78
[2018-01-28 22:12:21,380 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:12:21,380 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions.
[2018-01-28 22:12:21,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-01-28 22:12:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions.
[2018-01-28 22:12:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2018-01-28 22:12:21,381 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:12:21,381 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:12:21,381 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:12:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1659907497, now seen corresponding path program 1 times
[2018-01-28 22:12:21,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:12:21,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:12:21,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:21,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:21,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:21,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:12:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:22,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:12:22,688 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:12:22,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:22,737 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:12:22,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:12:22,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:22,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:22,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-28 22:12:22,869 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:22,869 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:22,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-28 22:12:22,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:22,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:22,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-01-28 22:12:22,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-28 22:12:22,938 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-28 22:12:22,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:22,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:22,947 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-28 22:12:22,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-01-28 22:12:22,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-28 22:12:22,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:12:22,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:22,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,009 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 3 case distinctions, treesize of input 20 treesize of output 32
[2018-01-28 22:12:23,017 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 18 treesize of output 26
[2018-01-28 22:12:23,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:23,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16
[2018-01-28 22:12:23,036 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:23,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:23,060 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72
[2018-01-28 22:12:23,107 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-01-28 22:12:23,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,118 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:23,119 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:23,119 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 15 treesize of output 8
[2018-01-28 22:12:23,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45
[2018-01-28 22:12:23,563 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-28 22:12:23,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:12:23,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,579 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-28 22:12:23,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:134
[2018-01-28 22:12:23,749 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:23,750 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:23,750 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:23,751 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-28 22:12:23,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,768 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 58 treesize of output 54
[2018-01-28 22:12:23,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2018-01-28 22:12:23,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,797 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 75 treesize of output 78
[2018-01-28 22:12:23,799 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38
[2018-01-28 22:12:23,801 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:23,802 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 38 treesize of output 53
[2018-01-28 22:12:23,803 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,821 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:23,824 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 78 treesize of output 76
[2018-01-28 22:12:23,827 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 34 treesize of output 32
[2018-01-28 22:12:23,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:23,851 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:178, output treesize:110
[2018-01-28 22:12:24,054 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 111 treesize of output 95
[2018-01-28 22:12:24,057 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 95 treesize of output 76
[2018-01-28 22:12:24,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:88
[2018-01-28 22:12:24,141 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:24,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:24,145 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 57
[2018-01-28 22:12:24,147 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 8
[2018-01-28 22:12:24,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,157 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 15 treesize of output 11
[2018-01-28 22:12:24,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,162 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:24,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15
[2018-01-28 22:12:24,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,171 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-28 22:12:24,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:10
[2018-01-28 22:12:24,213 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:24,213 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 21
[2018-01-28 22:12:24,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:24,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-01-28 22:12:24,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34
[2018-01-28 22:12:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:24,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:12:24,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 48
[2018-01-28 22:12:24,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-01-28 22:12:24,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-01-28 22:12:24,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2208, Unknown=2, NotChecked=0, Total=2352
[2018-01-28 22:12:24,343 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 49 states.
[2018-01-28 22:12:25,595 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 83 DAG size of output 72
[2018-01-28 22:12:31,067 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 107 DAG size of output 62
[2018-01-28 22:12:31,321 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 121 DAG size of output 67
[2018-01-28 22:12:31,529 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 129 DAG size of output 69
[2018-01-28 22:12:31,936 WARN L146 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 135 DAG size of output 88
[2018-01-28 22:12:32,252 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 128 DAG size of output 83
[2018-01-28 22:12:32,523 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 115 DAG size of output 75
[2018-01-28 22:12:32,739 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 108 DAG size of output 65
[2018-01-28 22:12:33,133 WARN L146 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 91 DAG size of output 77
[2018-01-28 22:12:34,211 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 123 DAG size of output 54
[2018-01-28 22:12:34,570 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 129 DAG size of output 83
[2018-01-28 22:12:34,877 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 122 DAG size of output 78
[2018-01-28 22:12:35,170 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 109 DAG size of output 70
[2018-01-28 22:12:35,440 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 102 DAG size of output 62
[2018-01-28 22:12:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:12:35,762 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions.
[2018-01-28 22:12:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-01-28 22:12:35,763 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 81
[2018-01-28 22:12:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:12:35,764 INFO L225 Difference]: With dead ends: 182
[2018-01-28 22:12:35,764 INFO L226 Difference]: Without dead ends: 181
[2018-01-28 22:12:35,765 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=658, Invalid=6995, Unknown=3, NotChecked=0, Total=7656
[2018-01-28 22:12:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2018-01-28 22:12:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135.
[2018-01-28 22:12:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-01-28 22:12:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions.
[2018-01-28 22:12:35,773 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 81
[2018-01-28 22:12:35,773 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:12:35,773 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions.
[2018-01-28 22:12:35,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-01-28 22:12:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions.
[2018-01-28 22:12:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2018-01-28 22:12:35,774 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:12:35,774 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:12:35,774 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:12:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash -82475116, now seen corresponding path program 1 times
[2018-01-28 22:12:35,774 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:12:35,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:12:35,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:35,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:35,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:35,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:12:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:36,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:12:36,984 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:12:36,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:37,031 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:12:37,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:12:37,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-28 22:12:37,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:12:37,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-01-28 22:12:37,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-28 22:12:37,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-28 22:12:37,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,238 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-28 22:12:37,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-01-28 22:12:37,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-01-28 22:12:37,300 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 19 treesize of output 27
[2018-01-28 22:12:37,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:12:37,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-28 22:12:37,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,332 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-28 22:12:37,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:12:37,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,341 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-28 22:12:37,341 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39
[2018-01-28 22:12:37,378 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:37,379 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:37,380 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 15 treesize of output 8
[2018-01-28 22:12:37,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41
[2018-01-28 22:12:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:12:37,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:37,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26
[2018-01-28 22:12:38,085 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,086 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,089 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,089 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 28 treesize of output 21
[2018-01-28 22:12:38,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,125 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 54 treesize of output 50
[2018-01-28 22:12:38,127 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 46 treesize of output 42
[2018-01-28 22:12:38,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,134 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 91 treesize of output 85
[2018-01-28 22:12:38,136 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 82 treesize of output 76
[2018-01-28 22:12:38,137 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,179 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 71 treesize of output 70
[2018-01-28 22:12:38,182 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30
[2018-01-28 22:12:38,184 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37
[2018-01-28 22:12:38,186 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,190 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,203 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,204 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,205 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 70 treesize of output 73
[2018-01-28 22:12:38,207 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 39 treesize of output 32
[2018-01-28 22:12:38,208 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,216 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,222 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,227 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:38,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94
[2018-01-28 22:12:38,236 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:38,237 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67
[2018-01-28 22:12:38,237 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,249 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 69 treesize of output 50
[2018-01-28 22:12:38,251 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:38,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34
[2018-01-28 22:12:38,252 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:38,260 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,262 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 31 treesize of output 35
[2018-01-28 22:12:38,262 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,268 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,278 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,278 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 30 treesize of output 29
[2018-01-28 22:12:38,280 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:38,281 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:38,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35
[2018-01-28 22:12:38,283 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,288 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,292 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:12:38,313 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:154, output treesize:127
[2018-01-28 22:12:38,697 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 62 treesize of output 58
[2018-01-28 22:12:38,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-01-28 22:12:38,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,807 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 124 treesize of output 120
[2018-01-28 22:12:38,810 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-28 22:12:38,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:38,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:12:38,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:165
[2018-01-28 22:12:38,980 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:38,980 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 68 treesize of output 62
[2018-01-28 22:12:38,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,019 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 130 treesize of output 113
[2018-01-28 22:12:39,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:12:39,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:199, output treesize:169
[2018-01-28 22:12:39,212 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,219 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,220 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 130 treesize of output 157
[2018-01-28 22:12:39,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,235 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,237 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,237 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 72 treesize of output 99
[2018-01-28 22:12:39,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts.
[2018-01-28 22:12:39,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:543, output treesize:469
[2018-01-28 22:12:39,653 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 135 DAG size of output 100
[2018-01-28 22:12:39,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46
[2018-01-28 22:12:39,690 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,691 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28
[2018-01-28 22:12:39,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:39,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:39,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43
[2018-01-28 22:12:39,766 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:39,766 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 26 treesize of output 21
[2018-01-28 22:12:39,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,826 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,828 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,829 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 85
[2018-01-28 22:12:39,835 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30
[2018-01-28 22:12:39,836 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:12:39,855 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 9 treesize of output 1
[2018-01-28 22:12:39,855 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,868 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24
[2018-01-28 22:12:39,870 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:39,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:39,925 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,926 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,928 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 83
[2018-01-28 22:12:39,936 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36
[2018-01-28 22:12:39,937 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:12:39,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24
[2018-01-28 22:12:39,958 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,971 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:39,972 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:39,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26
[2018-01-28 22:12:39,974 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:39,984 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:40,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts.
[2018-01-28 22:12:40,018 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:365, output treesize:69
[2018-01-28 22:12:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:40,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:12:40,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 50
[2018-01-28 22:12:40,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states
[2018-01-28 22:12:40,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2018-01-28 22:12:40,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2389, Unknown=17, NotChecked=0, Total=2550
[2018-01-28 22:12:40,170 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 51 states.
[2018-01-28 22:12:42,568 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 129 DAG size of output 95
[2018-01-28 22:12:42,785 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 122 DAG size of output 90
[2018-01-28 22:12:42,954 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 109 DAG size of output 82
[2018-01-28 22:12:43,318 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 94 DAG size of output 79
[2018-01-28 22:12:43,767 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 74 DAG size of output 67
[2018-01-28 22:12:44,058 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 82 DAG size of output 69
[2018-01-28 22:12:44,297 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 102 DAG size of output 82
[2018-01-28 22:12:44,660 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 162 DAG size of output 122
[2018-01-28 22:12:44,889 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 150 DAG size of output 117
[2018-01-28 22:12:45,088 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 133 DAG size of output 113
[2018-01-28 22:12:45,316 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 150 DAG size of output 130
[2018-01-28 22:12:46,045 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 114 DAG size of output 80
[2018-01-28 22:12:46,227 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 107 DAG size of output 75
[2018-01-28 22:12:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:12:46,941 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions.
[2018-01-28 22:12:46,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-01-28 22:12:46,941 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 82
[2018-01-28 22:12:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:12:46,942 INFO L225 Difference]: With dead ends: 181
[2018-01-28 22:12:46,942 INFO L226 Difference]: Without dead ends: 180
[2018-01-28 22:12:46,944 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=614, Invalid=7699, Unknown=59, NotChecked=0, Total=8372
[2018-01-28 22:12:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2018-01-28 22:12:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136.
[2018-01-28 22:12:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states.
[2018-01-28 22:12:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions.
[2018-01-28 22:12:46,951 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 82
[2018-01-28 22:12:46,951 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:12:46,952 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions.
[2018-01-28 22:12:46,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states.
[2018-01-28 22:12:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions.
[2018-01-28 22:12:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2018-01-28 22:12:46,952 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:12:46,953 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:12:46,953 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:12:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1949175116, now seen corresponding path program 1 times
[2018-01-28 22:12:46,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:12:46,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:12:46,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:46,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:46,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:46,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:12:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:47,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:12:47,153 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:12:47,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:47,195 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:12:47,234 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-28 22:12:47,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 8 treesize of output 7
[2018-01-28 22:12:47,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,241 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-28 22:12:47,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18
[2018-01-28 22:12:47,250 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:47,251 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:47,252 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 15 treesize of output 8
[2018-01-28 22:12:47,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20
[2018-01-28 22:12:47,271 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 24 treesize of output 18
[2018-01-28 22:12:47,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-01-28 22:12:47,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14
[2018-01-28 22:12:47,282 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:47,283 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-28 22:12:47,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:47,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:47,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15
[2018-01-28 22:12:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:47,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:12:47,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 15
[2018-01-28 22:12:47,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-01-28 22:12:47,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-01-28 22:12:47,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-01-28 22:12:47,334 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand 16 states.
[2018-01-28 22:12:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:12:47,574 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions.
[2018-01-28 22:12:47,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-28 22:12:47,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84
[2018-01-28 22:12:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:12:47,575 INFO L225 Difference]: With dead ends: 151
[2018-01-28 22:12:47,575 INFO L226 Difference]: Without dead ends: 150
[2018-01-28 22:12:47,576 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650
[2018-01-28 22:12:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-01-28 22:12:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135.
[2018-01-28 22:12:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-01-28 22:12:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions.
[2018-01-28 22:12:47,584 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 84
[2018-01-28 22:12:47,584 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:12:47,584 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions.
[2018-01-28 22:12:47,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-01-28 22:12:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions.
[2018-01-28 22:12:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2018-01-28 22:12:47,585 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:12:47,585 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:12:47,585 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:12:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 416520921, now seen corresponding path program 1 times
[2018-01-28 22:12:47,585 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:12:47,586 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:12:47,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:47,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:47,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:12:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:47,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:12:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:12:49,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:12:49,234 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 22:12:49,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:12:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:12:49,278 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:12:49,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:12:49,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-28 22:12:49,472 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:49,472 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:49,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-28 22:12:49,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-01-28 22:12:49,548 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-28 22:12:49,550 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-28 22:12:49,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,558 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-28 22:12:49,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-01-28 22:12:49,602 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-28 22:12:49,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:12:49,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32
[2018-01-28 22:12:49,625 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 21 treesize of output 20
[2018-01-28 22:12:49,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,642 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 18 treesize of output 26
[2018-01-28 22:12:49,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:49,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:49,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:49,663 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71
[2018-01-28 22:12:49,714 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:49,715 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:49,716 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 50 treesize of output 44
[2018-01-28 22:12:49,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:49,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44
[2018-01-28 22:12:52,394 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,395 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-01-28 22:12:52,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,429 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 86 treesize of output 85
[2018-01-28 22:12:52,431 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-01-28 22:12:52,433 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,433 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 32 treesize of output 55
[2018-01-28 22:12:52,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,452 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,453 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,454 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 85 treesize of output 84
[2018-01-28 22:12:52,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57
[2018-01-28 22:12:52,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,466 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,477 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:52,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107
[2018-01-28 22:12:52,487 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76
[2018-01-28 22:12:52,488 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,499 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,500 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 53 treesize of output 76
[2018-01-28 22:12:52,500 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,510 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-28 22:12:52,512 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,512 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:52,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 61
[2018-01-28 22:12:52,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54
[2018-01-28 22:12:52,516 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:52,524 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:52,530 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:12:52,531 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 22 treesize of output 18
[2018-01-28 22:12:52,531 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,536 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:52,542 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:12:52,563 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 35 treesize of output 33
[2018-01-28 22:12:52,564 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 3
[2018-01-28 22:12:52,564 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,571 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,572 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 77 treesize of output 73
[2018-01-28 22:12:52,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21
[2018-01-28 22:12:52,574 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,588 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:52,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:12:52,606 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:155, output treesize:139
[2018-01-28 22:12:53,164 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:53,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 187
[2018-01-28 22:12:53,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:53,279 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:53,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 113
[2018-01-28 22:12:53,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-28 22:12:53,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts.
[2018-01-28 22:12:53,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:695, output treesize:823
[2018-01-28 22:12:53,699 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 83 DAG size of output 73
[2018-01-28 22:12:53,709 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 132 treesize of output 118
[2018-01-28 22:12:53,711 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 93 treesize of output 76
[2018-01-28 22:12:53,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:53,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:53,836 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 89 treesize of output 81
[2018-01-28 22:12:53,838 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 39 treesize of output 28
[2018-01-28 22:12:53,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:53,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:53,981 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 157 treesize of output 149
[2018-01-28 22:12:53,983 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 41 treesize of output 30
[2018-01-28 22:12:53,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:53,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,109 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 155 treesize of output 147
[2018-01-28 22:12:54,111 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 39 treesize of output 28
[2018-01-28 22:12:54,111 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,233 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 187 treesize of output 175
[2018-01-28 22:12:54,235 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 80 treesize of output 65
[2018-01-28 22:12:54,235 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,251 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,353 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 91 treesize of output 83
[2018-01-28 22:12:54,354 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 41 treesize of output 30
[2018-01-28 22:12:54,355 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,366 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts.
[2018-01-28 22:12:54,462 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:812, output treesize:678
[2018-01-28 22:12:54,657 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 73
[2018-01-28 22:12:54,664 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:54,665 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:54,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 95
[2018-01-28 22:12:54,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,738 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:54,740 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:54,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 145
[2018-01-28 22:12:54,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,802 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:54,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 147
[2018-01-28 22:12:54,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:54,959 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:54,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 81
[2018-01-28 22:12:54,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:12:55,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts.
[2018-01-28 22:12:55,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:656, output treesize:333
[2018-01-28 22:12:55,148 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,149 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,150 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,153 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,154 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107
[2018-01-28 22:12:55,166 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103
[2018-01-28 22:12:55,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-28 22:12:55,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-28 22:12:55,354 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,355 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,355 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,358 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:12:55,360 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 117
[2018-01-28 22:12:55,372 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 117
[2018-01-28 22:12:55,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-28 22:12:55,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-28 22:12:55,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts.
[2018-01-28 22:12:55,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:385, output treesize:603
[2018-01-28 22:13:01,852 WARN L146 SmtUtils]: Spent 6082ms on a formula simplification. DAG size of input: 164 DAG size of output 58
[2018-01-28 22:13:01,864 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:01,866 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:01,870 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75
[2018-01-28 22:13:01,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 8
[2018-01-28 22:13:01,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:01,890 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 34 treesize of output 20
[2018-01-28 22:13:01,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:01,899 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 25 treesize of output 14
[2018-01-28 22:13:01,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:01,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:01,925 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:01,926 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:01,929 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69
[2018-01-28 22:13:01,931 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 5
[2018-01-28 22:13:01,931 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:01,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-01-28 22:13:01,944 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:01,953 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:01,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2018-01-28 22:13:01,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:01,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:01,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:13:01,976 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:163, output treesize:58
[2018-01-28 22:13:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:13:02,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:13:02,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 60
[2018-01-28 22:13:02,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states
[2018-01-28 22:13:02,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants.
[2018-01-28 22:13:02,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3424, Unknown=6, NotChecked=0, Total=3660
[2018-01-28 22:13:02,138 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 61 states.
[2018-01-28 22:13:06,769 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 118 DAG size of output 72
[2018-01-28 22:13:07,717 WARN L146 SmtUtils]: Spent 447ms on a formula simplification. DAG size of input: 81 DAG size of output 70
[2018-01-28 22:13:08,838 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 100 DAG size of output 92
[2018-01-28 22:13:09,093 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 86 DAG size of output 82
[2018-01-28 22:13:09,543 WARN L146 SmtUtils]: Spent 406ms on a formula simplification. DAG size of input: 100 DAG size of output 96
[2018-01-28 22:13:09,879 WARN L146 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 127 DAG size of output 79
[2018-01-28 22:13:10,059 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 103 DAG size of output 63
[2018-01-28 22:13:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:13:10,990 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions.
[2018-01-28 22:13:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-01-28 22:13:10,991 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 91
[2018-01-28 22:13:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:13:10,992 INFO L225 Difference]: With dead ends: 174
[2018-01-28 22:13:10,992 INFO L226 Difference]: Without dead ends: 173
[2018-01-28 22:13:10,995 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=733, Invalid=9361, Unknown=6, NotChecked=0, Total=10100
[2018-01-28 22:13:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2018-01-28 22:13:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144.
[2018-01-28 22:13:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states.
[2018-01-28 22:13:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions.
[2018-01-28 22:13:11,003 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 91
[2018-01-28 22:13:11,004 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:13:11,004 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions.
[2018-01-28 22:13:11,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states.
[2018-01-28 22:13:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions.
[2018-01-28 22:13:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2018-01-28 22:13:11,004 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:13:11,004 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:13:11,004 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:13:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash 416520922, now seen corresponding path program 1 times
[2018-01-28 22:13:11,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:13:11,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:13:11,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:11,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:11,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:11,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:13:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:13:11,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:13:11,839 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-28 22:13:11,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:11,880 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:13:11,904 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-28 22:13:11,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:13:11,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:11,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:11,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:11,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-01-28 22:13:11,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-28 22:13:11,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 8 treesize of output 7
[2018-01-28 22:13:11,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,010 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-28 22:13:12,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29
[2018-01-28 22:13:12,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 18
[2018-01-28 22:13:12,128 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:12,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25
[2018-01-28 22:13:12,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,145 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-28 22:13:12,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:43
[2018-01-28 22:13:12,209 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 3 case distinctions, treesize of input 21 treesize of output 33
[2018-01-28 22:13:12,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21
[2018-01-28 22:13:12,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27
[2018-01-28 22:13:12,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:13:12,268 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-28 22:13:12,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:13:12,286 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:121
[2018-01-28 22:13:12,410 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 87 treesize of output 71
[2018-01-28 22:13:12,412 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 0 case distinctions, treesize of input 40 treesize of output 33
[2018-01-28 22:13:12,414 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:12,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42
[2018-01-28 22:13:12,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,432 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:13:12,433 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 38 treesize of output 35
[2018-01-28 22:13:12,435 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:12,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30
[2018-01-28 22:13:12,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,454 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 74 treesize of output 70
[2018-01-28 22:13:12,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26
[2018-01-28 22:13:12,458 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:12,459 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 26 treesize of output 39
[2018-01-28 22:13:12,459 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,480 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:13:12,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48
[2018-01-28 22:13:12,483 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 0 case distinctions, treesize of input 29 treesize of output 22
[2018-01-28 22:13:12,483 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,488 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,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 48 treesize of output 41
[2018-01-28 22:13:12,526 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 0 case distinctions, treesize of input 22 treesize of output 20
[2018-01-28 22:13:12,570 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:12,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23
[2018-01-28 22:13:12,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19
[2018-01-28 22:13:12,576 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,579 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,583 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,590 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,608 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 2 xjuncts.
[2018-01-28 22:13:12,608 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:71
[2018-01-28 22:13:12,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66
[2018-01-28 22:13:12,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,972 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 83 treesize of output 82
[2018-01-28 22:13:12,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:12,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-28 22:13:12,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:215, output treesize:149
[2018-01-28 22:13:13,084 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-01-28 22:13:13,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,086 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:13,087 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:13,087 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 103 treesize of output 97
[2018-01-28 22:13:13,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,103 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:13:13,105 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 65 treesize of output 79
[2018-01-28 22:13:13,106 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 0 case distinctions, treesize of input 60 treesize of output 49
[2018-01-28 22:13:13,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,126 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 75 treesize of output 61
[2018-01-28 22:13:13,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47
[2018-01-28 22:13:13,129 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:13,136 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:13,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:13,161 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:50
[2018-01-28 22:13:13,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2018-01-28 22:13:13,214 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 5
[2018-01-28 22:13:13,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-01-28 22:13:13,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22
[2018-01-28 22:13:13,230 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 5
[2018-01-28 22:13:13,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,234 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-28 22:13:13,234 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:13,240 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:9
[2018-01-28 22:13:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:13:13,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-28 22:13:13,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [23] total 40
[2018-01-28 22:13:13,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states
[2018-01-28 22:13:13,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2018-01-28 22:13:13,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1484, Unknown=2, NotChecked=0, Total=1640
[2018-01-28 22:13:13,325 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 41 states.
[2018-01-28 22:13:18,284 WARN L146 SmtUtils]: Spent 4158ms on a formula simplification. DAG size of input: 86 DAG size of output 80
[2018-01-28 22:13:18,646 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 73 DAG size of output 49
[2018-01-28 22:13:18,874 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 87 DAG size of output 54
[2018-01-28 22:13:19,021 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 69 DAG size of output 49
[2018-01-28 22:13:19,519 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 67 DAG size of output 48
[2018-01-28 22:13:19,693 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 81 DAG size of output 51
[2018-01-28 22:13:19,827 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 62 DAG size of output 47
[2018-01-28 22:13:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:13:20,256 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions.
[2018-01-28 22:13:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-28 22:13:20,256 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91
[2018-01-28 22:13:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:13:20,257 INFO L225 Difference]: With dead ends: 171
[2018-01-28 22:13:20,257 INFO L226 Difference]: Without dead ends: 170
[2018-01-28 22:13:20,258 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=513, Invalid=4590, Unknown=9, NotChecked=0, Total=5112
[2018-01-28 22:13:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2018-01-28 22:13:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 148.
[2018-01-28 22:13:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states.
[2018-01-28 22:13:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions.
[2018-01-28 22:13:20,271 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 91
[2018-01-28 22:13:20,272 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:13:20,272 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions.
[2018-01-28 22:13:20,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states.
[2018-01-28 22:13:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions.
[2018-01-28 22:13:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2018-01-28 22:13:20,273 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:13:20,273 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:13:20,273 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:13:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash 843568854, now seen corresponding path program 1 times
[2018-01-28 22:13:20,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:13:20,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:13:20,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:20,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:20,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:20,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:13:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-28 22:13:20,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:13:20,369 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-28 22:13:20,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:20,425 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:13:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-28 22:13:20,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-28 22:13:20,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10
[2018-01-28 22:13:20,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-28 22:13:20,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-28 22:13:20,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2018-01-28 22:13:20,504 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 10 states.
[2018-01-28 22:13:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:13:20,873 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions.
[2018-01-28 22:13:20,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-01-28 22:13:20,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93
[2018-01-28 22:13:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:13:20,875 INFO L225 Difference]: With dead ends: 153
[2018-01-28 22:13:20,875 INFO L226 Difference]: Without dead ends: 148
[2018-01-28 22:13:20,875 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240
[2018-01-28 22:13:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2018-01-28 22:13:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148.
[2018-01-28 22:13:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states.
[2018-01-28 22:13:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions.
[2018-01-28 22:13:20,884 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 93
[2018-01-28 22:13:20,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:13:20,885 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions.
[2018-01-28 22:13:20,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-28 22:13:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions.
[2018-01-28 22:13:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-01-28 22:13:20,886 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:13:20,886 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:13:20,886 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:13:20,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1294453949, now seen corresponding path program 1 times
[2018-01-28 22:13:20,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:13:20,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:13:20,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:20,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:20,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:20,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:13:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:13:21,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:13:21,371 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-28 22:13:21,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:21,414 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:13:21,434 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-28 22:13:21,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:13:21,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-01-28 22:13:21,593 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-28 22:13:21,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:13:21,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,602 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-28 22:13:21,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:66
[2018-01-28 22:13:21,605 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) 0)) (exists ((|append_#t~ite8.offset| Int)) (= (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (store (select |c_old(#memory_$Pointer$.offset)| .cse1) 0 (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite8.offset|))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| 0))) |c_#memory_$Pointer$.offset|))) is different from true
[2018-01-28 22:13:21,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2018-01-28 22:13:21,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26
[2018-01-28 22:13:21,636 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:21,637 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 26 treesize of output 39
[2018-01-28 22:13:21,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,650 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:13:21,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48
[2018-01-28 22:13:21,652 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 0 case distinctions, treesize of input 29 treesize of output 22
[2018-01-28 22:13:21,652 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,657 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,666 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 63 treesize of output 47
[2018-01-28 22:13:21,668 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 0 case distinctions, treesize of input 40 treesize of output 33
[2018-01-28 22:13:21,670 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:21,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42
[2018-01-28 22:13:21,671 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,676 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,683 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:13:21,683 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 38 treesize of output 35
[2018-01-28 22:13:21,685 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:21,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30
[2018-01-28 22:13:21,687 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,691 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,708 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-28 22:13:21,709 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:76, output treesize:61
[2018-01-28 22:13:21,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34
[2018-01-28 22:13:21,833 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 34 treesize of output 23
[2018-01-28 22:13:21,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:40
[2018-01-28 22:13:21,880 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-28 22:13:21,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:21,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38
[2018-01-28 22:13:21,933 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:21,934 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:21,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-28 22:13:21,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,960 INFO L682 Elim1Store]: detected equality via solver
[2018-01-28 22:13:21,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 42
[2018-01-28 22:13:21,963 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 0 case distinctions, treesize of input 31 treesize of output 22
[2018-01-28 22:13:21,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:21,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:21,973 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30
[2018-01-28 22:13:22,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22
[2018-01-28 22:13:22,014 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 5
[2018-01-28 22:13:22,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:22,018 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-28 22:13:22,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:22,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:22,023 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-28 22:13:22,023 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3
[2018-01-28 22:13:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-01-28 22:13:22,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:13:22,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 34
[2018-01-28 22:13:22,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states
[2018-01-28 22:13:22,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2018-01-28 22:13:22,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=4, NotChecked=64, Total=1190
[2018-01-28 22:13:22,069 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 35 states.
[2018-01-28 22:13:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:13:22,928 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions.
[2018-01-28 22:13:22,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-01-28 22:13:22,928 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 96
[2018-01-28 22:13:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:13:22,929 INFO L225 Difference]: With dead ends: 159
[2018-01-28 22:13:22,929 INFO L226 Difference]: Without dead ends: 158
[2018-01-28 22:13:22,930 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=2903, Unknown=9, NotChecked=112, Total=3422
[2018-01-28 22:13:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-01-28 22:13:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153.
[2018-01-28 22:13:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states.
[2018-01-28 22:13:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions.
[2018-01-28 22:13:22,938 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 96
[2018-01-28 22:13:22,938 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:13:22,938 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions.
[2018-01-28 22:13:22,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states.
[2018-01-28 22:13:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions.
[2018-01-28 22:13:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-01-28 22:13:22,939 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:13:22,939 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:13:22,939 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:13:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1294453948, now seen corresponding path program 1 times
[2018-01-28 22:13:22,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:13:22,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:13:22,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:22,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:22,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:22,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:13:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2018-01-28 22:13:22,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 22:13:22,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-28 22:13:22,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-28 22:13:22,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-28 22:13:22,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-28 22:13:22,999 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand 5 states.
[2018-01-28 22:13:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:13:23,116 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions.
[2018-01-28 22:13:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 22:13:23,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96
[2018-01-28 22:13:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:13:23,117 INFO L225 Difference]: With dead ends: 153
[2018-01-28 22:13:23,117 INFO L226 Difference]: Without dead ends: 152
[2018-01-28 22:13:23,118 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-28 22:13:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2018-01-28 22:13:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152.
[2018-01-28 22:13:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2018-01-28 22:13:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions.
[2018-01-28 22:13:23,131 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 96
[2018-01-28 22:13:23,131 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:13:23,131 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions.
[2018-01-28 22:13:23,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-28 22:13:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions.
[2018-01-28 22:13:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2018-01-28 22:13:23,132 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:13:23,132 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:13:23,132 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:13:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1570272932, now seen corresponding path program 1 times
[2018-01-28 22:13:23,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:13:23,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:13:23,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:23,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:23,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:23,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:13:23,805 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 32 DAG size of output 24
[2018-01-28 22:13:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 22:13:24,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:13:24,167 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-28 22:13:24,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:24,210 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:13:24,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-28 22:13:24,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-28 22:13:24,269 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-28 22:13:24,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-28 22:13:24,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,278 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-28 22:13:24,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23
[2018-01-28 22:13:24,304 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:24,305 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:24,305 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 15 treesize of output 8
[2018-01-28 22:13:24,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25
[2018-01-28 22:13:24,555 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~4.base Int) (|append_#t~ite8.base| Int)) (and (= 0 (select |c_old(#valid)| append_~item~4.base)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~4.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~4.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite8.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~4.base))) |c_#memory_$Pointer$.base|))) is different from true
[2018-01-28 22:13:24,584 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:24,584 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:24,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-28 22:13:24,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,597 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 43 treesize of output 47
[2018-01-28 22:13:24,599 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18
[2018-01-28 22:13:24,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19
[2018-01-28 22:13:24,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,618 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 41
[2018-01-28 22:13:24,621 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 30 treesize of output 24
[2018-01-28 22:13:24,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,628 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,642 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:28
[2018-01-28 22:13:24,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 23 treesize of output 19
[2018-01-28 22:13:24,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 19 treesize of output 11
[2018-01-28 22:13:24,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:39
[2018-01-28 22:13:24,854 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:24,857 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 44 treesize of output 40
[2018-01-28 22:13:24,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32
[2018-01-28 22:13:24,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:24,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:24,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:24,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:40
[2018-01-28 22:13:24,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29
[2018-01-28 22:13:24,921 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 5
[2018-01-28 22:13:24,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-01-28 22:13:24,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,940 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-28 22:13:24,940 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14
[2018-01-28 22:13:24,943 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-28 22:13:24,944 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-28 22:13:24,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-28 22:13:24,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-28 22:13:24,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15
[2018-01-28 22:13:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-01-28 22:13:25,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:13:25,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43
[2018-01-28 22:13:25,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-01-28 22:13:25,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-01-28 22:13:25,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1663, Unknown=5, NotChecked=82, Total=1892
[2018-01-28 22:13:25,042 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 44 states.
[2018-01-28 22:13:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:13:26,488 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions.
[2018-01-28 22:13:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-01-28 22:13:26,489 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 98
[2018-01-28 22:13:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:13:26,490 INFO L225 Difference]: With dead ends: 173
[2018-01-28 22:13:26,490 INFO L226 Difference]: Without dead ends: 172
[2018-01-28 22:13:26,490 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=422, Invalid=3994, Unknown=10, NotChecked=130, Total=4556
[2018-01-28 22:13:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states.
[2018-01-28 22:13:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154.
[2018-01-28 22:13:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states.
[2018-01-28 22:13:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions.
[2018-01-28 22:13:26,499 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 98
[2018-01-28 22:13:26,499 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:13:26,499 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions.
[2018-01-28 22:13:26,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-01-28 22:13:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions.
[2018-01-28 22:13:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2018-01-28 22:13:26,499 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:13:26,500 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:13:26,500 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:13:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1143632949, now seen corresponding path program 1 times
[2018-01-28 22:13:26,500 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:13:26,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:13:26,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:26,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:26,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:26,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:13:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-28 22:13:26,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 22:13:26,566 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-28 22:13:26,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:26,615 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 22:13:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-01-28 22:13:26,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 22:13:26,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11
[2018-01-28 22:13:26,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-28 22:13:26,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-28 22:13:26,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2018-01-28 22:13:26,663 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 11 states.
[2018-01-28 22:13:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 22:13:26,800 INFO L93 Difference]: Finished difference Result 194 states and 200 transitions.
[2018-01-28 22:13:26,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-28 22:13:26,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105
[2018-01-28 22:13:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 22:13:26,801 INFO L225 Difference]: With dead ends: 194
[2018-01-28 22:13:26,802 INFO L226 Difference]: Without dead ends: 171
[2018-01-28 22:13:26,802 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342
[2018-01-28 22:13:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2018-01-28 22:13:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166.
[2018-01-28 22:13:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states.
[2018-01-28 22:13:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions.
[2018-01-28 22:13:26,814 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 105
[2018-01-28 22:13:26,814 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 22:13:26,814 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions.
[2018-01-28 22:13:26,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-28 22:13:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions.
[2018-01-28 22:13:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2018-01-28 22:13:26,815 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 22:13:26,815 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 22:13:26,815 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-01-28 22:13:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash 479286088, now seen corresponding path program 1 times
[2018-01-28 22:13:26,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 22:13:26,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 22:13:26,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:26,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 22:13:26,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 22:13:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 22:13:26,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 22:13:28,848 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 28 DAG size of output 20
[2018-01-28 22:13:29,172 WARN L146 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 37 DAG size of output 20
[2018-01-28 22:13:29,619 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 62 DAG size of output 54
[2018-01-28 22:13:30,392 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 92 DAG size of output 60
[2018-01-28 22:13:30,547 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 81 DAG size of output 60
[2018-01-28 22:13:30,715 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 87 DAG size of output 64
[2018-01-28 22:13:30,882 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 75 DAG size of output 64
Received shutdown request...
[2018-01-28 22:13:31,969 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-01-28 22:13:31,973 WARN L185 ceAbstractionStarter]: Timeout
[2018-01-28 22:13:31,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:13:31 BoogieIcfgContainer
[2018-01-28 22:13:31,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-28 22:13:31,974 INFO L168 Benchmark]: Toolchain (without parser) took 121075.94 ms. Allocated memory was 297.8 MB in the beginning and 857.7 MB in the end (delta: 559.9 MB). Free memory was 257.8 MB in the beginning and 661.2 MB in the end (delta: -403.3 MB). Peak memory consumption was 156.6 MB. Max. memory is 5.3 GB.
[2018-01-28 22:13:31,975 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-28 22:13:31,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.95 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 246.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
[2018-01-28 22:13:31,976 INFO L168 Benchmark]: Boogie Preprocessor took 39.03 ms. Allocated memory is still 297.8 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-28 22:13:31,976 INFO L168 Benchmark]: RCFGBuilder took 503.93 ms. Allocated memory is still 297.8 MB. Free memory was 244.8 MB in the beginning and 213.9 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB.
[2018-01-28 22:13:31,976 INFO L168 Benchmark]: TraceAbstraction took 120316.51 ms. Allocated memory was 297.8 MB in the beginning and 857.7 MB in the end (delta: 559.9 MB). Free memory was 213.9 MB in the beginning and 661.2 MB in the end (delta: -447.3 MB). Peak memory consumption was 112.6 MB. Max. memory is 5.3 GB.
[2018-01-28 22:13:31,978 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.12 ms. Allocated memory is still 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 209.95 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 246.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 39.03 ms. Allocated memory is still 297.8 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 503.93 ms. Allocated memory is still 297.8 MB. Free memory was 244.8 MB in the beginning and 213.9 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 120316.51 ms. Allocated memory was 297.8 MB in the beginning and 857.7 MB in the end (delta: 559.9 MB). Free memory was 213.9 MB in the beginning and 661.2 MB in the end (delta: -447.3 MB). Peak memory consumption was 112.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 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 108 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 125 locations, 43 error locations. TIMEOUT Result, 120.2s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 71.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2927 SDtfs, 4942 SDslu, 22859 SDs, 0 SdLazy, 17102 SolverSat, 848 SolverUnsat, 120 SolverUnknown, 0 SolverNotchecked, 25.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2091 GetRequests, 986 SyntacticMatches, 52 SemanticMatches, 1053 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15849 ImplicationChecksByTransitivity, 73.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=21, 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.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 558 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 40.9s InterpolantComputationTime, 3188 NumberOfCodeBlocks, 3188 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3139 ConstructedInterpolants, 168 QuantifiedInterpolants, 5432448 SizeOfPredicates, 299 NumberOfNonLiveVariables, 4468 ConjunctsInSsa, 806 ConjunctsInUnsatCore, 49 InterpolantComputations, 24 PerfectInterpolantSequences, 363/714 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/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-13-31-988.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-13-31-988.csv
Completed graceful shutdown