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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 09:44:29,964 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 09:44:29,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 09:44:29,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 09:44:29,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 09:44:29,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 09:44:29,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 09:44:29,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 09:44:29,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 09:44:29,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 09:44:29,981 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 09:44:29,981 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 09:44:29,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 09:44:29,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 09:44:29,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 09:44:29,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 09:44:29,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 09:44:29,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 09:44:29,989 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 09:44:29,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 09:44:29,991 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 09:44:29,991 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 09:44:29,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 09:44:29,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 09:44:29,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 09:44:29,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 09:44:29,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 09:44:29,994 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 09:44:29,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 09:44:29,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 09:44:29,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 09:44:29,996 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf
[2018-02-02 09:44:30,005 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 09:44:30,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 09:44:30,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 09:44:30,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 09:44:30,006 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 09:44:30,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 09:44:30,007 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 09:44:30,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 09:44:30,007 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 09:44:30,007 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 09:44:30,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 09:44:30,007 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 09:44:30,008 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 09:44:30,008 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 09:44:30,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 09:44:30,008 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 09:44:30,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 09:44:30,008 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 09:44:30,009 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 09:44:30,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 09:44:30,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:44:30,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 09:44:30,009 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-02 09:44:30,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 09:44:30,009 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-02 09:44:30,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 09:44:30,047 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 09:44:30,050 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 09:44:30,052 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 09:44:30,052 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 09:44:30,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i
[2018-02-02 09:44:30,203 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 09:44:30,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 09:44:30,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 09:44:30,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 09:44:30,212 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 09:44:30,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3643a13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30, skipping insertion in model container
[2018-02-02 09:44:30,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,232 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:44:30,275 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:44:30,362 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:44:30,377 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:44:30,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30 WrapperNode
[2018-02-02 09:44:30,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 09:44:30,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 09:44:30,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 09:44:30,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 09:44:30,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
[2018-02-02 09:44:30,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 09:44:30,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 09:44:30,410 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 09:44:30,411 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 09:44:30,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:44:30,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 09:44:30,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 09:44:30,445 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 09:44:30,445 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 09:44:30,445 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 09:44:30,445 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 09:44:30,445 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 09:44:30,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 09:44:30,447 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 09:44:30,796 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 09:44:30,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:44:30 BoogieIcfgContainer
[2018-02-02 09:44:30,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 09:44:30,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 09:44:30,797 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 09:44:30,799 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 09:44:30,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:44:30" (1/3) ...
[2018-02-02 09:44:30,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d1c6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:44:30, skipping insertion in model container
[2018-02-02 09:44:30,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:44:30" (2/3) ...
[2018-02-02 09:44:30,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d1c6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:44:30, skipping insertion in model container
[2018-02-02 09:44:30,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:44:30" (3/3) ...
[2018-02-02 09:44:30,801 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i
[2018-02-02 09:44:30,806 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 09:44:30,811 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations.
[2018-02-02 09:44:30,835 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 09:44:30,835 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 09:44:30,835 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 09:44:30,835 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 09:44:30,835 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 09:44:30,836 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 09:44:30,836 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 09:44:30,836 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 09:44:30,836 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 09:44:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states.
[2018-02-02 09:44:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 09:44:30,854 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:30,855 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:30,855 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1658030564, now seen corresponding path program 1 times
[2018-02-02 09:44:30,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:30,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:30,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:30,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:30,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:30,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:30,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:30,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:44:30,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:44:30,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:44:30,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:44:30,978 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states.
[2018-02-02 09:44:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:31,209 INFO L93 Difference]: Finished difference Result 147 states and 154 transitions.
[2018-02-02 09:44:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:44:31,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 09:44:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:31,218 INFO L225 Difference]: With dead ends: 147
[2018-02-02 09:44:31,218 INFO L226 Difference]: Without dead ends: 143
[2018-02-02 09:44:31,219 INFO L554 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-02-02 09:44:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2018-02-02 09:44:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128.
[2018-02-02 09:44:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states.
[2018-02-02 09:44:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions.
[2018-02-02 09:44:31,259 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 8
[2018-02-02 09:44:31,259 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:31,259 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions.
[2018-02-02 09:44:31,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:44:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions.
[2018-02-02 09:44:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 09:44:31,260 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:31,260 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:31,260 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:31,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1658030565, now seen corresponding path program 1 times
[2018-02-02 09:44:31,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:31,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:31,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:31,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:31,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:31,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:31,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:31,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:44:31,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:44:31,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:44:31,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:44:31,348 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 4 states.
[2018-02-02 09:44:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:31,473 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions.
[2018-02-02 09:44:31,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:44:31,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 09:44:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:31,475 INFO L225 Difference]: With dead ends: 140
[2018-02-02 09:44:31,475 INFO L226 Difference]: Without dead ends: 140
[2018-02-02 09:44:31,476 INFO L554 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-02-02 09:44:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2018-02-02 09:44:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132.
[2018-02-02 09:44:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states.
[2018-02-02 09:44:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions.
[2018-02-02 09:44:31,488 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 8
[2018-02-02 09:44:31,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:31,488 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions.
[2018-02-02 09:44:31,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:44:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions.
[2018-02-02 09:44:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 09:44:31,489 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:31,489 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:31,489 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:31,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1172213647, now seen corresponding path program 1 times
[2018-02-02 09:44:31,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:31,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:31,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:31,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:31,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:31,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:31,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:31,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:44:31,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:44:31,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:44:31,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:44:31,555 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 4 states.
[2018-02-02 09:44:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:31,658 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions.
[2018-02-02 09:44:31,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:44:31,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2018-02-02 09:44:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:31,659 INFO L225 Difference]: With dead ends: 140
[2018-02-02 09:44:31,659 INFO L226 Difference]: Without dead ends: 140
[2018-02-02 09:44:31,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2018-02-02 09:44:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124.
[2018-02-02 09:44:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states.
[2018-02-02 09:44:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions.
[2018-02-02 09:44:31,663 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 16
[2018-02-02 09:44:31,664 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:31,664 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions.
[2018-02-02 09:44:31,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:44:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions.
[2018-02-02 09:44:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 09:44:31,664 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:31,664 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:31,664 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1172213646, now seen corresponding path program 1 times
[2018-02-02 09:44:31,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:31,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:31,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:31,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:31,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:31,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:31,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:31,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:44:31,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 09:44:31,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 09:44:31,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:44:31,752 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 7 states.
[2018-02-02 09:44:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:31,983 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions.
[2018-02-02 09:44:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:44:31,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2018-02-02 09:44:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:31,985 INFO L225 Difference]: With dead ends: 164
[2018-02-02 09:44:31,985 INFO L226 Difference]: Without dead ends: 164
[2018-02-02 09:44:31,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2018-02-02 09:44:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2018-02-02 09:44:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139.
[2018-02-02 09:44:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states.
[2018-02-02 09:44:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions.
[2018-02-02 09:44:31,992 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 16
[2018-02-02 09:44:31,992 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:31,992 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions.
[2018-02-02 09:44:31,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 09:44:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions.
[2018-02-02 09:44:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 09:44:31,993 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:31,993 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:31,993 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1215883307, now seen corresponding path program 1 times
[2018-02-02 09:44:31,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:31,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:31,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:31,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:31,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:32,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:32,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:32,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:44:32,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:44:32,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:44:32,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:32,066 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 5 states.
[2018-02-02 09:44:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:32,253 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions.
[2018-02-02 09:44:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:44:32,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 09:44:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:32,254 INFO L225 Difference]: With dead ends: 216
[2018-02-02 09:44:32,254 INFO L226 Difference]: Without dead ends: 216
[2018-02-02 09:44:32,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:44:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2018-02-02 09:44:32,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 138.
[2018-02-02 09:44:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states.
[2018-02-02 09:44:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions.
[2018-02-02 09:44:32,258 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 18
[2018-02-02 09:44:32,258 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:32,258 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions.
[2018-02-02 09:44:32,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:44:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions.
[2018-02-02 09:44:32,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 09:44:32,259 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:32,259 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:32,259 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:32,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1215883308, now seen corresponding path program 1 times
[2018-02-02 09:44:32,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:32,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:32,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:32,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:32,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:32,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:32,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:32,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:44:32,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:44:32,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:44:32,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:32,296 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 5 states.
[2018-02-02 09:44:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:32,414 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions.
[2018-02-02 09:44:32,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:44:32,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 09:44:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:32,415 INFO L225 Difference]: With dead ends: 192
[2018-02-02 09:44:32,415 INFO L226 Difference]: Without dead ends: 192
[2018-02-02 09:44:32,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:44:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2018-02-02 09:44:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137.
[2018-02-02 09:44:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states.
[2018-02-02 09:44:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions.
[2018-02-02 09:44:32,419 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 18
[2018-02-02 09:44:32,419 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:32,419 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions.
[2018-02-02 09:44:32,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:44:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions.
[2018-02-02 09:44:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 09:44:32,420 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:32,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:32,420 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash -338658602, now seen corresponding path program 1 times
[2018-02-02 09:44:32,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:32,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:32,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:32,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:32,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:32,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:32,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:32,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-02 09:44:32,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 09:44:32,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 09:44:32,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:44:32,491 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 9 states.
[2018-02-02 09:44:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:32,715 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions.
[2018-02-02 09:44:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:44:32,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22
[2018-02-02 09:44:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:32,716 INFO L225 Difference]: With dead ends: 151
[2018-02-02 09:44:32,716 INFO L226 Difference]: Without dead ends: 151
[2018-02-02 09:44:32,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182
[2018-02-02 09:44:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2018-02-02 09:44:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 136.
[2018-02-02 09:44:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states.
[2018-02-02 09:44:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions.
[2018-02-02 09:44:32,720 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 22
[2018-02-02 09:44:32,720 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:32,720 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions.
[2018-02-02 09:44:32,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 09:44:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions.
[2018-02-02 09:44:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 09:44:32,721 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:32,721 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:32,721 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:32,721 INFO L82 PathProgramCache]: Analyzing trace with hash -338658601, now seen corresponding path program 1 times
[2018-02-02 09:44:32,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:32,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:32,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:32,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:32,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:32,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:32,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:32,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-02-02 09:44:32,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 09:44:32,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 09:44:32,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-02-02 09:44:32,841 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 10 states.
[2018-02-02 09:44:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:33,288 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions.
[2018-02-02 09:44:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 09:44:33,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22
[2018-02-02 09:44:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:33,289 INFO L225 Difference]: With dead ends: 156
[2018-02-02 09:44:33,289 INFO L226 Difference]: Without dead ends: 156
[2018-02-02 09:44:33,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420
[2018-02-02 09:44:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2018-02-02 09:44:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130.
[2018-02-02 09:44:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states.
[2018-02-02 09:44:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions.
[2018-02-02 09:44:33,292 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 22
[2018-02-02 09:44:33,293 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:33,293 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions.
[2018-02-02 09:44:33,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 09:44:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions.
[2018-02-02 09:44:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 09:44:33,293 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:33,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:33,294 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 877684228, now seen corresponding path program 1 times
[2018-02-02 09:44:33,294 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:33,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:33,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:33,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:33,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:33,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:33,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:44:33,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:44:33,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:44:33,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:33,351 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 5 states.
[2018-02-02 09:44:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:33,453 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions.
[2018-02-02 09:44:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:44:33,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28
[2018-02-02 09:44:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:33,454 INFO L225 Difference]: With dead ends: 148
[2018-02-02 09:44:33,454 INFO L226 Difference]: Without dead ends: 148
[2018-02-02 09:44:33,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:44:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2018-02-02 09:44:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130.
[2018-02-02 09:44:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states.
[2018-02-02 09:44:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions.
[2018-02-02 09:44:33,458 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 28
[2018-02-02 09:44:33,459 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:33,459 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions.
[2018-02-02 09:44:33,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:44:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions.
[2018-02-02 09:44:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 09:44:33,460 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:33,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:33,460 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762849, now seen corresponding path program 1 times
[2018-02-02 09:44:33,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:33,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:33,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:33,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:33,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:33,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:33,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:44:33,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:44:33,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:44:33,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:33,542 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 5 states.
[2018-02-02 09:44:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:33,654 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions.
[2018-02-02 09:44:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:44:33,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29
[2018-02-02 09:44:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:33,656 INFO L225 Difference]: With dead ends: 138
[2018-02-02 09:44:33,656 INFO L226 Difference]: Without dead ends: 138
[2018-02-02 09:44:33,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:44:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2018-02-02 09:44:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129.
[2018-02-02 09:44:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-02-02 09:44:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions.
[2018-02-02 09:44:33,660 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 29
[2018-02-02 09:44:33,660 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:33,660 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions.
[2018-02-02 09:44:33,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:44:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions.
[2018-02-02 09:44:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 09:44:33,661 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:33,661 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:33,661 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1220341734, now seen corresponding path program 1 times
[2018-02-02 09:44:33,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:33,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:33,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:33,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:33,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:33,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:33,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:44:33,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:44:33,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:44:33,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:33,701 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 5 states.
[2018-02-02 09:44:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:33,910 INFO L93 Difference]: Finished difference Result 195 states and 209 transitions.
[2018-02-02 09:44:33,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:44:33,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29
[2018-02-02 09:44:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:33,918 INFO L225 Difference]: With dead ends: 195
[2018-02-02 09:44:33,918 INFO L226 Difference]: Without dead ends: 195
[2018-02-02 09:44:33,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:44:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states.
[2018-02-02 09:44:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 128.
[2018-02-02 09:44:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states.
[2018-02-02 09:44:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions.
[2018-02-02 09:44:33,922 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 29
[2018-02-02 09:44:33,922 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:33,922 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions.
[2018-02-02 09:44:33,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:44:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions.
[2018-02-02 09:44:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 09:44:33,923 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:33,923 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:33,923 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1220341733, now seen corresponding path program 1 times
[2018-02-02 09:44:33,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:33,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:33,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:33,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:33,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44: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-02-02 09:44:33,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:33,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:44:33,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:44:33,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:44:33,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:33,985 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states.
[2018-02-02 09:44:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:34,250 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions.
[2018-02-02 09:44:34,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:44:34,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29
[2018-02-02 09:44:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:34,252 INFO L225 Difference]: With dead ends: 220
[2018-02-02 09:44:34,252 INFO L226 Difference]: Without dead ends: 220
[2018-02-02 09:44:34,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:44:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states.
[2018-02-02 09:44:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 127.
[2018-02-02 09:44:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states.
[2018-02-02 09:44:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions.
[2018-02-02 09:44:34,255 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 29
[2018-02-02 09:44:34,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:34,256 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions.
[2018-02-02 09:44:34,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:44:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions.
[2018-02-02 09:44:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 09:44:34,257 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:34,257 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:34,257 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1085863836, now seen corresponding path program 1 times
[2018-02-02 09:44:34,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:34,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:34,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:34,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:34,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:34,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:34,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:34,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 09:44:34,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 09:44:34,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 09:44:34,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:44:34,350 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 8 states.
[2018-02-02 09:44:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:34,552 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions.
[2018-02-02 09:44:34,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 09:44:34,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33
[2018-02-02 09:44:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:34,553 INFO L225 Difference]: With dead ends: 133
[2018-02-02 09:44:34,553 INFO L226 Difference]: Without dead ends: 133
[2018-02-02 09:44:34,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2018-02-02 09:44:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2018-02-02 09:44:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126.
[2018-02-02 09:44:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2018-02-02 09:44:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions.
[2018-02-02 09:44:34,555 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 33
[2018-02-02 09:44:34,555 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:34,555 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions.
[2018-02-02 09:44:34,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 09:44:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions.
[2018-02-02 09:44:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 09:44:34,555 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:34,555 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:34,555 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1085863837, now seen corresponding path program 1 times
[2018-02-02 09:44:34,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:34,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:34,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:34,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:34,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:34,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:34,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:34,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-02 09:44:34,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 09:44:34,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 09:44:34,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:44:34,671 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 9 states.
[2018-02-02 09:44:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:34,982 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions.
[2018-02-02 09:44:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:44:34,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33
[2018-02-02 09:44:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:34,982 INFO L225 Difference]: With dead ends: 130
[2018-02-02 09:44:34,982 INFO L226 Difference]: Without dead ends: 130
[2018-02-02 09:44:34,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182
[2018-02-02 09:44:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2018-02-02 09:44:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112.
[2018-02-02 09:44:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2018-02-02 09:44:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions.
[2018-02-02 09:44:34,985 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 33
[2018-02-02 09:44:34,985 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:34,985 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions.
[2018-02-02 09:44:34,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 09:44:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions.
[2018-02-02 09:44:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-02 09:44:34,986 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:34,986 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:34,986 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash -499110813, now seen corresponding path program 1 times
[2018-02-02 09:44:34,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:34,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:34,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:34,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:34,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:34,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:35,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:35,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:44:35,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:44:35,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:44:35,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:44:35,057 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 5 states.
[2018-02-02 09:44:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:35,194 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions.
[2018-02-02 09:44:35,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:44:35,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35
[2018-02-02 09:44:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:35,195 INFO L225 Difference]: With dead ends: 132
[2018-02-02 09:44:35,195 INFO L226 Difference]: Without dead ends: 117
[2018-02-02 09:44:35,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:44:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2018-02-02 09:44:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115.
[2018-02-02 09:44:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states.
[2018-02-02 09:44:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions.
[2018-02-02 09:44:35,197 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 35
[2018-02-02 09:44:35,197 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:35,197 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions.
[2018-02-02 09:44:35,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:44:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions.
[2018-02-02 09:44:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2018-02-02 09:44:35,197 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:35,198 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:35,198 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash 413563347, now seen corresponding path program 1 times
[2018-02-02 09:44:35,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:35,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:35,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:35,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:35,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:35,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:35,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:35,508 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:35,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:35,563 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:35,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:44:35,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,689 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:35,690 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:35,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:44:35,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19
[2018-02-02 09:44:35,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:35,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:35,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:35,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:35,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31
[2018-02-02 09:44:35,824 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:35,828 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 60 treesize of output 64
[2018-02-02 09:44:35,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:35,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,849 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:35,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 09:44:35,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:35,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:35,868 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-02-02 09:44:35,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57
[2018-02-02 09:44:35,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57
[2018-02-02 09:44:35,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 09:44:35,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:36,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:36,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67
[2018-02-02 09:44:36,030 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 20 treesize of output 17
[2018-02-02 09:44:36,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77
[2018-02-02 09:44:36,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31
[2018-02-02 09:44:36,060 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:36,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:36,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:36,097 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:129
[2018-02-02 09:44:36,153 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 102 treesize of output 92
[2018-02-02 09:44:36,155 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:36,157 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 18
[2018-02-02 09:44:36,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45
[2018-02-02 09:44:36,231 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:36,242 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 18
[2018-02-02 09:44:36,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,266 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-02-02 09:44:36,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47
[2018-02-02 09:44:36,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33
[2018-02-02 09:44:36,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:36,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17
[2018-02-02 09:44:36,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20
[2018-02-02 09:44:36,390 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-02-02 09:44:36,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:36,396 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:36,401 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9
[2018-02-02 09:44:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:36,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:36,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30
[2018-02-02 09:44:36,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states
[2018-02-02 09:44:36,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2018-02-02 09:44:36,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930
[2018-02-02 09:44:36,489 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 31 states.
[2018-02-02 09:44:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:38,577 INFO L93 Difference]: Finished difference Result 245 states and 263 transitions.
[2018-02-02 09:44:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 09:44:38,578 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49
[2018-02-02 09:44:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:38,580 INFO L225 Difference]: With dead ends: 245
[2018-02-02 09:44:38,580 INFO L226 Difference]: Without dead ends: 245
[2018-02-02 09:44:38,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=669, Invalid=2991, Unknown=0, NotChecked=0, Total=3660
[2018-02-02 09:44:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2018-02-02 09:44:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 152.
[2018-02-02 09:44:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2018-02-02 09:44:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions.
[2018-02-02 09:44:38,586 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 49
[2018-02-02 09:44:38,587 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:38,587 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions.
[2018-02-02 09:44:38,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states.
[2018-02-02 09:44:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions.
[2018-02-02 09:44:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2018-02-02 09:44:38,587 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:38,588 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:38,588 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 413563346, now seen corresponding path program 1 times
[2018-02-02 09:44:38,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:38,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:38,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:38,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:38,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:38,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:38,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:38,897 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:38,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:38,935 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:38,970 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:38,970 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:38,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-02-02 09:44:38,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:38,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:38,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21
[2018-02-02 09:44:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:39,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:39,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29
[2018-02-02 09:44:39,067 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:39,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43
[2018-02-02 09:44:39,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:39,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,086 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-02-02 09:44:39,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42
[2018-02-02 09:44:39,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44
[2018-02-02 09:44:39,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 09:44:39,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:39,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:39,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:39,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:84
[2018-02-02 09:44:39,274 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 60 treesize of output 50
[2018-02-02 09:44:39,277 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:39,278 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 18
[2018-02-02 09:44:39,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,293 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-02-02 09:44:39,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34
[2018-02-02 09:44:39,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24
[2018-02-02 09:44:39,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:39,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,353 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 19 treesize of output 10
[2018-02-02 09:44:39,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:39,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:39,360 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15
[2018-02-02 09:44:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:39,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:39,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30
[2018-02-02 09:44:39,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states
[2018-02-02 09:44:39,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2018-02-02 09:44:39,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930
[2018-02-02 09:44:39,422 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 31 states.
[2018-02-02 09:44:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:40,940 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions.
[2018-02-02 09:44:40,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-02-02 09:44:40,940 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49
[2018-02-02 09:44:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:40,941 INFO L225 Difference]: With dead ends: 244
[2018-02-02 09:44:40,941 INFO L226 Difference]: Without dead ends: 244
[2018-02-02 09:44:40,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=866, Invalid=3294, Unknown=0, NotChecked=0, Total=4160
[2018-02-02 09:44:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states.
[2018-02-02 09:44:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152.
[2018-02-02 09:44:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2018-02-02 09:44:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions.
[2018-02-02 09:44:40,944 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 49
[2018-02-02 09:44:40,944 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:40,944 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions.
[2018-02-02 09:44:40,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states.
[2018-02-02 09:44:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions.
[2018-02-02 09:44:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 09:44:40,945 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:40,945 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:40,945 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash 176207444, now seen corresponding path program 1 times
[2018-02-02 09:44:40,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:40,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:40,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:40,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:40,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:40,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:41,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:41,734 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:41,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:41,764 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:41,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:44:41,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,822 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:41,822 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:41,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:44:41,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19
[2018-02-02 09:44:41,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:41,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:41,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:41,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:41,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31
[2018-02-02 09:44:41,977 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:41,980 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 60 treesize of output 64
[2018-02-02 09:44:41,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:41,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:41,999 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:42,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 09:44:42,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:42,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,014 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-02-02 09:44:42,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57
[2018-02-02 09:44:42,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57
[2018-02-02 09:44:42,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 09:44:42,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:42,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:42,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67
[2018-02-02 09:44:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17
[2018-02-02 09:44:42,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77
[2018-02-02 09:44:42,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31
[2018-02-02 09:44:42,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:42,215 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:42,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:42,262 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:135
[2018-02-02 09:44:42,322 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 21 treesize of output 3
[2018-02-02 09:44:42,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,341 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 114 treesize of output 104
[2018-02-02 09:44:42,343 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:42,345 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 18
[2018-02-02 09:44:42,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45
[2018-02-02 09:44:42,369 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:42,370 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 18
[2018-02-02 09:44:42,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,385 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 21 treesize of output 14
[2018-02-02 09:44:42,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:42,388 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,389 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:42,396 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57
[2018-02-02 09:44:42,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37
[2018-02-02 09:44:42,478 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 32 treesize of output 21
[2018-02-02 09:44:42,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:42,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20
[2018-02-02 09:44:42,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:42,495 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,498 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-02-02 09:44:42,499 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:42,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:42,504 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19
[2018-02-02 09:44:42,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-02-02 09:44:42,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12
[2018-02-02 09:44:42,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:42,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:42,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:42,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21
[2018-02-02 09:44:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:42,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:42,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 38
[2018-02-02 09:44:42,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-02-02 09:44:42,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-02-02 09:44:42,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1294, Unknown=1, NotChecked=0, Total=1406
[2018-02-02 09:44:42,659 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 38 states.
[2018-02-02 09:44:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:45,276 INFO L93 Difference]: Finished difference Result 216 states and 229 transitions.
[2018-02-02 09:44:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-02-02 09:44:45,276 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53
[2018-02-02 09:44:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:45,276 INFO L225 Difference]: With dead ends: 216
[2018-02-02 09:44:45,276 INFO L226 Difference]: Without dead ends: 216
[2018-02-02 09:44:45,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=740, Invalid=4228, Unknown=2, NotChecked=0, Total=4970
[2018-02-02 09:44:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2018-02-02 09:44:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 149.
[2018-02-02 09:44:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states.
[2018-02-02 09:44:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions.
[2018-02-02 09:44:45,279 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 53
[2018-02-02 09:44:45,279 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:45,279 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions.
[2018-02-02 09:44:45,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-02-02 09:44:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions.
[2018-02-02 09:44:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 09:44:45,279 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:45,280 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:45,280 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1013793731, now seen corresponding path program 1 times
[2018-02-02 09:44:45,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:45,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:45,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:45,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:45,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:45,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:44:45,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:44:45,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:44:45,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:44:45,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:44:45,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:44:45,322 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand 6 states.
[2018-02-02 09:44:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:45,463 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions.
[2018-02-02 09:44:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:44:45,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56
[2018-02-02 09:44:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:45,464 INFO L225 Difference]: With dead ends: 119
[2018-02-02 09:44:45,464 INFO L226 Difference]: Without dead ends: 119
[2018-02-02 09:44:45,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2018-02-02 09:44:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-02-02 09:44:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111.
[2018-02-02 09:44:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states.
[2018-02-02 09:44:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions.
[2018-02-02 09:44:45,467 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 56
[2018-02-02 09:44:45,467 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:45,467 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions.
[2018-02-02 09:44:45,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:44:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions.
[2018-02-02 09:44:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-02-02 09:44:45,468 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:45,468 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:45,468 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 615131242, now seen corresponding path program 1 times
[2018-02-02 09:44:45,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:45,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:45,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:45,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:45,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:45,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:45,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:45,945 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:45,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:45,986 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:45,995 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:45,996 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:45,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:44:45,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-02-02 09:44:46,031 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-02-02 09:44:46,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:46,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:46,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27
[2018-02-02 09:44:46,131 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 09:44:46,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:46,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,159 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,163 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-02-02 09:44:46,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:46,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,191 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-02-02 09:44:46,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53
[2018-02-02 09:44:46,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38
[2018-02-02 09:44:46,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31
[2018-02-02 09:44:46,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:46,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:46,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58
[2018-02-02 09:44:46,424 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 13
[2018-02-02 09:44:46,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66
[2018-02-02 09:44:46,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 09:44:46,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:46,468 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:46,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:46,494 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:131
[2018-02-02 09:44:46,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44
[2018-02-02 09:44:46,568 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,569 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 37
[2018-02-02 09:44:46,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,588 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52
[2018-02-02 09:44:46,592 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 09:44:46,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61
[2018-02-02 09:44:46,640 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,641 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 14 treesize of output 21
[2018-02-02 09:44:46,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,657 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,657 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:44:46,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68
[2018-02-02 09:44:46,713 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 30 treesize of output 36
[2018-02-02 09:44:46,716 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 18 treesize of output 11
[2018-02-02 09:44:46,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,732 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55
[2018-02-02 09:44:46,736 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 14 treesize of output 7
[2018-02-02 09:44:46,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62
[2018-02-02 09:44:46,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 09:44:46,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:46,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,838 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:46,842 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 86 treesize of output 86
[2018-02-02 09:44:46,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:46,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:46,863 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-02-02 09:44:46,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88
[2018-02-02 09:44:46,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107
[2018-02-02 09:44:46,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:44:46,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:47,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:47,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 110
[2018-02-02 09:44:47,105 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 24 treesize of output 23
[2018-02-02 09:44:47,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118
[2018-02-02 09:44:47,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39
[2018-02-02 09:44:47,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:47,187 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:47,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:47,255 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:142, output treesize:223
[2018-02-02 09:44:47,347 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 177 treesize of output 130
[2018-02-02 09:44:47,350 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:47,352 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 22
[2018-02-02 09:44:47,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,396 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 66 treesize of output 57
[2018-02-02 09:44:47,398 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:47,399 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 22
[2018-02-02 09:44:47,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:47,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101
[2018-02-02 09:44:47,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61
[2018-02-02 09:44:47,555 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 31 treesize of output 23
[2018-02-02 09:44:47,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:47,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16
[2018-02-02 09:44:47,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:47,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:47,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20
[2018-02-02 09:44:47,607 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-02-02 09:44:47,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:47,614 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,615 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:47,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:47,622 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18
[2018-02-02 09:44:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:47,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:47,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38
[2018-02-02 09:44:47,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-02-02 09:44:47,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-02-02 09:44:47,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482
[2018-02-02 09:44:47,752 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 39 states.
[2018-02-02 09:44:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:50,260 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions.
[2018-02-02 09:44:50,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-02-02 09:44:50,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58
[2018-02-02 09:44:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:50,261 INFO L225 Difference]: With dead ends: 226
[2018-02-02 09:44:50,261 INFO L226 Difference]: Without dead ends: 226
[2018-02-02 09:44:50,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=504, Invalid=4052, Unknown=0, NotChecked=0, Total=4556
[2018-02-02 09:44:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2018-02-02 09:44:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147.
[2018-02-02 09:44:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-02-02 09:44:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions.
[2018-02-02 09:44:50,265 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 58
[2018-02-02 09:44:50,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:50,265 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions.
[2018-02-02 09:44:50,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-02-02 09:44:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions.
[2018-02-02 09:44:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-02-02 09:44:50,266 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:50,266 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:50,266 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash 615131241, now seen corresponding path program 1 times
[2018-02-02 09:44:50,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:50,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:50,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:50,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:50,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:50,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:50,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:50,543 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:50,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:50,570 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:50,575 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,576 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:44:50,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-02-02 09:44:50,583 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-02-02 09:44:50,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:50,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20
[2018-02-02 09:44:50,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26
[2018-02-02 09:44:50,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:50,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,627 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-02-02 09:44:50,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33
[2018-02-02 09:44:50,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31
[2018-02-02 09:44:50,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 09:44:50,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:50,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:50,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:50,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76
[2018-02-02 09:44:50,764 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,768 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 42 treesize of output 41
[2018-02-02 09:44:50,770 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 09:44:50,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33
[2018-02-02 09:44:50,782 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,782 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,783 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,783 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:44:50,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31
[2018-02-02 09:44:50,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33
[2018-02-02 09:44:50,814 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 14 treesize of output 7
[2018-02-02 09:44:50,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37
[2018-02-02 09:44:50,863 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:50,867 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 53 treesize of output 53
[2018-02-02 09:44:50,869 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 14 treesize of output 13
[2018-02-02 09:44:50,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:50,883 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-02-02 09:44:50,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50
[2018-02-02 09:44:50,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83
[2018-02-02 09:44:50,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:44:50,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:51,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:51,025 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-02-02 09:44:51,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:126
[2018-02-02 09:44:51,082 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 104 treesize of output 77
[2018-02-02 09:44:51,085 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:51,088 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 22
[2018-02-02 09:44:51,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:51,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:51,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:51,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:61
[2018-02-02 09:44:51,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 43
[2018-02-02 09:44:51,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16
[2018-02-02 09:44:51,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:51,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:51,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:51,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2018-02-02 09:44:51,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:51,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:51,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:51,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5
[2018-02-02 09:44:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:51,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:51,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 33
[2018-02-02 09:44:51,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states
[2018-02-02 09:44:51,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2018-02-02 09:44:51,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 09:44:51,245 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 34 states.
[2018-02-02 09:44:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:52,602 INFO L93 Difference]: Finished difference Result 228 states and 237 transitions.
[2018-02-02 09:44:52,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 09:44:52,603 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58
[2018-02-02 09:44:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:52,603 INFO L225 Difference]: With dead ends: 228
[2018-02-02 09:44:52,603 INFO L226 Difference]: Without dead ends: 228
[2018-02-02 09:44:52,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=507, Invalid=3153, Unknown=0, NotChecked=0, Total=3660
[2018-02-02 09:44:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states.
[2018-02-02 09:44:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 147.
[2018-02-02 09:44:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-02-02 09:44:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions.
[2018-02-02 09:44:52,607 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58
[2018-02-02 09:44:52,607 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:52,607 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions.
[2018-02-02 09:44:52,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2018-02-02 09:44:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions.
[2018-02-02 09:44:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-02-02 09:44:52,608 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:52,608 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:52,608 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:52,608 INFO L82 PathProgramCache]: Analyzing trace with hash 549678038, now seen corresponding path program 2 times
[2018-02-02 09:44:52,608 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:52,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:52,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:52,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:52,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:52,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:52,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:52,855 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:52,859 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:44:52,867 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:44:52,876 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:44:52,879 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:44:52,882 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:52,922 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:52,922 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:52,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:44:52,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:52,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:52,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17
[2018-02-02 09:44:52,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:52,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:52,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:52,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:52,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:52,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:52,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:52,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:52,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:52,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25
[2018-02-02 09:44:53,007 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:53,010 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 51 treesize of output 55
[2018-02-02 09:44:53,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:53,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,023 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:53,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 09:44:53,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:53,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,082 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-02-02 09:44:53,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51
[2018-02-02 09:44:53,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44
[2018-02-02 09:44:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31
[2018-02-02 09:44:53,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:53,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:53,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91
[2018-02-02 09:44:53,212 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:53,212 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 20 treesize of output 38
[2018-02-02 09:44:53,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,222 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:53,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 78
[2018-02-02 09:44:53,232 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:53,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 24
[2018-02-02 09:44:53,233 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,243 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:53,265 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:165
[2018-02-02 09:44:53,322 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 117 treesize of output 107
[2018-02-02 09:44:53,324 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:53,325 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 30
[2018-02-02 09:44:53,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,343 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 77 treesize of output 72
[2018-02-02 09:44:53,345 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:53,347 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 30
[2018-02-02 09:44:53,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49
[2018-02-02 09:44:53,510 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:53,511 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:53,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69
[2018-02-02 09:44:53,543 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:53,544 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 46 treesize of output 30
[2018-02-02 09:44:53,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:53,551 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:53,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26
[2018-02-02 09:44:53,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:53,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29
[2018-02-02 09:44:53,567 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:53,567 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 25 treesize of output 17
[2018-02-02 09:44:53,567 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-02-02 09:44:53,571 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:53,577 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7
[2018-02-02 09:44:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:53,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:53,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33
[2018-02-02 09:44:53,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 09:44:53,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 09:44:53,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=946, Unknown=8, NotChecked=0, Total=1056
[2018-02-02 09:44:53,648 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 33 states.
[2018-02-02 09:44:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:54,413 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions.
[2018-02-02 09:44:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 09:44:54,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59
[2018-02-02 09:44:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:54,414 INFO L225 Difference]: With dead ends: 167
[2018-02-02 09:44:54,414 INFO L226 Difference]: Without dead ends: 142
[2018-02-02 09:44:54,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=346, Invalid=2095, Unknown=9, NotChecked=0, Total=2450
[2018-02-02 09:44:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states.
[2018-02-02 09:44:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129.
[2018-02-02 09:44:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-02-02 09:44:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions.
[2018-02-02 09:44:54,416 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59
[2018-02-02 09:44:54,416 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:54,416 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions.
[2018-02-02 09:44:54,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 09:44:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions.
[2018-02-02 09:44:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-02-02 09:44:54,416 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:54,416 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:54,416 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash -112377493, now seen corresponding path program 1 times
[2018-02-02 09:44:54,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:54,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:54,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:54,417 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:44:54,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:54,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:54,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:54,736 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:54,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:54,763 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:54,779 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:54,779 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:54,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:44:54,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-02-02 09:44:54,786 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-02-02 09:44:54,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:54,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:44:54,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:54,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20
[2018-02-02 09:44:54,824 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 21 treesize of output 14
[2018-02-02 09:44:54,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:54,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,834 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 39
[2018-02-02 09:44:54,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:54,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,843 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-02-02 09:44:54,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46
[2018-02-02 09:44:54,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38
[2018-02-02 09:44:54,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39
[2018-02-02 09:44:54,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:54,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:54,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66
[2018-02-02 09:44:54,959 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44: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, 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 17
[2018-02-02 09:44:54,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:54,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70
[2018-02-02 09:44:54,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31
[2018-02-02 09:44:54,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:54,991 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:55,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:55,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141
[2018-02-02 09:44:55,062 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60
[2018-02-02 09:44:55,067 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,068 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 22
[2018-02-02 09:44:55,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59
[2018-02-02 09:44:55,090 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,091 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 45
[2018-02-02 09:44:55,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59
[2018-02-02 09:44:55,104 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,105 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,105 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,106 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42
[2018-02-02 09:44:55,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:76
[2018-02-02 09:44:55,153 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 45 treesize of output 55
[2018-02-02 09:44:55,155 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 22 treesize of output 23
[2018-02-02 09:44:55,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,172 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61
[2018-02-02 09:44:55,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19
[2018-02-02 09:44:55,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:74
[2018-02-02 09:44:55,256 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,257 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,257 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120
[2018-02-02 09:44:55,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:55,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43
[2018-02-02 09:44:55,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:55,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,310 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-02-02 09:44:55,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:92
[2018-02-02 09:44:55,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 117
[2018-02-02 09:44:55,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:44:55,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:55,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:55,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 128
[2018-02-02 09:44:55,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:44:55,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:55,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:55,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 120
[2018-02-02 09:44:55,549 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 20 treesize of output 15
[2018-02-02 09:44:55,549 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,560 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:55,592 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:163, output treesize:213
[2018-02-02 09:44:55,654 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 202 treesize of output 176
[2018-02-02 09:44:55,655 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,656 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 46 treesize of output 26
[2018-02-02 09:44:55,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,680 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 164 treesize of output 121
[2018-02-02 09:44:55,682 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:55,687 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 46 treesize of output 26
[2018-02-02 09:44:55,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,703 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-02-02 09:44:55,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:224, output treesize:114
[2018-02-02 09:44:55,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 88
[2018-02-02 09:44:55,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:55,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57
[2018-02-02 09:44:55,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,803 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-02-02 09:44:55,803 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:128, output treesize:86
[2018-02-02 09:44:55,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50
[2018-02-02 09:44:55,873 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 22 treesize of output 16
[2018-02-02 09:44:55,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:55,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:55,880 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,886 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-02-02 09:44:55,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:55,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:55,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:55,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28
[2018-02-02 09:44:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:55,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:55,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 38
[2018-02-02 09:44:55,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-02-02 09:44:55,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-02-02 09:44:55,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482
[2018-02-02 09:44:55,996 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 39 states.
[2018-02-02 09:44:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:44:57,434 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions.
[2018-02-02 09:44:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-02-02 09:44:57,435 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 62
[2018-02-02 09:44:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:44:57,435 INFO L225 Difference]: With dead ends: 179
[2018-02-02 09:44:57,435 INFO L226 Difference]: Without dead ends: 179
[2018-02-02 09:44:57,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=483, Invalid=3299, Unknown=0, NotChecked=0, Total=3782
[2018-02-02 09:44:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2018-02-02 09:44:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131.
[2018-02-02 09:44:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2018-02-02 09:44:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions.
[2018-02-02 09:44:57,437 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62
[2018-02-02 09:44:57,438 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:44:57,438 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions.
[2018-02-02 09:44:57,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-02-02 09:44:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions.
[2018-02-02 09:44:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-02-02 09:44:57,438 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:44:57,438 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:44:57,438 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:44:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash -112377492, now seen corresponding path program 1 times
[2018-02-02 09:44:57,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:44:57,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:44:57,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:57,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:57,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:44:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:57,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:44:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:57,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:44:57,825 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:44:57,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:44:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:44:57,852 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:44:57,857 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:57,858 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:57,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:44:57,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-02-02 09:44:57,865 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-02-02 09:44:57,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:57,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,877 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-02-02 09:44:57,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:44:57,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20
[2018-02-02 09:44:57,910 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 51 treesize of output 47
[2018-02-02 09:44:57,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:57,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14
[2018-02-02 09:44:57,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:57,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:57,932 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-02-02 09:44:57,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46
[2018-02-02 09:44:58,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48
[2018-02-02 09:44:58,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31
[2018-02-02 09:44:58,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 78
[2018-02-02 09:44:58,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51
[2018-02-02 09:44:58,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66
[2018-02-02 09:44:58,125 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:58,126 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 20 treesize of output 21
[2018-02-02 09:44:58,126 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,133 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:58,159 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:159
[2018-02-02 09:44:58,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59
[2018-02-02 09:44:58,215 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 45
[2018-02-02 09:44:58,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,231 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60
[2018-02-02 09:44:58,235 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,236 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 22
[2018-02-02 09:44:58,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59
[2018-02-02 09:44:58,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:44:58,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,259 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,259 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,260 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,266 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:44:58,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65
[2018-02-02 09:44:58,307 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:44:58,309 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 45 treesize of output 56
[2018-02-02 09:44:58,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 23
[2018-02-02 09:44:58,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,325 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52
[2018-02-02 09:44:58,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19
[2018-02-02 09:44:58,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75
[2018-02-02 09:44:58,395 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,396 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 102
[2018-02-02 09:44:58,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:58,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,422 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,423 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,430 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 98 treesize of output 106
[2018-02-02 09:44:58,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:44:58,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,450 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-02-02 09:44:58,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97
[2018-02-02 09:44:58,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 123
[2018-02-02 09:44:58,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:44:58,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 145
[2018-02-02 09:44:58,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:44:58,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:44:58,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 135
[2018-02-02 09:44:58,654 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 20 treesize of output 15
[2018-02-02 09:44:58,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:44:58,702 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:164, output treesize:217
[2018-02-02 09:44:58,761 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 217 treesize of output 199
[2018-02-02 09:44:58,763 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,764 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 46 treesize of output 26
[2018-02-02 09:44:58,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,789 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 170 treesize of output 127
[2018-02-02 09:44:58,798 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:44:58,799 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 46 treesize of output 26
[2018-02-02 09:44:58,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,814 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-02-02 09:44:58,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115
[2018-02-02 09:44:58,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98
[2018-02-02 09:44:58,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:58,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:58,996 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 45 treesize of output 37
[2018-02-02 09:44:58,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:59,006 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 54 treesize of output 21
[2018-02-02 09:44:59,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:59,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:44:59,024 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 30 treesize of output 32
[2018-02-02 09:44:59,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3
[2018-02-02 09:44:59,026 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:59,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:44:59,031 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:59,033 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:59,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:44:59,037 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9
[2018-02-02 09:44:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:44:59,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:44:59,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 36
[2018-02-02 09:44:59,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-02-02 09:44:59,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-02-02 09:44:59,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 09:44:59,122 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 37 states.
[2018-02-02 09:45:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:45:00,566 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions.
[2018-02-02 09:45:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-02 09:45:00,566 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 62
[2018-02-02 09:45:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:45:00,567 INFO L225 Difference]: With dead ends: 174
[2018-02-02 09:45:00,567 INFO L226 Difference]: Without dead ends: 174
[2018-02-02 09:45:00,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=328, Invalid=2978, Unknown=0, NotChecked=0, Total=3306
[2018-02-02 09:45:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2018-02-02 09:45:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131.
[2018-02-02 09:45:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2018-02-02 09:45:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions.
[2018-02-02 09:45:00,569 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62
[2018-02-02 09:45:00,569 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:45:00,569 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions.
[2018-02-02 09:45:00,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-02-02 09:45:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions.
[2018-02-02 09:45:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-02-02 09:45:00,570 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:45:00,570 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:45:00,570 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:45:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1937802051, now seen corresponding path program 3 times
[2018-02-02 09:45:00,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:45:00,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:45:00,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:45:00,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:45:00,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:45:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:45:00,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:45:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:45:01,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:45:01,190 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:45:01,195 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-02 09:45:01,203 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-02-02 09:45:01,210 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-02-02 09:45:01,244 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-02-02 09:45:01,247 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:45:01,249 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:45:01,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:45:01,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-02 09:45:01,327 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:01,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-02-02 09:45:01,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,335 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:01,336 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:01,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:45:01,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:45:01,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24
[2018-02-02 09:45:01,492 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 19 treesize of output 31
[2018-02-02 09:45:01,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23
[2018-02-02 09:45:01,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30
[2018-02-02 09:45:01,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:01,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:01,596 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:01,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36
[2018-02-02 09:45:01,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21
[2018-02-02 09:45:01,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,626 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 37 treesize of output 59
[2018-02-02 09:45:01,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 49
[2018-02-02 09:45:01,628 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,659 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:01,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:45:01,673 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:64, output treesize:117
[2018-02-02 09:45:01,846 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 118 treesize of output 126
[2018-02-02 09:45:01,851 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:01,860 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 3 case distinctions, treesize of input 112 treesize of output 114
[2018-02-02 09:45:01,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:01,962 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:01,964 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 113 treesize of output 109
[2018-02-02 09:45:01,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:02,118 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 81 treesize of output 76
[2018-02-02 09:45:02,120 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 09:45:02,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,134 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,198 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 62 treesize of output 57
[2018-02-02 09:45:02,200 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 09:45:02,201 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,211 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 113
[2018-02-02 09:45:02,303 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,305 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 102 treesize of output 117
[2018-02-02 09:45:02,305 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,376 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,384 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 3 case distinctions, treesize of input 90 treesize of output 109
[2018-02-02 09:45:02,385 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:02,429 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:02,432 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 79 treesize of output 68
[2018-02-02 09:45:02,434 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,435 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 38 treesize of output 37
[2018-02-02 09:45:02,436 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,466 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts.
[2018-02-02 09:45:02,510 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:212, output treesize:169
[2018-02-02 09:45:02,616 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 60
[2018-02-02 09:45:02,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,680 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,680 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 109
[2018-02-02 09:45:02,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,749 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,750 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50
[2018-02-02 09:45:02,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,808 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,809 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,810 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 97 treesize of output 90
[2018-02-02 09:45:02,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,891 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,892 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:02,892 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 59 treesize of output 53
[2018-02-02 09:45:02,893 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:02,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56
[2018-02-02 09:45:02,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts.
[2018-02-02 09:45:03,022 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:211, output treesize:193
[2018-02-02 09:45:03,158 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 60 treesize of output 55
[2018-02-02 09:45:03,160 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 14 treesize of output 14
[2018-02-02 09:45:03,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,256 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:03,256 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 49 treesize of output 49
[2018-02-02 09:45:03,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14
[2018-02-02 09:45:03,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,337 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:03,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 111
[2018-02-02 09:45:03,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 108 treesize of output 97
[2018-02-02 09:45:03,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:03,449 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 62 treesize of output 57
[2018-02-02 09:45:03,451 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 14 treesize of output 9
[2018-02-02 09:45:03,451 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,459 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,498 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:03,499 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 53 treesize of output 48
[2018-02-02 09:45:03,500 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 14 treesize of output 9
[2018-02-02 09:45:03,500 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,506 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,550 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 3 case distinctions, treesize of input 89 treesize of output 95
[2018-02-02 09:45:03,553 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 88 treesize of output 82
[2018-02-02 09:45:03,553 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,602 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:03,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 93
[2018-02-02 09:45:03,609 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts.
[2018-02-02 09:45:03,659 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-02-02 09:45:03,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 4 xjuncts.
[2018-02-02 09:45:03,708 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 9 variables, input treesize:223, output treesize:232
[2018-02-02 09:45:03,890 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:03,891 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:03,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 145
[2018-02-02 09:45:03,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:45:03,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:03,993 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:03,996 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 89 treesize of output 93
[2018-02-02 09:45:03,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:45:03,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,071 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:04,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 126
[2018-02-02 09:45:04,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:45:04,077 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:04,145 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 81 treesize of output 82
[2018-02-02 09:45:04,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 14 treesize of output 13
[2018-02-02 09:45:04,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,156 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,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 0 case distinctions, treesize of input 73 treesize of output 69
[2018-02-02 09:45:04,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:45:04,211 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,218 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,262 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:04,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 82
[2018-02-02 09:45:04,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:45:04,267 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,277 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts.
[2018-02-02 09:45:04,315 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:304, output treesize:252
[2018-02-02 09:45:04,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83
[2018-02-02 09:45:04,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 09:45:04,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:04,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:04,713 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:04,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 80
[2018-02-02 09:45:04,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 22
[2018-02-02 09:45:04,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85
[2018-02-02 09:45:04,732 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:04,732 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 20 treesize of output 28
[2018-02-02 09:45:04,733 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:04,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 189
[2018-02-02 09:45:04,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:45:04,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:04,868 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:04,954 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:04,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 128
[2018-02-02 09:45:04,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 20 treesize of output 13
[2018-02-02 09:45:04,963 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,977 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:04,979 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:04,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 136
[2018-02-02 09:45:04,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:45:04,993 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:05,014 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:05,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts.
[2018-02-02 09:45:05,096 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:275, output treesize:379
[2018-02-02 09:45:05,217 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 232
[2018-02-02 09:45:05,235 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,236 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 226 treesize of output 206
[2018-02-02 09:45:05,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,288 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 203 treesize of output 207
[2018-02-02 09:45:05,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:05,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:05,406 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 117 treesize of output 107
[2018-02-02 09:45:05,408 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,409 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 18
[2018-02-02 09:45:05,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 129
[2018-02-02 09:45:05,484 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 94
[2018-02-02 09:45:05,487 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,499 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,502 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 148
[2018-02-02 09:45:05,522 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,524 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 171 treesize of output 151
[2018-02-02 09:45:05,524 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,569 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 134
[2018-02-02 09:45:05,579 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:05,615 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:05,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 73
[2018-02-02 09:45:05,665 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:05,666 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 18
[2018-02-02 09:45:05,666 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,673 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-02 09:45:05,704 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:345, output treesize:255
[2018-02-02 09:45:05,972 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 72 treesize of output 63
[2018-02-02 09:45:05,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:45:05,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,982 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:05,983 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 28 treesize of output 20
[2018-02-02 09:45:05,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:05,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36
[2018-02-02 09:45:06,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:45:06,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,021 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:06,021 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-02-02 09:45:06,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,048 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:06,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 124
[2018-02-02 09:45:06,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90
[2018-02-02 09:45:06,055 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:45:06,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 91
[2018-02-02 09:45:06,089 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:45:06,133 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 90 treesize of output 85
[2018-02-02 09:45:06,134 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,178 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:06,179 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 79 treesize of output 71
[2018-02-02 09:45:06,179 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,180 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:06,180 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 87 treesize of output 79
[2018-02-02 09:45:06,181 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,224 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:06,224 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 85 treesize of output 75
[2018-02-02 09:45:06,224 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,264 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-02 09:45:06,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 70
[2018-02-02 09:45:06,316 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 66 treesize of output 59
[2018-02-02 09:45:06,316 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,343 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:06,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52
[2018-02-02 09:45:06,344 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,369 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 46 treesize of output 36
[2018-02-02 09:45:06,370 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,392 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 61
[2018-02-02 09:45:06,400 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 57 treesize of output 52
[2018-02-02 09:45:06,400 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,423 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 52 treesize of output 41
[2018-02-02 09:45:06,423 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,444 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 53 treesize of output 41
[2018-02-02 09:45:06,444 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,467 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 41 treesize of output 32
[2018-02-02 09:45:06,467 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,484 INFO L267 ElimStorePlain]: Start of recursive call 19: 5 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,498 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 72 treesize of output 60
[2018-02-02 09:45:06,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-02-02 09:45:06,501 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:45:06,512 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,521 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:06,522 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 14
[2018-02-02 09:45:06,522 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,529 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:06,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts.
[2018-02-02 09:45:06,559 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 10 variables, input treesize:207, output treesize:113
[2018-02-02 09:45:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:45:06,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:45:06,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44
[2018-02-02 09:45:06,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states
[2018-02-02 09:45:06,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2018-02-02 09:45:06,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1808, Unknown=0, NotChecked=0, Total=1980
[2018-02-02 09:45:06,808 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 45 states.
[2018-02-02 09:45:08,266 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 163 DAG size of output 57
[2018-02-02 09:45:08,763 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 211 DAG size of output 65
[2018-02-02 09:45:09,105 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 211 DAG size of output 79
[2018-02-02 09:45:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:45:10,635 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions.
[2018-02-02 09:45:10,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 09:45:10,635 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 63
[2018-02-02 09:45:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:45:10,636 INFO L225 Difference]: With dead ends: 215
[2018-02-02 09:45:10,636 INFO L226 Difference]: Without dead ends: 215
[2018-02-02 09:45:10,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=800, Invalid=4456, Unknown=0, NotChecked=0, Total=5256
[2018-02-02 09:45:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2018-02-02 09:45:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 168.
[2018-02-02 09:45:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states.
[2018-02-02 09:45:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions.
[2018-02-02 09:45:10,640 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 63
[2018-02-02 09:45:10,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:45:10,640 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions.
[2018-02-02 09:45:10,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states.
[2018-02-02 09:45:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions.
[2018-02-02 09:45:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-02-02 09:45:10,641 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:45:10,641 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:45:10,641 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:45:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1937802050, now seen corresponding path program 2 times
[2018-02-02 09:45:10,642 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:45:10,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:45:10,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:45:10,642 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:45:10,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:45:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:45:10,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:45:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:45:11,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:45:11,131 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:45:11,137 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:45:11,146 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:45:11,155 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:45:11,159 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:45:11,161 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:45:11,175 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,176 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:45:11,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-02-02 09:45:11,195 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-02-02 09:45:11,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 09:45:11,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23
[2018-02-02 09:45:11,242 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34
[2018-02-02 09:45:11,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:45:11,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,256 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-02-02 09:45:11,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36
[2018-02-02 09:45:11,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31
[2018-02-02 09:45:11,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 09:45:11,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:11,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:11,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:45:11,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:82
[2018-02-02 09:45:11,418 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,421 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 42 treesize of output 41
[2018-02-02 09:45:11,422 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 09:45:11,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36
[2018-02-02 09:45:11,435 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,436 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,436 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,436 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:45:11,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34
[2018-02-02 09:45:11,467 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33
[2018-02-02 09:45:11,471 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 14 treesize of output 7
[2018-02-02 09:45:11,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40
[2018-02-02 09:45:11,540 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,543 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 53 treesize of output 53
[2018-02-02 09:45:11,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 09:45:11,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,556 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-02-02 09:45:11,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53
[2018-02-02 09:45:11,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71
[2018-02-02 09:45:11,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:45:11,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:11,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:45:11,697 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-02-02 09:45:11,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:148
[2018-02-02 09:45:11,760 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 104 treesize of output 77
[2018-02-02 09:45:11,761 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:45:11,762 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 22
[2018-02-02 09:45:11,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:45:11,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:64
[2018-02-02 09:45:11,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48
[2018-02-02 09:45:11,901 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:45:11,901 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 27 treesize of output 19
[2018-02-02 09:45:11,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2018-02-02 09:45:11,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:45:11,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:45:11,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5
[2018-02-02 09:45:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:45:11,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:45:11,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 39
[2018-02-02 09:45:11,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states
[2018-02-02 09:45:11,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2018-02-02 09:45:11,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 09:45:11,948 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 40 states.
[2018-02-02 09:45:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:45:13,841 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions.
[2018-02-02 09:45:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 09:45:13,841 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 63
[2018-02-02 09:45:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:45:13,842 INFO L225 Difference]: With dead ends: 222
[2018-02-02 09:45:13,842 INFO L226 Difference]: Without dead ends: 222
[2018-02-02 09:45:13,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=686, Invalid=3870, Unknown=0, NotChecked=0, Total=4556
[2018-02-02 09:45:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2018-02-02 09:45:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 168.
[2018-02-02 09:45:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states.
[2018-02-02 09:45:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions.
[2018-02-02 09:45:13,844 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63
[2018-02-02 09:45:13,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:45:13,845 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions.
[2018-02-02 09:45:13,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states.
[2018-02-02 09:45:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions.
[2018-02-02 09:45:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-02-02 09:45:13,845 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:45:13,845 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:45:13,845 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 09:45:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2058261949, now seen corresponding path program 1 times
[2018-02-02 09:45:13,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:45:13,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:45:13,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:45:13,846 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:45:13,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:45:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-02-02 09:45:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-02-02 09:45:13,887 INFO L410 BasicCegarLoop]: Counterexample might be feasible
[2018-02-02 09:45:13,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:45:13 BoogieIcfgContainer
[2018-02-02 09:45:13,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 09:45:13,924 INFO L168 Benchmark]: Toolchain (without parser) took 43720.43 ms. Allocated memory was 403.2 MB in the beginning and 962.6 MB in the end (delta: 559.4 MB). Free memory was 360.1 MB in the beginning and 838.5 MB in the end (delta: -478.4 MB). Peak memory consumption was 81.0 MB. Max. memory is 5.3 GB.
[2018-02-02 09:45:13,925 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:45:13,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.50 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 348.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB.
[2018-02-02 09:45:13,925 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 ms. Allocated memory is still 403.2 MB. Free memory was 348.2 MB in the beginning and 345.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
[2018-02-02 09:45:13,925 INFO L168 Benchmark]: RCFGBuilder took 386.31 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 310.0 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 5.3 GB.
[2018-02-02 09:45:13,926 INFO L168 Benchmark]: TraceAbstraction took 43126.43 ms. Allocated memory was 403.2 MB in the beginning and 962.6 MB in the end (delta: 559.4 MB). Free memory was 308.7 MB in the beginning and 838.5 MB in the end (delta: -529.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB.
[2018-02-02 09:45:13,927 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.14 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 177.50 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 348.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 27.04 ms. Allocated memory is still 403.2 MB. Free memory was 348.2 MB in the beginning and 345.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 386.31 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 310.0 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 43126.43 ms. Allocated memory was 403.2 MB in the beginning and 962.6 MB in the end (delta: 559.4 MB). Free memory was 308.7 MB in the beginning and 838.5 MB in the end (delta: -529.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 1]: pointer dereference may fail
pointer dereference may fail
We found a FailurePath:
[L994] EXPR, FCALL malloc(sizeof(SLL))
VAL [malloc(sizeof(SLL))={30:0}]
[L994] SLL* list = malloc(sizeof(SLL));
VAL [list={30:0}, malloc(sizeof(SLL))={30:0}]
[L995] FCALL list->next = ((void*)0)
VAL [list={30:0}, malloc(sizeof(SLL))={30:0}]
[L996] FCALL list->prev = ((void*)0)
VAL [list={30:0}, malloc(sizeof(SLL))={30:0}]
[L997] FCALL list->colour = BLACK
VAL [list={30:0}, malloc(sizeof(SLL))={30:0}]
[L999] SLL* end = list;
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}]
[L1002] COND TRUE __VERIFIER_nondet_int()
[L1005] EXPR, FCALL malloc(sizeof(SLL))
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}]
[L1005] FCALL end->next = malloc(sizeof(SLL))
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}]
[L1006] EXPR, FCALL end->next
VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}]
[L1006] FCALL end->next->prev = end
VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}]
[L1007] EXPR, FCALL end->next
VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}]
[L1007] end = end->next
[L1008] FCALL end->next = ((void*)0)
VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}]
[L1010] COND FALSE !(__VERIFIER_nondet_int())
[L1016] FCALL end->colour = RED
VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}]
[L1017] EXPR, FCALL malloc(sizeof(SLL))
VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1017] FCALL end->next = malloc(sizeof(SLL))
VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1018] EXPR, FCALL end->next
VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1018] FCALL end->next->prev = end
VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1019] EXPR, FCALL end->next
VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1019] end = end->next
[L1020] FCALL end->next = ((void*)0)
VAL [end={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1021] FCALL end->colour = BLACK
VAL [end={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1002] COND FALSE !(__VERIFIER_nondet_int())
[L1025] end = ((void*)0)
[L1026] end = list
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1029] COND FALSE !(!(((void*)0) != end))
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1029] COND FALSE !(0)
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1030] EXPR, FCALL end->colour
VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1030] COND FALSE !(!(BLACK == end->colour))
[L1030] COND FALSE !(0)
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1032] COND TRUE ((void*)0) != end
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1034] EXPR, FCALL end->colour
VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1034] COND FALSE !(RED == end->colour)
[L1040] EXPR, FCALL end->next
VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1040] COND FALSE !(!(end->next))
[L1040] COND FALSE !(0)
VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1041] EXPR, FCALL end->next
VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1041] end = end->next
[L1032] COND TRUE ((void*)0) != end
VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1034] EXPR, FCALL end->colour
VAL [end={15:0}, end->colour=0, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1034] COND TRUE RED == end->colour
[L1036] EXPR, FCALL end->next
VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1036] end = end->next
[L1037] EXPR, FCALL end->next
VAL [end={27:0}, end->next={0:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
[L1037] end = end->next
[L1040] FCALL end->next
VAL [end={0:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={27:0}]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 135 locations, 59 error locations. UNSAFE Result, 43.0s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 22.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1891 SDtfs, 8546 SDslu, 11798 SDs, 0 SdLazy, 18968 SolverSat, 1709 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1218 GetRequests, 441 SyntacticMatches, 46 SemanticMatches, 731 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9755 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=25, 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1077 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 1617 NumberOfCodeBlocks, 1617 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1516 ConstructedInterpolants, 299 QuantifiedInterpolants, 2538445 SizeOfPredicates, 192 NumberOfNonLiveVariables, 2316 ConjunctsInSsa, 540 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 19/228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-45-13-934.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-45-13-934.csv
Received shutdown request...